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
|
# coding=utf-8
from operator import itemgetter
import prolog.engine
import server.problems
id = 113
number = 20
visible = True
facts = None
solution = '''\
conc113([], L, L).
conc113([H|T], L2, [H|L]) :-
conc113(T, L2, L).
shiftleft([H|T], L2) :-
conc113(T, [H], L2).
'''
test_cases = [
('shiftleft([i], X)',
[{'X': '[i]'}]),
('shiftleft([h, e, u, l], X)',
[{'X': '[e, u, l, h]'}]),
('shiftleft([h, A, B, l, c], [x, y, C, D, E])',
[{'A': 'x', 'B': 'y', 'C': 'l', 'D': 'c', 'E': 'h'}]),
]
def test(program, solved_problems):
code = (program + '\n' +
server.problems.solutions_for_problems('prolog', solved_problems))
n_correct = 0
engine_id = None
try:
engine_id, output = prolog.engine.create(code=code, timeout=1.0)
if engine_id is not None and 'error' not in map(itemgetter(0), output):
# Engine successfully created, and no syntax error in program.
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)
passed = n_correct == len(test_cases)
hints = [{'id': 'test_results', 'args': {'passed': n_correct, 'total': len(test_cases)}}]
return passed, hints
def hint(program, solved_problems):
# TODO
return []
|
