condition('C1', resolution, ok, 28).
condition('C2', well_founded, ok, 105).
condition('C3', justification, ok, 105).
condition('C4', coverage, ok, 105).
condition('C5', re_decision, ok, 53).
condition('C6', boundary_consistency, ok, 0).
condition('C7', relevance, ok, 106).
obligation(collected, theory_scoped, findall(A - B, (knight_move(p(1, 1), B), \+ member(B, [p(1, 1)]), degree(B, [p(1, 1)], A)), [5 - p(2, 3), 5 - p(3, 2)])).
obligation(collected, theory_scoped, findall(A - B, (knight_move(p(2, 3), B), \+ member(B, [p(2, 3), p(1, 1)]), degree(B, [p(2, 3), p(1, 1)], A)), [3 - p(3, 5), 3 - p(4, 4), 1 - p(1, 5), 3 - p(3, 1), 3 - p(4, 2)])).
obligation(collected, theory_scoped, findall(A - B, (knight_move(p(1, 5), B), \+ member(B, [p(1, 5), p(2, 3), p(1, 1)]), degree(B, [p(1, 5), p(2, 3), p(1, 1)], A)), [5 - p(3, 4)])).
obligation(collected, theory_scoped, findall(A - B, (knight_move(p(3, 4), B), \+ member(B, [p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(B, [p(3, 4), p(1, 5), p(2, 3), p(1, 1)], A)), [1 - p(5, 5), 2 - p(4, 2), 3 - p(5, 3), 3 - p(2, 2), 3 - p(1, 3)])).
obligation(collected, theory_scoped, findall(A - B, (knight_move(p(5, 5), B), \+ member(B, [p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(B, [p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], A)), [5 - p(4, 3)])).
obligation(collected, theory_scoped, findall(A - B, (knight_move(p(4, 3), B), \+ member(B, [p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(B, [p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], A)), [2 - p(3, 5), 3 - p(2, 4), 1 - p(5, 1), 2 - p(3, 1), 2 - p(2, 2)])).
obligation(collected, theory_scoped, findall(A - B, (knight_move(p(5, 1), B), \+ member(B, [p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(B, [p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], A)), [4 - p(3, 2)])).
obligation(collected, theory_scoped, findall(A - B, (knight_move(p(3, 2), B), \+ member(B, [p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(B, [p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], A)), [2 - p(4, 4), 2 - p(5, 3), 2 - p(2, 4), 2 - p(1, 3)])).
obligation(collected, theory_scoped, findall(A - B, (knight_move(p(4, 4), B), \+ member(B, [p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(B, [p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], A)), [2 - p(2, 5), 2 - p(5, 2)])).
obligation(collected, theory_scoped, findall(A - B, (knight_move(p(2, 5), B), \+ member(B, [p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(B, [p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], A)), [7 - p(3, 3), 1 - p(1, 3)])).
obligation(collected, theory_scoped, findall(A - B, (knight_move(p(1, 3), B), \+ member(B, [p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(B, [p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], A)), [2 - p(2, 1)])).
obligation(collected, theory_scoped, findall(A - B, (knight_move(p(2, 1), B), \+ member(B, [p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(B, [p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], A)), [6 - p(3, 3), 1 - p(4, 2)])).
obligation(collected, theory_scoped, findall(A - B, (knight_move(p(4, 2), B), \+ member(B, [p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(B, [p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], A)), [2 - p(5, 4)])).
obligation(collected, theory_scoped, findall(A - B, (knight_move(p(5, 4), B), \+ member(B, [p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(B, [p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], A)), [1 - p(3, 5), 5 - p(3, 3)])).
obligation(collected, theory_scoped, findall(A - B, (knight_move(p(3, 5), B), \+ member(B, [p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(B, [p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], A)), [2 - p(1, 4)])).
obligation(collected, theory_scoped, findall(A - B, (knight_move(p(1, 4), B), \+ member(B, [p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(B, [p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], A)), [1 - p(2, 2), 4 - p(3, 3)])).
obligation(collected, theory_scoped, findall(A - B, (knight_move(p(2, 2), B), \+ member(B, [p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(B, [p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], A)), [2 - p(4, 1)])).
obligation(collected, theory_scoped, findall(A - B, (knight_move(p(4, 1), B), \+ member(B, [p(4, 1), p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(B, [p(4, 1), p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], A)), [1 - p(5, 3), 3 - p(3, 3)])).
obligation(collected, theory_scoped, findall(A - B, (knight_move(p(5, 3), B), \+ member(B, [p(5, 3), p(4, 1), p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(B, [p(5, 3), p(4, 1), p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], A)), [2 - p(4, 5)])).
obligation(collected, theory_scoped, findall(A - B, (knight_move(p(4, 5), B), \+ member(B, [p(4, 5), p(5, 3), p(4, 1), p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(B, [p(4, 5), p(5, 3), p(4, 1), p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], A)), [2 - p(3, 3), 1 - p(2, 4)])).
obligation(collected, theory_scoped, findall(A - B, (knight_move(p(2, 4), B), \+ member(B, [p(2, 4), p(4, 5), p(5, 3), p(4, 1), p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(B, [p(2, 4), p(4, 5), p(5, 3), p(4, 1), p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], A)), [2 - p(1, 2)])).
obligation(collected, theory_scoped, findall(A - B, (knight_move(p(1, 2), B), \+ member(B, [p(1, 2), p(2, 4), p(4, 5), p(5, 3), p(4, 1), p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(B, [p(1, 2), p(2, 4), p(4, 5), p(5, 3), p(4, 1), p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], A)), [1 - p(3, 3), 1 - p(3, 1)])).
obligation(collected, theory_scoped, findall(A - B, (knight_move(p(3, 3), B), \+ member(B, [p(3, 3), p(1, 2), p(2, 4), p(4, 5), p(5, 3), p(4, 1), p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(B, [p(3, 3), p(1, 2), p(2, 4), p(4, 5), p(5, 3), p(4, 1), p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], A)), [1 - p(5, 2)])).
obligation(collected, theory_scoped, findall(A - B, (knight_move(p(5, 2), B), \+ member(B, [p(5, 2), p(3, 3), p(1, 2), p(2, 4), p(4, 5), p(5, 3), p(4, 1), p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)]), degree(B, [p(5, 2), p(3, 3), p(1, 2), p(2, 4), p(4, 5), p(5, 3), p(4, 1), p(2, 2), p(1, 4), p(3, 5), p(5, 4), p(4, 2), p(2, 1), p(1, 3), p(2, 5), p(4, 4), p(3, 2), p(5, 1), p(4, 3), p(5, 5), p(3, 4), p(1, 5), p(2, 3), p(1, 1)], A)), [0 - p(3, 1)])).
steps(105).
verified(28).
recomputed(53).
composed(0).
trusted(24).
claims(1).
verdict(checked_with_obligations).