%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : LCL362-1 : TPTP v9.2.1. Released v2.3.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n017.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:43 PM UTC 2026
% Result : Unsatisfiable 2.19s 1.03s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL362-1 : TPTP v9.2.1. Released v2.3.0.
% 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.34 % Computer : n017.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Thu May 7 12:29:58 EDT 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.34 SPASS-SCL-FOL version:
% 0.19/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 2.19/1.03 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.19/1.03 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.19/1.03 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.19/1.03 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.19/1.03 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.19/1.03 Execution resolution_2 ended with status: unsatisfiable
% 2.19/1.03 Used heuristic: resolution_2
% 2.19/1.03
% 2.19/1.03 Input Clauses:
% 2.19/1.03
% 2.19/1.03 Predicates: is_a_theorem
% 2.19/1.03 Fol Constants: x y
% 2.19/1.03 Fol Functions: implies not
% 2.19/1.03 Problem Properties:
% 2.19/1.03 This is a full first-order problem without equality.
% 2.19/1.03
% 2.19/1.03 After reduction: Problem Properties:
% 2.19/1.03 This is a full first-order problem without equality.
% 2.19/1.03
% 2.19/1.03
% 2.19/1.03 Reduced Input Clauses:
% 2.19/1.03
% 2.19/1.03 Most General Atoms: is_a_theorem(x1)
% 2.19/1.03
% 2.19/1.03 === Starting SPASS-SCL-FOL A Little Less Naive, considering 46 atoms initially, heuristics mode: resolution_2 ===
% 2.19/1.03
% 2.19/1.03 === Clause set with instances from active satisfied. Growing active. New size: 47
% 2.19/1.03 === Restarting.
% 2.19/1.03 === Backtracking. Learning clause 6:2:3:[1.1,2.1]:TopTopTop: is_a_theorem(implies(x0,x1)) -> is_a_theorem(implies(implies(x1,x2),implies(x0,x2)))
% 2.19/1.03 === Clause set with instances from active satisfied. Growing active. New size: 49
% 2.19/1.03 === Restarting.
% 2.19/1.03 === Backtracking. Learning clause 7:2:2:[1.2,3.1]:TopTop: is_a_theorem(implies(implies(implies(not(x0),x0),x0),x1)) -> is_a_theorem(x1)
% 2.19/1.03 === Conflict found: 6:2:3:[1.1,2.1]:TopTopTop: is_a_theorem(implies(x0,x1)) -> is_a_theorem(implies(implies(x1,x2),implies(x0,x2))) {x0 -> implies(not(x),x), x1 -> x, x2 -> x}
% 2.19/1.03 === Backtracking. Learning clause 8:1:2:[6.1,3.1]:TopTop: -> is_a_theorem(implies(implies(x0,x1),implies(implies(not(x0),x0),x1)))
% 2.19/1.03 === Clause set with instances from active satisfied. Growing active. New size: 53
% 2.19/1.03 === Restarting.
% 2.19/1.03 === Conflict found: 7:2:2:[1.2,3.1]:TopTop: is_a_theorem(implies(implies(implies(not(x0),x0),x0),x1)) -> is_a_theorem(x1) {x0 -> x, x1 -> implies(not(implies(implies(not(x),x),x)),x)}
% 2.19/1.03 === Backtracking. Learning clause 9:1:2:[7.1,4.1]:TopTop: -> is_a_theorem(implies(not(implies(implies(not(x0),x0),x0)),x1))
% 2.19/1.03 === Clause set with instances from active satisfied. Growing active. New size: 55
% 2.19/1.03 === Restarting.
% 2.19/1.03 === Backtracking. Learning clause 10:2:1:[1.3,5.1]:Top: is_a_theorem(implies(x0,implies(implies(x,implies(implies(not(y),y),y)),implies(implies(not(y),y),y)))),is_a_theorem(x0) ->
% 2.19/1.03 === Conflict found: 10:2:1:[1.3,5.1]:Top: is_a_theorem(implies(x0,implies(implies(x,implies(implies(not(y),y),y)),implies(implies(not(y),y),y)))),is_a_theorem(x0) -> {x0 -> implies(implies(not(x),x),x)}
% 2.19/1.03 === Backtracking. Learning clause 11:1:1:[10.2,3.1]:Top: is_a_theorem(implies(implies(implies(not(x0),x0),x0),implies(implies(x,implies(implies(not(y),y),y)),implies(implies(not(y),y),y)))) ->
% 2.19/1.03 === Clause set with instances from active satisfied. Growing active. New size: 119
% 2.19/1.03 === Clause set with instances from active satisfied. Growing active. New size: 124
% 2.19/1.03 === Restarting.
% 2.19/1.03 === Conflict found: 7:2:2:[1.2,3.1]:TopTop: is_a_theorem(implies(implies(implies(not(x0),x0),x0),x1)) -> is_a_theorem(x1) {x0 -> x, x1 -> implies(implies(not(implies(not(x),x)),implies(not(x),x)),x)}
% 2.19/1.03 === Backtracking. Learning clause 12:1:1:[7.1,8.1]:Top: -> is_a_theorem(implies(implies(not(implies(not(x0),x0)),implies(not(x0),x0)),x0))
% 2.19/1.03 === Clause set with instances from active satisfied. Growing active. New size: 128
% 2.19/1.03 === Restarting.
% 2.19/1.03 === Backtracking. Learning clause 13:2:3:[1.2,9.1]:TopTopTop: is_a_theorem(implies(implies(not(implies(implies(not(x0),x0),x0)),x1),x2)) -> is_a_theorem(x2)
% 2.19/1.03 === Conflict found: 6:2:3:[1.1,2.1]:TopTopTop: is_a_theorem(implies(x0,x1)) -> is_a_theorem(implies(implies(x1,x2),implies(x0,x2))) {x0 -> not(implies(implies(not(x),x),x)), x1 -> implies(implies(x,implies(implies(not(y),y),y)),implies(implies(not(y),y),y)), x2 -> x}
% 2.19/1.03 === Backtracking. Learning clause 14:1:3:[6.1,9.1]:TopTopTop: -> is_a_theorem(implies(implies(x0,x1),implies(not(implies(implies(not(x2),x2),x2)),x1)))
% 2.19/1.03 === Clause set with instances from active satisfied. Growing active. New size: 133
% 2.19/1.03 === Restarting.
% 2.19/1.03 === Conflict found: 6:2:3:[1.1,2.1]:TopTopTop: is_a_theorem(implies(x0,x1)) -> is_a_theorem(implies(implies(x1,x2),implies(x0,x2))) {x0 -> implies(x,implies(implies(not(y),y),y)), x1 -> implies(not(implies(implies(not(y),y),y)),implies(implies(not(y),y),y)), x2 -> implies(implies(not(y),y),y)}
% 2.19/1.03
% 2.19/1.03 SZS status Unsatisfiable
% 2.19/1.03
% 2.19/1.03 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.19/1.03
% 2.19/1.03 SPASS-SCL-FOL Statistics:
% 2.19/1.03 Number of learned clauses: 9
% 2.19/1.03 Number of propagations: 430
% 2.19/1.03 Number of decisions: 173
% 2.19/1.03 Number of resolutions: 11
% 2.19/1.03 Number of condensations: 0
% 2.19/1.03 Number of sub resolutions: 0
% 2.19/1.03 Number of input literals (deduplicated): 6
% 2.19/1.03 Number of grows: 8
% 2.19/1.03 Number of considered ground atoms: 133
% 2.19/1.03
% 2.19/1.03 Needed: 0:00:00.47
% 2.19/1.03
%------------------------------------------------------------------------------