%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : LCL097-1 : TPTP v9.2.1. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu May 7 07:27:22 PM UTC 2026
% Result : Unsatisfiable 9.24s 2.37s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL097-1 : TPTP v9.2.1. Released v1.0.0.
% 0.13/0.13 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.33 % Computer : n010.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Thu May 7 12:26:37 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 SPASS-SCL-FOL version:
% 0.19/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 9.24/2.37 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.24/2.37 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.24/2.37 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.24/2.37 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.24/2.37 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.24/2.37 Execution resolution_3 ended with status: unsatisfiable
% 9.24/2.37 Used heuristic: resolution_3
% 9.24/2.37
% 9.24/2.37 Input Clauses:
% 9.24/2.37
% 9.24/2.37 Predicates: is_a_theorem
% 9.24/2.37 Fol Constants: a b c e falsehood
% 9.24/2.37 Fol Functions: equivalent
% 9.24/2.37 Problem Properties:
% 9.24/2.37 This is a full first-order problem without equality.
% 9.24/2.37
% 9.24/2.37 After reduction: Problem Properties:
% 9.24/2.37 This is a full first-order problem without equality.
% 9.24/2.37
% 9.24/2.37
% 9.24/2.37 Reduced Input Clauses:
% 9.24/2.37
% 9.24/2.37 Most General Atoms: is_a_theorem(x1)
% 9.24/2.37
% 9.24/2.37 === Starting SPASS-SCL-FOL A Little Less Naive, considering 5 atoms initially, heuristics mode: resolution_3 ===
% 9.24/2.37
% 9.24/2.37 === Backtracking. Learning clause 5:2:4:[1.1,2.1]:TopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x1,x2)),x3)) -> is_a_theorem(x3)
% 9.24/2.37 === Backtracking. Learning clause 6:2:5:[1.1,3.1]:TopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),x3),equivalent(equivalent(x1,x2),x3)),x4)) -> is_a_theorem(x4)
% 9.24/2.37 === Clause set with instances from active satisfied. Growing active. New size: 9
% 9.24/2.37 === Restarting.
% 9.24/2.37 === Conflict found: 6:2:5:[1.1,3.1]:TopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),x3),equivalent(equivalent(x1,x2),x3)),x4)) -> is_a_theorem(x4) {x0 -> a, x1 -> a, x2 -> a, x3 -> equivalent(a,a), x4 -> equivalent(equivalent(a,a),equivalent(a,a))}
% 9.24/2.37 === Backtracking. Learning clause 7:1:2:[6.1,2.1]:TopTop: -> is_a_theorem(equivalent(equivalent(x0,x1),equivalent(x0,x1)))
% 9.24/2.37 === Conflict found: 6:2:5:[1.1,3.1]:TopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),x3),equivalent(equivalent(x1,x2),x3)),x4)) -> is_a_theorem(x4) {x0 -> equivalent(a,a), x1 -> equivalent(a,a), x2 -> a, x3 -> equivalent(equivalent(a,a),equivalent(equivalent(a,a),a)), x4 -> equivalent(equivalent(equivalent(a,a),a),equivalent(equivalent(a,a),equivalent(equivalent(a,a),a)))}
% 9.24/2.37 === Backtracking. Learning clause 8:1:4:[6.1,3.1]:TopTopTopTop: -> is_a_theorem(equivalent(equivalent(equivalent(x0,x1),x2),equivalent(equivalent(x3,x1),equivalent(equivalent(x0,x3),x2))))
% 9.24/2.37 === Clause set with instances from active satisfied. Growing active. New size: 20
% 9.24/2.37 === Restarting.
% 9.24/2.37 === Conflict found: 5:2:4:[1.1,2.1]:TopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x1,x2)),x3)) -> is_a_theorem(x3) {x0 -> a, x1 -> a, x2 -> a, x3 -> equivalent(equivalent(equivalent(a,a),equivalent(a,a)),equivalent(a,a))}
% 9.24/2.37 === Backtracking. Learning clause 9:1:3:[5.1,7.1]:TopTopTop: -> is_a_theorem(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x1,x2)))
% 9.24/2.37 === Conflict found: 5:2:4:[1.1,2.1]:TopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x1,x2)),x3)) -> is_a_theorem(x3) {x0 -> a, x1 -> a, x2 -> a, x3 -> equivalent(equivalent(a,equivalent(a,a)),equivalent(equivalent(equivalent(a,a),a),equivalent(a,a)))}
% 9.24/2.37 === Backtracking. Learning clause 10:1:4:[5.1,8.1]:TopTopTopTop: -> is_a_theorem(equivalent(equivalent(x0,equivalent(x1,x2)),equivalent(equivalent(equivalent(x1,x3),x0),equivalent(x3,x2))))
% 9.24/2.37 === Conflict found: 6:2:5:[1.1,3.1]:TopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),x3),equivalent(equivalent(x1,x2),x3)),x4)) -> is_a_theorem(x4) {x0 -> a, x1 -> a, x2 -> a, x3 -> a, x4 -> equivalent(equivalent(equivalent(equivalent(a,a),equivalent(a,a)),a),equivalent(equivalent(a,a),a))}
% 9.24/2.37 === Backtracking. Learning clause 11:1:4:[6.1,7.1]:TopTopTopTop: -> is_a_theorem(equivalent(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),x3),equivalent(equivalent(x1,x2),x3)))
% 9.24/2.37 === Conflict found: 6:2:5:[1.1,3.1]:TopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),x3),equivalent(equivalent(x1,x2),x3)),x4)) -> is_a_theorem(x4) {x0 -> a, x1 -> a, x2 -> a, x3 -> a, x4 -> equivalent(equivalent(a,a),equivalent(equivalent(equivalent(equivalent(a,a),equivalent(a,a)),a),equivalent(equivalent(a,a),a)))}
% 9.24/2.37 === Backtracking. Learning clause 12:1:5:[6.1,8.1]:TopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(x0,x1),equivalent(equivalent(equivalent(equivalent(x2,x3),equivalent(x2,x4)),x0),equivalent(equivalent(x3,x4),x1))))
% 9.24/2.37 === Clause set with instances from active satisfied. Growing active. New size: 33
% 9.24/2.37 === Restarting.
% 9.24/2.37 === Backtracking. Learning clause 13:2:4:[1.1,10.1]:TopTopTopTop: is_a_theorem(equivalent(x0,equivalent(x1,x2))) -> is_a_theorem(equivalent(equivalent(equivalent(x1,x3),x0),equivalent(x3,x2)))
% 9.24/2.37 === Conflict found: 6:2:5:[1.1,3.1]:TopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),x3),equivalent(equivalent(x1,x2),x3)),x4)) -> is_a_theorem(x4) {x0 -> a, x1 -> a, x2 -> a, x3 -> a, x4 -> equivalent(equivalent(equivalent(equivalent(a,a),equivalent(a,a)),equivalent(equivalent(equivalent(a,a),equivalent(a,a)),a)),equivalent(equivalent(a,a),equivalent(equivalent(a,a),a)))}
% 9.24/2.37 === Backtracking. Learning clause 14:1:7:[6.1,12.1]:TopTopTopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(equivalent(equivalent(x3,x4),equivalent(x3,x5)),x6)),equivalent(equivalent(x1,x2),equivalent(equivalent(x4,x5),x6))))
% 9.24/2.37 === Clause set with instances from active satisfied. Growing active. New size: 40
% 9.24/2.37 === Restarting.
% 9.24/2.37 === Conflict found: 6:2:5:[1.1,3.1]:TopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),x3),equivalent(equivalent(x1,x2),x3)),x4)) -> is_a_theorem(x4) {x0 -> a, x1 -> equivalent(a,a), x2 -> equivalent(a,a), x3 -> equivalent(equivalent(a,equivalent(a,a)),a), x4 -> equivalent(equivalent(equivalent(a,equivalent(a,a)),a),equivalent(equivalent(a,a),equivalent(equivalent(a,equivalent(a,a)),a)))}
% 9.24/2.37 === Backtracking. Learning clause 15:1:5:[6.1,14.1]:TopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(equivalent(x0,equivalent(x1,x2)),x3),equivalent(equivalent(x4,x2),equivalent(equivalent(x0,equivalent(x1,x4)),x3))))
% 9.24/2.37 === Clause set with instances from active satisfied. Growing active. New size: 46
% 9.24/2.37 === Restarting.
% 9.24/2.37 === Conflict found: 5:2:4:[1.1,2.1]:TopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x1,x2)),x3)) -> is_a_theorem(x3) {x0 -> a, x1 -> a, x2 -> a, x3 -> equivalent(equivalent(a,a),equivalent(equivalent(equivalent(a,a),equivalent(a,a)),equivalent(a,a)))}
% 9.24/2.37 === Backtracking. Learning clause 16:1:4:[5.1,15.1]:TopTopTopTop: -> is_a_theorem(equivalent(equivalent(x0,x1),equivalent(equivalent(equivalent(x2,x3),equivalent(x2,x0)),equivalent(x3,x1))))
% 9.24/2.37 === Conflict found: 6:2:5:[1.1,3.1]:TopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),x3),equivalent(equivalent(x1,x2),x3)),x4)) -> is_a_theorem(x4) {x0 -> a, x1 -> a, x2 -> a, x3 -> equivalent(a,a), x4 -> equivalent(equivalent(a,a),equivalent(equivalent(equivalent(equivalent(a,a),equivalent(a,a)),equivalent(a,a)),equivalent(equivalent(a,a),equivalent(a,a))))}
% 9.24/2.37 === Backtracking. Learning clause 17:1:6:[6.1,15.1]:TopTopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(x0,x1),equivalent(equivalent(equivalent(equivalent(x2,x3),equivalent(x2,x4)),equivalent(x5,x0)),equivalent(equivalent(x3,x4),equivalent(x5,x1)))))
% 9.24/2.37 === Clause set with instances from active satisfied. Growing active. New size: 54
% 9.24/2.37 === Restarting.
% 9.24/2.37 === Conflict found: 5:2:4:[1.1,2.1]:TopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x1,x2)),x3)) -> is_a_theorem(x3) {x0 -> a, x1 -> a, x2 -> a, x3 -> equivalent(equivalent(equivalent(a,a),equivalent(a,equivalent(equivalent(a,a),equivalent(a,a)))),equivalent(a,equivalent(a,a)))}
% 9.24/2.37 === Backtracking. Learning clause 18:1:5:[5.1,16.1]:TopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,equivalent(equivalent(x2,x3),equivalent(x2,x4)))),equivalent(x1,equivalent(x3,x4))))
% 9.24/2.37 === Conflict found: 5:2:4:[1.1,2.1]:TopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x1,x2)),x3)) -> is_a_theorem(x3) {x0 -> a, x1 -> a, x2 -> a, x3 -> equivalent(equivalent(equivalent(equivalent(a,a),equivalent(a,a)),equivalent(a,equivalent(equivalent(a,a),equivalent(a,a)))),equivalent(equivalent(a,a),equivalent(a,equivalent(a,a))))}
% 9.24/2.37 === Backtracking. Learning clause 19:1:7:[5.1,17.1]:TopTopTopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x3,equivalent(equivalent(x4,x5),equivalent(x4,x6)))),equivalent(equivalent(x1,x2),equivalent(x3,equivalent(x5,x6)))))
% 9.24/2.37 === Conflict found: 6:2:5:[1.1,3.1]:TopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),x3),equivalent(equivalent(x1,x2),x3)),x4)) -> is_a_theorem(x4) {x0 -> a, x1 -> a, x2 -> a, x3 -> a, x4 -> equivalent(equivalent(equivalent(a,a),equivalent(a,equivalent(equivalent(equivalent(a,a),equivalent(a,a)),a))),equivalent(a,equivalent(equivalent(a,a),a)))}
% 9.24/2.37 === Backtracking. Learning clause 20:1:6:[6.1,16.1]:TopTopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,equivalent(equivalent(equivalent(x2,x3),equivalent(x2,x4)),x5))),equivalent(x1,equivalent(equivalent(x3,x4),x5))))
% 9.24/2.37 === Conflict found: 6:2:5:[1.1,3.1]:TopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),x3),equivalent(equivalent(x1,x2),x3)),x4)) -> is_a_theorem(x4) {x0 -> a, x1 -> a, x2 -> a, x3 -> a, x4 -> equivalent(equivalent(equivalent(equivalent(a,a),equivalent(a,a)),equivalent(a,equivalent(equivalent(equivalent(a,a),equivalent(a,a)),a))),equivalent(equivalent(a,a),equivalent(a,equivalent(equivalent(a,a),a))))}
% 9.24/2.37 === Backtracking. Learning clause 21:1:8:[6.1,17.1]:TopTopTopTopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x3,equivalent(equivalent(equivalent(x4,x5),equivalent(x4,x6)),x7))),equivalent(equivalent(x1,x2),equivalent(x3,equivalent(equivalent(x5,x6),x7)))))
% 9.24/2.37 === Clause set with instances from active satisfied. Growing active. New size: 69
% 9.24/2.37 === Restarting.
% 9.24/2.37 === Backtracking. Learning clause 22:2:6:[1.1,20.1]:TopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(x0,x1),equivalent(x0,equivalent(equivalent(equivalent(x2,x3),equivalent(x2,x4)),x5)))) -> is_a_theorem(equivalent(x1,equivalent(equivalent(x3,x4),x5)))
% 9.24/2.37 === Backtracking. Learning clause 23:2:6:[1.1,19.1,13.2]:TopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(x0,x1),equivalent(x0,equivalent(equivalent(x2,x3),equivalent(x2,x4))))) -> is_a_theorem(equivalent(equivalent(x5,x1),equivalent(x5,equivalent(x3,x4))))
% 9.24/2.37 === Backtracking. Learning clause 24:2:7:[1.1,19.1]:TopTopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x3,equivalent(equivalent(x4,x5),equivalent(x4,x6))))) -> is_a_theorem(equivalent(equivalent(x1,x2),equivalent(x3,equivalent(x5,x6))))
% 9.24/2.37 === Backtracking. Learning clause 25:2:8:[1.1,21.1]:TopTopTopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x3,equivalent(equivalent(equivalent(x4,x5),equivalent(x4,x6)),x7)))) -> is_a_theorem(equivalent(equivalent(x1,x2),equivalent(x3,equivalent(equivalent(x5,x6),x7))))
% 9.24/2.37 === Conflict found: 5:2:4:[1.1,2.1]:TopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x1,x2)),x3)) -> is_a_theorem(x3) {x0 -> a, x1 -> a, x2 -> equivalent(equivalent(a,a),equivalent(a,a)), x3 -> equivalent(equivalent(a,equivalent(equivalent(a,a),equivalent(a,a))),equivalent(a,equivalent(a,a)))}
% 9.24/2.37 === Backtracking. Learning clause 26:1:4:[5.1,19.1]:TopTopTopTop: -> is_a_theorem(equivalent(equivalent(x0,equivalent(equivalent(x1,x2),equivalent(x1,x3))),equivalent(x0,equivalent(x2,x3))))
% 9.24/2.37 === Conflict found: 5:2:4:[1.1,2.1]:TopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x1,x2)),x3)) -> is_a_theorem(x3) {x0 -> a, x1 -> a, x2 -> equivalent(equivalent(equivalent(a,a),equivalent(a,a)),a), x3 -> equivalent(equivalent(a,equivalent(equivalent(equivalent(a,a),equivalent(a,a)),a)),equivalent(a,equivalent(equivalent(a,a),a)))}
% 9.24/2.37 === Backtracking. Learning clause 27:1:5:[5.1,21.1]:TopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(x0,equivalent(equivalent(equivalent(x1,x2),equivalent(x1,x3)),x4)),equivalent(x0,equivalent(equivalent(x2,x3),x4))))
% 9.24/2.37 === Conflict found: 6:2:5:[1.1,3.1]:TopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),x3),equivalent(equivalent(x1,x2),x3)),x4)) -> is_a_theorem(x4) {x0 -> equivalent(a,a), x1 -> equivalent(a,a), x2 -> a, x3 -> equivalent(equivalent(equivalent(a,a),equivalent(a,a)),a), x4 -> equivalent(equivalent(equivalent(equivalent(a,a),a),a),equivalent(equivalent(equivalent(a,a),a),equivalent(equivalent(a,a),a)))}
% 9.24/2.37 === Backtracking. Learning clause 28:1:5:[6.1,21.1]:TopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(equivalent(equivalent(x0,x1),x2),x3),equivalent(equivalent(equivalent(x0,x4),x2),equivalent(equivalent(x1,x4),x3))))
% 9.24/2.37 === Clause set with instances from active satisfied. Growing active. New size: 145
% 9.24/2.37 === Restarting.
% 9.24/2.37 === Conflict found: 24:2:7:[1.1,19.1]:TopTopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x3,equivalent(equivalent(x4,x5),equivalent(x4,x6))))) -> is_a_theorem(equivalent(equivalent(x1,x2),equivalent(x3,equivalent(x5,x6)))) {x0 -> a, x1 -> a, x2 -> a, x3 -> equivalent(a,a), x4 -> a, x5 -> a, x6 -> a}
% 9.24/2.37 === Backtracking. Learning clause 29:1:3:[24.1,8.1]:TopTopTop: -> is_a_theorem(equivalent(equivalent(x0,x1),equivalent(equivalent(x2,x0),equivalent(x2,x1))))
% 9.24/2.37 === Conflict found: 23:2:6:[1.1,19.1,13.2]:TopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(x0,x1),equivalent(x0,equivalent(equivalent(x2,x3),equivalent(x2,x4))))) -> is_a_theorem(equivalent(equivalent(x5,x1),equivalent(x5,equivalent(x3,x4)))) {x0 -> a, x1 -> equivalent(a,a), x2 -> a, x3 -> equivalent(equivalent(a,a),equivalent(a,a)), x4 -> a, x5 -> equivalent(a,a)}
% 9.24/2.37 === Backtracking. Learning clause 30:2:7:[23.2,22.1]:TopTopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(x0,x1),equivalent(x0,equivalent(equivalent(x2,equivalent(equivalent(x3,x4),equivalent(x3,x5))),equivalent(x2,x6))))) -> is_a_theorem(equivalent(x1,equivalent(equivalent(x4,x5),x6)))
% 9.24/2.37 === Conflict found: 22:2:6:[1.1,20.1]:TopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(x0,x1),equivalent(x0,equivalent(equivalent(equivalent(x2,x3),equivalent(x2,x4)),x5)))) -> is_a_theorem(equivalent(x1,equivalent(equivalent(x3,x4),x5))) {x0 -> equivalent(equivalent(a,a),a), x1 -> a, x2 -> a, x3 -> a, x4 -> a, x5 -> a}
% 9.24/2.37 === Backtracking. Learning clause 31:1:2:[22.1,8.1]:TopTop: -> is_a_theorem(equivalent(x0,equivalent(equivalent(x1,x1),x0)))
% 9.24/2.37 === Conflict found: 13:2:4:[1.1,10.1]:TopTopTopTop: is_a_theorem(equivalent(x0,equivalent(x1,x2))) -> is_a_theorem(equivalent(equivalent(equivalent(x1,x3),x0),equivalent(x3,x2))) {x0 -> equivalent(a,a), x1 -> a, x2 -> equivalent(equivalent(equivalent(a,a),equivalent(a,a)),a), x3 -> a}
% 9.24/2.37 === Backtracking. Learning clause 32:2:7:[13.2,25.1]:TopTopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(x0,x1),equivalent(x0,equivalent(equivalent(equivalent(x2,x3),equivalent(x2,x4)),x5)))) -> is_a_theorem(equivalent(equivalent(x6,x1),equivalent(x6,equivalent(equivalent(x3,x4),x5))))
% 9.24/2.37 === Conflict found: 32:2:7:[13.2,25.1]:TopTopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(x0,x1),equivalent(x0,equivalent(equivalent(equivalent(x2,x3),equivalent(x2,x4)),x5)))) -> is_a_theorem(equivalent(equivalent(x6,x1),equivalent(x6,equivalent(equivalent(x3,x4),x5)))) {x0 -> equivalent(equivalent(a,a),a), x1 -> a, x2 -> a, x3 -> a, x4 -> a, x5 -> a, x6 -> a}
% 9.24/2.37 === Backtracking. Learning clause 33:1:3:[32.1,8.1]:TopTopTop: -> is_a_theorem(equivalent(equivalent(x0,x1),equivalent(x0,equivalent(equivalent(x2,x2),x1))))
% 9.24/2.37 === Conflict found: 24:2:7:[1.1,19.1]:TopTopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x3,equivalent(equivalent(x4,x5),equivalent(x4,x6))))) -> is_a_theorem(equivalent(equivalent(x1,x2),equivalent(x3,equivalent(x5,x6)))) {x0 -> a, x1 -> a, x2 -> a, x3 -> equivalent(equivalent(equivalent(a,a),equivalent(a,a)),equivalent(a,a)), x4 -> a, x5 -> a, x6 -> a}
% 9.24/2.37 === Backtracking. Learning clause 34:1:5:[24.1,12.1]:TopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(x0,x1),equivalent(equivalent(equivalent(equivalent(x2,x3),equivalent(x2,x4)),equivalent(x3,x0)),equivalent(x4,x1))))
% 9.24/2.37 === Conflict found: 24:2:7:[1.1,19.1]:TopTopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x3,equivalent(equivalent(x4,x5),equivalent(x4,x6))))) -> is_a_theorem(equivalent(equivalent(x1,x2),equivalent(x3,equivalent(x5,x6)))) {x0 -> a, x1 -> a, x2 -> equivalent(a,a), x3 -> equivalent(equivalent(a,equivalent(a,a)),equivalent(a,a)), x4 -> a, x5 -> a, x6 -> a}
% 9.24/2.37 === Backtracking. Learning clause 35:1:5:[24.1,10.1]:TopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(x0,equivalent(x1,x2)),equivalent(equivalent(equivalent(x3,equivalent(x1,x4)),equivalent(x3,x0)),equivalent(x4,x2))))
% 9.24/2.37 === Conflict found: 24:2:7:[1.1,19.1]:TopTopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x3,equivalent(equivalent(x4,x5),equivalent(x4,x6))))) -> is_a_theorem(equivalent(equivalent(x1,x2),equivalent(x3,equivalent(x5,x6)))) {x0 -> a, x1 -> a, x2 -> equivalent(equivalent(a,equivalent(a,a)),equivalent(a,equivalent(a,a))), x3 -> a, x4 -> a, x5 -> a, x6 -> a}
% 9.24/2.37 === Backtracking. Learning clause 36:1:5:[24.1,18.1]:TopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(x0,equivalent(equivalent(x1,equivalent(x2,x3)),equivalent(x1,equivalent(x2,x4)))),equivalent(x0,equivalent(x3,x4))))
% 9.24/2.37 === Conflict found: 24:2:7:[1.1,19.1]:TopTopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x3,equivalent(equivalent(x4,x5),equivalent(x4,x6))))) -> is_a_theorem(equivalent(equivalent(x1,x2),equivalent(x3,equivalent(x5,x6)))) {x0 -> a, x1 -> a, x2 -> equivalent(equivalent(equivalent(a,a),equivalent(a,a)),equivalent(a,a)), x3 -> a, x4 -> a, x5 -> a, x6 -> a}
% 9.24/2.37 === Backtracking. Learning clause 37:1:5:[24.1,20.1]:TopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(x0,equivalent(equivalent(equivalent(x1,x2),equivalent(x1,x3)),equivalent(x2,x4))),equivalent(x0,equivalent(x3,x4))))
% 9.24/2.37 === Conflict found: 23:2:6:[1.1,19.1,13.2]:TopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(x0,x1),equivalent(x0,equivalent(equivalent(x2,x3),equivalent(x2,x4))))) -> is_a_theorem(equivalent(equivalent(x5,x1),equivalent(x5,equivalent(x3,x4)))) {x0 -> a, x1 -> equivalent(equivalent(a,a),a), x2 -> a, x3 -> a, x4 -> a, x5 -> equivalent(equivalent(equivalent(a,a),equivalent(a,a)),a)}
% 9.24/2.37 === Backtracking. Learning clause 38:2:8:[23.2,6.1]:TopTopTopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(x0,equivalent(equivalent(x1,x2),x3)),equivalent(x0,equivalent(equivalent(x4,x5),equivalent(x4,x6))))) -> is_a_theorem(equivalent(equivalent(equivalent(equivalent(x7,x1),equivalent(x7,x2)),x3),equivalent(x5,x6)))
% 9.24/2.37 === Conflict found: 24:2:7:[1.1,19.1]:TopTopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x3,equivalent(equivalent(x4,x5),equivalent(x4,x6))))) -> is_a_theorem(equivalent(equivalent(x1,x2),equivalent(x3,equivalent(x5,x6)))) {x0 -> a, x1 -> a, x2 -> a, x3 -> equivalent(equivalent(equivalent(a,a),equivalent(a,a)),equivalent(a,equivalent(a,a))), x4 -> a, x5 -> a, x6 -> equivalent(a,a)}
% 9.24/2.37 === Backtracking. Learning clause 39:1:6:[24.1,17.1]:TopTopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(x0,x1),equivalent(equivalent(equivalent(equivalent(x2,x3),equivalent(x2,x4)),equivalent(x3,equivalent(x5,x0))),equivalent(x4,equivalent(x5,x1)))))
% 9.24/2.37 === Conflict found: 25:2:8:[1.1,21.1]:TopTopTopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x3,equivalent(equivalent(equivalent(x4,x5),equivalent(x4,x6)),x7)))) -> is_a_theorem(equivalent(equivalent(x1,x2),equivalent(x3,equivalent(equivalent(x5,x6),x7)))) {x0 -> a, x1 -> a, x2 -> a, x3 -> equivalent(equivalent(a,equivalent(equivalent(a,a),equivalent(a,a))),equivalent(a,a)), x4 -> a, x5 -> a, x6 -> a, x7 -> a}
% 9.24/2.37 === Backtracking. Learning clause 40:1:6:[25.1,10.1]:TopTopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(x0,x1),equivalent(equivalent(equivalent(x2,equivalent(equivalent(x3,x4),equivalent(x3,x5))),equivalent(x2,x0)),equivalent(equivalent(x4,x5),x1))))
% 9.24/2.37 === Conflict found: 25:2:8:[1.1,21.1]:TopTopTopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x3,equivalent(equivalent(equivalent(x4,x5),equivalent(x4,x6)),x7)))) -> is_a_theorem(equivalent(equivalent(x1,x2),equivalent(x3,equivalent(equivalent(x5,x6),x7)))) {x0 -> equivalent(a,a), x1 -> a, x2 -> a, x3 -> equivalent(equivalent(a,a),a), x4 -> a, x5 -> a, x6 -> a, x7 -> equivalent(equivalent(a,a),a)}
% 9.24/2.37 === Backtracking. Learning clause 41:1:5:[25.1,8.1]:TopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(x0,x1),equivalent(equivalent(equivalent(x2,x3),x0),equivalent(equivalent(x4,x3),equivalent(equivalent(x2,x4),x1)))))
% 9.24/2.37 === Conflict found: 25:2:8:[1.1,21.1]:TopTopTopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x3,equivalent(equivalent(equivalent(x4,x5),equivalent(x4,x6)),x7)))) -> is_a_theorem(equivalent(equivalent(x1,x2),equivalent(x3,equivalent(equivalent(x5,x6),x7)))) {x0 -> equivalent(a,a), x1 -> equivalent(a,a), x2 -> a, x3 -> equivalent(a,a), x4 -> a, x5 -> a, x6 -> a, x7 -> equivalent(equivalent(a,a),a)}
% 9.24/2.37 === Backtracking. Learning clause 42:1:5:[25.1,15.1]:TopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(equivalent(x0,x1),x2),equivalent(equivalent(x3,x1),equivalent(equivalent(x4,x3),equivalent(equivalent(x0,x4),x2)))))
% 9.24/2.37 === Conflict found: 25:2:8:[1.1,21.1]:TopTopTopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x3,equivalent(equivalent(equivalent(x4,x5),equivalent(x4,x6)),x7)))) -> is_a_theorem(equivalent(equivalent(x1,x2),equivalent(x3,equivalent(equivalent(x5,x6),x7)))) {x0 -> a, x1 -> a, x2 -> equivalent(equivalent(a,equivalent(equivalent(a,a),equivalent(a,a))),equivalent(a,a)), x3 -> a, x4 -> a, x5 -> a, x6 -> a, x7 -> a}
% 9.24/2.37 === Backtracking. Learning clause 43:1:6:[25.1,18.1]:TopTopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(x0,equivalent(equivalent(x1,equivalent(equivalent(x2,x3),equivalent(x2,x4))),equivalent(x1,x5))),equivalent(x0,equivalent(equivalent(x3,x4),x5))))
% 9.24/2.37 === Conflict found: 25:2:8:[1.1,21.1]:TopTopTopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x3,equivalent(equivalent(equivalent(x4,x5),equivalent(x4,x6)),x7)))) -> is_a_theorem(equivalent(equivalent(x1,x2),equivalent(x3,equivalent(equivalent(x5,x6),x7)))) {x0 -> a, x1 -> a, x2 -> equivalent(equivalent(equivalent(a,equivalent(a,a)),equivalent(a,equivalent(a,a))),a), x3 -> a, x4 -> a, x5 -> a, x6 -> a, x7 -> a}
% 9.24/2.37 === Backtracking. Learning clause 44:1:6:[25.1,20.1]:TopTopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(x0,equivalent(equivalent(equivalent(x1,equivalent(x2,x3)),equivalent(x1,equivalent(x2,x4))),x5)),equivalent(x0,equivalent(equivalent(x3,x4),x5))))
% 9.24/2.37 === Conflict found: 25:2:8:[1.1,21.1]:TopTopTopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x3,equivalent(equivalent(equivalent(x4,x5),equivalent(x4,x6)),x7)))) -> is_a_theorem(equivalent(equivalent(x1,x2),equivalent(x3,equivalent(equivalent(x5,x6),x7)))) {x0 -> a, x1 -> a, x2 -> a, x3 -> equivalent(equivalent(a,equivalent(equivalent(a,a),equivalent(a,a))),equivalent(a,equivalent(a,a))), x4 -> a, x5 -> a, x6 -> a, x7 -> equivalent(a,a)}
% 9.24/2.37 === Backtracking. Learning clause 45:1:7:[25.1,16.1]:TopTopTopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(x0,x1),equivalent(equivalent(equivalent(x2,equivalent(equivalent(x3,x4),equivalent(x3,x5))),equivalent(x2,equivalent(x6,x0))),equivalent(equivalent(x4,x5),equivalent(x6,x1)))))
% 9.24/2.37 === Conflict found: 25:2:8:[1.1,21.1]:TopTopTopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x3,equivalent(equivalent(equivalent(x4,x5),equivalent(x4,x6)),x7)))) -> is_a_theorem(equivalent(equivalent(x1,x2),equivalent(x3,equivalent(equivalent(x5,x6),x7)))) {x0 -> a, x1 -> a, x2 -> a, x3 -> equivalent(equivalent(equivalent(a,equivalent(a,a)),equivalent(a,equivalent(a,a))),equivalent(a,a)), x4 -> a, x5 -> a, x6 -> a, x7 -> equivalent(a,a)}
% 9.24/2.37 === Backtracking. Learning clause 46:1:7:[25.1,12.1]:TopTopTopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(x0,x1),equivalent(equivalent(equivalent(equivalent(x2,equivalent(x3,x4)),equivalent(x2,equivalent(x3,x5))),equivalent(x6,x0)),equivalent(equivalent(x4,x5),equivalent(x6,x1)))))
% 9.24/2.37 === Conflict found: 25:2:8:[1.1,21.1]:TopTopTopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x3,equivalent(equivalent(equivalent(x4,x5),equivalent(x4,x6)),x7)))) -> is_a_theorem(equivalent(equivalent(x1,x2),equivalent(x3,equivalent(equivalent(x5,x6),x7)))) {x0 -> a, x1 -> a, x2 -> a, x3 -> equivalent(equivalent(equivalent(a,equivalent(a,a)),equivalent(a,equivalent(a,a))),equivalent(a,equivalent(a,a))), x4 -> a, x5 -> a, x6 -> a, x7 -> equivalent(a,equivalent(a,a))}
% 9.24/2.37 === Backtracking. Learning clause 47:1:8:[25.1,17.1]:TopTopTopTopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(x0,x1),equivalent(equivalent(equivalent(equivalent(x2,equivalent(x3,x4)),equivalent(x2,equivalent(x3,x5))),equivalent(x6,equivalent(x7,x0))),equivalent(equivalent(x4,x5),equivalent(x6,equivalent(x7,x1))))))
% 9.24/2.37 === Conflict found: 24:2:7:[1.1,19.1]:TopTopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x3,equivalent(equivalent(x4,x5),equivalent(x4,x6))))) -> is_a_theorem(equivalent(equivalent(x1,x2),equivalent(x3,equivalent(x5,x6)))) {x0 -> equivalent(equivalent(a,a),a), x1 -> equivalent(equivalent(a,a),a), x2 -> equivalent(equivalent(equivalent(a,a),equivalent(a,a)),a), x3 -> equivalent(a,a), x4 -> equivalent(a,a), x5 -> a, x6 -> a}
% 9.24/2.37 === Backtracking. Learning clause 48:1:6:[24.1,21.1]:TopTopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(equivalent(equivalent(x0,x1),x2),equivalent(equivalent(equivalent(x3,x0),equivalent(x3,x1)),x4)),equivalent(equivalent(x5,x2),equivalent(x5,x4))))
% 9.24/2.37 === Conflict found: 24:2:7:[1.1,19.1]:TopTopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x3,equivalent(equivalent(x4,x5),equivalent(x4,x6))))) -> is_a_theorem(equivalent(equivalent(x1,x2),equivalent(x3,equivalent(x5,x6)))) {x0 -> equivalent(equivalent(a,a),equivalent(a,a)), x1 -> equivalent(a,a), x2 -> equivalent(equivalent(a,a),equivalent(a,a)), x3 -> equivalent(equivalent(a,a),equivalent(a,a)), x4 -> a, x5 -> a, x6 -> a}
% 9.24/2.37 === Backtracking. Learning clause 49:1:6:[24.1,2.1]:TopTopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(equivalent(x0,x1),equivalent(equivalent(x2,x3),equivalent(x2,x4))),equivalent(equivalent(equivalent(x5,x0),equivalent(x5,x1)),equivalent(x3,x4))))
% 9.24/2.37 === Conflict found: 25:2:8:[1.1,21.1]:TopTopTopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x3,equivalent(equivalent(equivalent(x4,x5),equivalent(x4,x6)),x7)))) -> is_a_theorem(equivalent(equivalent(x1,x2),equivalent(x3,equivalent(equivalent(x5,x6),x7)))) {x0 -> equivalent(equivalent(a,a),equivalent(a,a)), x1 -> equivalent(a,a), x2 -> equivalent(equivalent(equivalent(a,a),equivalent(a,a)),a), x3 -> equivalent(equivalent(a,a),equivalent(a,a)), x4 -> a, x5 -> a, x6 -> a, x7 -> a}
% 9.24/2.37 === Backtracking. Learning clause 50:1:7:[25.1,2.1]:TopTopTopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(equivalent(x0,x1),equivalent(equivalent(equivalent(x2,x3),equivalent(x2,x4)),x5)),equivalent(equivalent(equivalent(x6,x0),equivalent(x6,x1)),equivalent(equivalent(x3,x4),x5))))
% 9.24/2.37 === Conflict found: 23:2:6:[1.1,19.1,13.2]:TopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(x0,x1),equivalent(x0,equivalent(equivalent(x2,x3),equivalent(x2,x4))))) -> is_a_theorem(equivalent(equivalent(x5,x1),equivalent(x5,equivalent(x3,x4)))) {x0 -> equivalent(equivalent(equivalent(a,a),equivalent(a,a)),equivalent(a,a)), x1 -> equivalent(equivalent(equivalent(equivalent(a,a),equivalent(a,a)),equivalent(a,a)),equivalent(equivalent(a,a),equivalent(a,a))), x2 -> a, x3 -> a, x4 -> a, x5 -> a}
% 9.24/2.37 === Backtracking. Learning clause 51:1:7:[23.1,2.1]:TopTopTopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(x0,equivalent(equivalent(equivalent(equivalent(x1,x2),equivalent(x1,x3)),equivalent(x2,x3)),equivalent(equivalent(x4,x5),equivalent(x4,x6)))),equivalent(x0,equivalent(x5,x6))))
% 9.24/2.37 === Conflict found: 25:2:8:[1.1,21.1]:TopTopTopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x3,equivalent(equivalent(equivalent(x4,x5),equivalent(x4,x6)),x7)))) -> is_a_theorem(equivalent(equivalent(x1,x2),equivalent(x3,equivalent(equivalent(x5,x6),x7)))) {x0 -> equivalent(equivalent(a,a),equivalent(a,a)), x1 -> equivalent(equivalent(a,a),a), x2 -> equivalent(equivalent(equivalent(a,a),equivalent(a,a)),a), x3 -> equivalent(equivalent(a,a),a), x4 -> a, x5 -> a, x6 -> a, x7 -> equivalent(equivalent(a,a),a)}
% 9.24/2.37 === Backtracking. Learning clause 52:1:8:[25.1,21.1]:TopTopTopTopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(equivalent(equivalent(x0,x1),x2),equivalent(equivalent(equivalent(x3,x4),equivalent(x3,x5)),x6)),equivalent(equivalent(equivalent(x0,x7),x2),equivalent(equivalent(x1,x7),equivalent(equivalent(x4,x5),x6)))))
% 9.24/2.37 === Conflict found: 24:2:7:[1.1,19.1]:TopTopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x3,equivalent(equivalent(x4,x5),equivalent(x4,x6))))) -> is_a_theorem(equivalent(equivalent(x1,x2),equivalent(x3,equivalent(x5,x6)))) {x0 -> equivalent(equivalent(equivalent(a,a),equivalent(a,a)),a), x1 -> equivalent(equivalent(a,a),a), x2 -> equivalent(equivalent(a,a),equivalent(a,a)), x3 -> equivalent(equivalent(equivalent(a,a),equivalent(a,a)),a), x4 -> a, x5 -> a, x6 -> a}
% 9.24/2.37 === Backtracking. Learning clause 53:1:7:[24.1,3.1]:TopTopTopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(equivalent(equivalent(x0,x1),x2),equivalent(equivalent(x3,x4),equivalent(x3,x5))),equivalent(equivalent(equivalent(equivalent(x6,x0),equivalent(x6,x1)),x2),equivalent(x4,x5))))
% 9.24/2.37 === Conflict found: 25:2:8:[1.1,21.1]:TopTopTopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),equivalent(x3,equivalent(equivalent(equivalent(x4,x5),equivalent(x4,x6)),x7)))) -> is_a_theorem(equivalent(equivalent(x1,x2),equivalent(x3,equivalent(equivalent(x5,x6),x7)))) {x0 -> equivalent(equivalent(equivalent(a,a),equivalent(a,a)),a), x1 -> equivalent(equivalent(a,a),a), x2 -> equivalent(equivalent(equivalent(a,a),equivalent(a,a)),a), x3 -> equivalent(equivalent(equivalent(a,a),equivalent(a,a)),a), x4 -> a, x5 -> a, x6 -> a, x7 -> a}
% 9.24/2.37 === Backtracking. Learning clause 54:1:8:[25.1,3.1]:TopTopTopTopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(equivalent(equivalent(x0,x1),x2),equivalent(equivalent(equivalent(x3,x4),equivalent(x3,x5)),x6)),equivalent(equivalent(equivalent(equivalent(x7,x0),equivalent(x7,x1)),x2),equivalent(equivalent(x4,x5),x6))))
% 9.24/2.37 === Conflict found: 23:2:6:[1.1,19.1,13.2]:TopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(x0,x1),equivalent(x0,equivalent(equivalent(x2,x3),equivalent(x2,x4))))) -> is_a_theorem(equivalent(equivalent(x5,x1),equivalent(x5,equivalent(x3,x4)))) {x0 -> equivalent(equivalent(equivalent(equivalent(a,a),equivalent(a,a)),a),equivalent(equivalent(a,a),a)), x1 -> equivalent(equivalent(equivalent(equivalent(equivalent(a,a),equivalent(a,a)),a),equivalent(equivalent(a,a),a)),equivalent(equivalent(a,a),equivalent(a,a))), x2 -> a, x3 -> a, x4 -> a, x5 -> a}
% 9.24/2.37 === Backtracking. Learning clause 55:1:8:[23.1,3.1]:TopTopTopTopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(x0,equivalent(equivalent(equivalent(equivalent(equivalent(x1,x2),equivalent(x1,x3)),x4),equivalent(equivalent(x2,x3),x4)),equivalent(equivalent(x5,x6),equivalent(x5,x7)))),equivalent(x0,equivalent(x6,x7))))
% 9.24/2.37 === Conflict found: 22:2:6:[1.1,20.1]:TopTopTopTopTopTop: is_a_theorem(equivalent(equivalent(x0,x1),equivalent(x0,equivalent(equivalent(equivalent(x2,x3),equivalent(x2,x4)),x5)))) -> is_a_theorem(equivalent(x1,equivalent(equivalent(x3,x4),x5))) {x0 -> equivalent(equivalent(equivalent(equivalent(a,a),equivalent(a,a)),a),equivalent(equivalent(a,a),a)), x1 -> equivalent(equivalent(equivalent(equivalent(equivalent(a,a),equivalent(a,a)),a),equivalent(equivalent(a,a),a)),equivalent(equivalent(equivalent(a,a),equivalent(a,a)),a)), x2 -> a, x3 -> a, x4 -> a, x5 -> a}
% 9.24/2.37 === Backtracking. Learning clause 56:1:8:[22.1,3.1]:TopTopTopTopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(x0,x1),equivalent(x0,x2)),x3),equivalent(equivalent(x1,x2),x3)),equivalent(equivalent(equivalent(x4,x5),equivalent(x4,x6)),x7)),equivalent(equivalent(x5,x6),x7)))
% 9.24/2.37 === Clause set with instances from active satisfied. Growing active. New size: 214
% 9.24/2.37 === Restarting.
% 9.24/2.37 === Backtracking. Learning clause 57:2:2:[1.1,31.1]:TopTop: is_a_theorem(x0) -> is_a_theorem(equivalent(equivalent(x1,x1),x0))
% 9.24/2.37 === Backtracking. Learning clause 58:2:5:[1.1,34.1]:TopTopTopTopTop: is_a_theorem(equivalent(x0,x1)) -> is_a_theorem(equivalent(equivalent(equivalent(equivalent(x2,x3),equivalent(x2,x4)),equivalent(x3,x0)),equivalent(x4,x1)))
% 9.24/2.37 === Conflict found: 28:1:5:[6.1,21.1]:TopTopTopTopTop: -> is_a_theorem(equivalent(equivalent(equivalent(equivalent(x0,x1),x2),x3),equivalent(equivalent(equivalent(x0,x4),x2),equivalent(equivalent(x1,x4),x3)))) {x0 -> a, x1 -> b, x2 -> c, x3 -> e, x4 -> falsehood}
% 9.24/2.37
% 9.24/2.37 SZS status Unsatisfiable
% 9.24/2.37
% 9.24/2.37 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.24/2.37
% 9.24/2.37 SPASS-SCL-FOL Statistics:
% 9.24/2.37 Number of learned clauses: 54
% 9.24/2.37 Number of propagations: 3586
% 9.24/2.37 Number of decisions: 629
% 9.24/2.37 Number of resolutions: 56
% 9.24/2.37 Number of condensations: 0
% 9.24/2.37 Number of sub resolutions: 0
% 9.24/2.37 Number of input literals (deduplicated): 5
% 9.24/2.37 Number of grows: 9
% 9.24/2.37 Number of considered ground atoms: 214
% 9.24/2.37
% 9.24/2.37 Needed: 0:00:01.84
% 9.24/2.37
%------------------------------------------------------------------------------