# coding=utf-8

id = 102
number = 9
visible = True
facts = 'family_relations'

solution = '''\
connected(X, X, _).
connected(X, Y, N) :-
  N > 0,
  N1 is N - 1,
  ( parent(X, Z)
    ;
    parent(Z, X) ),
  connected(Z, Y, N1).
'''

test_cases = [
#    ('descendant(anna, X)',
#        [{'X': 'jerry'}, {'X': 'elaine'}, {'X': 'morty'}, {'X': 'helen'}]),
#    ('descendant(daniela, X)',
#        [{'X': 'nevia'}, {'X': 'aleksander'}, {'X': 'margaret'}, {'X': 'ana'}, {'X': 'aleksandr'}]),
#    ('descendant(X, william)',
#        [{'X': 'vanessa'}, {'X': 'patricia'}, {'X': 'susan'}, {'X': 'john'}, {'X': 'michael'}, {'X': 'michelle'}]),
]

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)

    passed = n_correct == len(test_cases)
    hints = [{'id': 'test_results', 'args': {'passed': n_correct, 'total': len(test_cases)}}]
    return passed, hints