1 files changed, 40 insertions, 0 deletions
diff --git a/prolog/problems/lists/shiftright_2/common.py b/prolog/problems/lists/shiftright_2/common.py
index 5358935..e9b7a7a 100644
--- a/prolog/problems/lists/shiftright_2/common.py
+++ b/prolog/problems/lists/shiftright_2/common.py
@@ -1,5 +1,9 @@
 # coding=utf-8
 
+from operator import itemgetter
+import prolog.engine
+import server.problems
+
 id = 114
 number = 21
 visible = True
@@ -12,3 +16,39 @@ conc114([H|T], L2, [H|L]) :-
 shiftright(L1, [H|T]) :-
   conc114(T, [H], L1).
 '''
+
+test_cases = [
+    ('shiftright([i], X)',
+        [{'X': '[i]'}]),
+    ('shiftright([h, e, u, l], X)',
+        [{'X': '[l, h, e, u]'}]),
+    ('shiftright([h, A, B, l, c], [C, D, x, y, E])',
+        [{'A': 'x', 'B': 'y', 'C': 'c', 'D': 'h', 'E': 'l'}]),
+]
+
+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 []