summaryrefslogtreecommitdiff
path: root/prolog/problems/family_relations/brother_2/common.py
blob: 13f7ab5d3b494fb5390e6182fc3fb2f4a3ec3608 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
# coding=utf-8

from operator import itemgetter
import socket
import prolog.engine
import prolog.util
from server.hints import Hint, HintSequence
import server.problems

id = 97
group = 'family_relations'
number = 4
visible = True
facts = 'family_relations'

solution = '''\
brother(X, Y) :-
  parent(P, X),
  parent(P, Y),
  male(X),
  X \== Y.
'''

hint_type = {
    'x_must_be_male': Hint('x_must_be_male'),
    'common_parent_needed': Hint('common_parent_needed'),
    'Y_can_be_of_any_gender': Hint('Y_can_be_of_any_gender'),
    'x_y_must_be_different': Hint('x_y_must_be_different'),
}

test_cases = [
    ('brother(X, _)',
        [{'X': 'alessandro'}, {'X': 'andrew'}, {'X': 'jeffrey'},
         {'X': 'kramer'}, {'X': 'michael'}, {'X': 'william'}]),
    ('brother(andrew, X)',
        [{'X': 'melanie'}]),
]

def test(program, solved_problems):
    code = (program + '\n' +
            server.problems.solutions_for_problems('prolog', solved_problems) + '\n' +
            server.problems.load_facts('prolog', facts).facts)

    engine_id = None
    try:
        engine_id, output = prolog.engine.create(code=code, timeout=1.0)
        if not engine_id or 'error' in map(itemgetter(0), output):
            # Engine creation failed, or syntax error in code.
            return 0, len(test_cases)

        n_correct = 0
        for query, answers in test_cases:
            # Limit inferences for each solution to curb unbounded recursion.
            limited = 'call_with_inference_limit(({}), 100000, _)'.format(query)
            if prolog.engine.check_answers(engine_id, query=limited, answers=answers, timeout=1.0):
                n_correct += 1
    finally:
        if engine_id:
            prolog.engine.destroy(engine_id)

    return n_correct, len(test_cases)

def hint(program, solved_problems):
    # tokens = prolog.util.tokenize(program)

    code = (program + '\n' +
            server.problems.solutions_for_problems('prolog', solved_problems) + '\n' +
            server.problems.load_facts('prolog', facts).facts)

    engine_id = None
    try:
        engine_id, output = prolog.engine.create(code=code, timeout=1.0)
        if not engine_id:
            raise Exception('Prolog engine failed to create.')

        # X must be male
        if prolog.engine.ask_truth(engine_id, 'female(X), brother(X, _)'):
            return [{'id': 'x_must_be_male'}]

        # X and Y must have a common parent
        if prolog.engine.ask_truth(engine_id,
            'brother(X, Y), \+ (parent(P, X), parent(P, Y))'):
            return [{'id': 'common_parent_needed'}]

        # Y can be of any gender, incl. female
        if prolog.engine.ask_one(engine_id,
            'brother(_, Y), female(Y)') == 'false':
            return [{'id': 'Y_can_be_of_any_gender'}]

        # X and Y must be different
        ans = prolog.engine.ask_one(engine_id,
            'setof(X, (member(X, [william, alessandro, andrew]), brother(X, X)), L), length(L, N).')
        # TODO this barfs if ans is 'false'
        #if ans.get('N') == '3':
        #    return [{'id': 'x_y_must_be_different'}]

    except socket.timeout as ex:
        pass

    finally:
        if engine_id:
            prolog.engine.destroy(engine_id)

    return None