%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : LCL035-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 : n014.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:18 PM UTC 2026
% Result : Unsatisfiable 0.29s 0.57s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL035-1 : TPTP v9.2.1. Released v1.0.0.
% 0.11/0.13 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.34 % Computer : n014.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:25:52 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]
% 0.29/0.57 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.29/0.57 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.29/0.57 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.29/0.57 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.29/0.57 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.29/0.57 Execution resolution_3 ended with status: unsatisfiable
% 0.29/0.57 Used heuristic: resolution_3
% 0.29/0.57
% 0.29/0.57 Input Clauses:
% 0.29/0.57
% 0.29/0.57 Predicates: is_a_theorem
% 0.29/0.57 Fol Constants: falsehood a
% 0.29/0.57 Fol Functions: implies
% 0.29/0.57 Problem Properties:
% 0.29/0.57 This is a full first-order problem without equality.
% 0.29/0.57
% 0.29/0.57 After reduction: Problem Properties:
% 0.29/0.57 This is a full first-order problem without equality.
% 0.29/0.57
% 0.29/0.57
% 0.29/0.57 Reduced Input Clauses:
% 0.29/0.57
% 0.29/0.57 Most General Atoms: is_a_theorem(x1)
% 0.29/0.57
% 0.29/0.57 === Starting SPASS-SCL-FOL A Little Less Naive, considering 3 atoms initially, heuristics mode: resolution_3 ===
% 0.29/0.57
% 0.29/0.57 === Backtracking. Learning clause 4:2:5:[1.1,2.1]:TopTopTopTopTop: is_a_theorem(implies(implies(implies(implies(x0,x1),implies(x2,falsehood)),x3),x4)) -> is_a_theorem(implies(implies(x4,x0),implies(x2,x0)))
% 0.29/0.57 === Clause set with instances from active satisfied. Growing active. New size: 5
% 0.29/0.57 === Restarting.
% 0.29/0.57 === Conflict found: 4:2:5:[1.1,2.1]:TopTopTopTopTop: is_a_theorem(implies(implies(implies(implies(x0,x1),implies(x2,falsehood)),x3),x4)) -> is_a_theorem(implies(implies(x4,x0),implies(x2,x0))) {x0 -> implies(falsehood,falsehood), x1 -> implies(falsehood,falsehood), x2 -> falsehood, x3 -> falsehood, x4 -> implies(implies(falsehood,falsehood),implies(falsehood,falsehood))}
% 0.29/0.57 === Backtracking. Learning clause 5:1:5:[4.1,2.1]:TopTopTopTopTop: -> is_a_theorem(implies(implies(implies(implies(x0,x1),implies(x2,x1)),implies(x1,x3)),implies(x4,implies(x1,x3))))
% 0.29/0.57 === Clause set with instances from active satisfied. Growing active. New size: 8
% 0.29/0.57 === Restarting.
% 0.29/0.57 === Backtracking. Learning clause 6:2:5:[1.1,5.1]:TopTopTopTopTop: is_a_theorem(implies(implies(implies(x0,x1),implies(x2,x1)),implies(x1,x3))) -> is_a_theorem(implies(x4,implies(x1,x3)))
% 0.29/0.57 === Conflict found: 4:2:5:[1.1,2.1]:TopTopTopTopTop: is_a_theorem(implies(implies(implies(implies(x0,x1),implies(x2,falsehood)),x3),x4)) -> is_a_theorem(implies(implies(x4,x0),implies(x2,x0))) {x0 -> falsehood, x1 -> falsehood, x2 -> falsehood, x3 -> implies(falsehood,falsehood), x4 -> implies(falsehood,implies(falsehood,falsehood))}
% 0.29/0.57 === Backtracking. Learning clause 7:1:4:[4.1,5.1]:TopTopTopTop: -> is_a_theorem(implies(implies(implies(x0,implies(falsehood,x1)),x2),implies(x3,x2)))
% 0.29/0.57 === Clause set with instances from active satisfied. Growing active. New size: 15
% 0.29/0.57 === Restarting.
% 0.29/0.57 === Backtracking. Learning clause 8:2:4:[1.1,7.1]:TopTopTopTop: is_a_theorem(implies(implies(x0,implies(falsehood,x1)),x2)) -> is_a_theorem(implies(x3,x2))
% 0.29/0.57 === Conflict found: 4:2:5:[1.1,2.1]:TopTopTopTopTop: is_a_theorem(implies(implies(implies(implies(x0,x1),implies(x2,falsehood)),x3),x4)) -> is_a_theorem(implies(implies(x4,x0),implies(x2,x0))) {x0 -> falsehood, x1 -> falsehood, x2 -> falsehood, x3 -> falsehood, x4 -> implies(falsehood,falsehood)}
% 0.29/0.57 === Backtracking. Learning clause 9:1:3:[4.1,7.1]:TopTopTop: -> is_a_theorem(implies(implies(implies(x0,x1),x2),implies(falsehood,x2)))
% 0.29/0.57 === Conflict found: 8:2:4:[1.1,7.1]:TopTopTopTop: is_a_theorem(implies(implies(x0,implies(falsehood,x1)),x2)) -> is_a_theorem(implies(x3,x2)) {x0 -> implies(falsehood,implies(falsehood,falsehood)), x1 -> implies(falsehood,falsehood), x2 -> implies(implies(falsehood,falsehood),implies(falsehood,implies(falsehood,falsehood))), x3 -> falsehood}
% 0.29/0.57 === Backtracking. Learning clause 10:1:3:[8.1,7.1]:TopTopTop: -> is_a_theorem(implies(x0,implies(x1,implies(falsehood,x2))))
% 0.29/0.57 === Clause set with instances from active satisfied. Growing active. New size: 25
% 0.29/0.57 === Restarting.
% 0.29/0.57 === Backtracking. Learning clause 11:2:2:[1.1,10.1,1.1]:TopTop: is_a_theorem(x0) -> is_a_theorem(implies(falsehood,x1))
% 0.29/0.57 === Conflict found: 8:2:4:[1.1,7.1]:TopTopTopTop: is_a_theorem(implies(implies(x0,implies(falsehood,x1)),x2)) -> is_a_theorem(implies(x3,x2)) {x0 -> falsehood, x1 -> falsehood, x2 -> falsehood, x3 -> implies(implies(implies(falsehood,falsehood),implies(falsehood,falsehood)),falsehood)}
% 0.29/0.57 === Backtracking. Learning clause 12:2:5:[8.2,4.1]:TopTopTopTopTop: is_a_theorem(implies(implies(x0,implies(falsehood,x1)),x2)) -> is_a_theorem(implies(implies(x2,x3),implies(x4,x3)))
% 0.29/0.57 === Clause set with instances from active satisfied. Growing active. New size: 28
% 0.29/0.57 === Restarting.
% 0.29/0.57 === Conflict found: 11:2:2:[1.1,10.1,1.1]:TopTop: is_a_theorem(x0) -> is_a_theorem(implies(falsehood,x1)) {x0 -> implies(falsehood,falsehood), x1 -> a}
% 0.29/0.57 === Backtracking. Learning clause 13:1:1:[11.2,3.1,11.2]:Top: is_a_theorem(x0) ->
% 0.29/0.57 === Conflict found: 11:2:2:[1.1,10.1,1.1]:TopTop: is_a_theorem(x0) -> is_a_theorem(implies(falsehood,x1)) {x0 -> implies(falsehood,implies(falsehood,implies(falsehood,falsehood))), x1 -> implies(falsehood,falsehood)}
% 0.29/0.57
% 0.29/0.57 SZS status Unsatisfiable
% 0.29/0.57
% 0.29/0.57 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.29/0.57
% 0.29/0.57 SPASS-SCL-FOL Statistics:
% 0.29/0.57 Number of learned clauses: 10
% 0.29/0.57 Number of propagations: 89
% 0.29/0.57 Number of decisions: 37
% 0.29/0.57 Number of resolutions: 14
% 0.29/0.57 Number of condensations: 1
% 0.29/0.57 Number of sub resolutions: 0
% 0.29/0.57 Number of input literals (deduplicated): 4
% 0.29/0.57 Number of grows: 5
% 0.29/0.57 Number of considered ground atoms: 28
% 0.29/0.57
% 0.29/0.57 Needed: 0:00:00.02
% 0.29/0.57
%------------------------------------------------------------------------------