%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : LCL236-1 : TPTP v9.2.1. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/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:35 PM UTC 2026
% Result : Unsatisfiable 27.39s 7.32s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL236-1 : TPTP v9.2.1. Bugfixed v2.3.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.34 % Computer : n014.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % 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:30:22 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 SPASS-SCL-FOL version:
% 0.20/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 27.39/7.32 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 27.39/7.32 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 27.39/7.32 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 27.39/7.32 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 27.39/7.32 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 27.39/7.32 Execution resolution_1 ended with status: unsatisfiable
% 27.39/7.32 Used heuristic: resolution_1
% 27.39/7.32
% 27.39/7.32 Input Clauses:
% 27.39/7.32
% 27.39/7.32 Predicates: axiom theorem
% 27.39/7.32 Fol Constants: p q
% 27.39/7.32 Fol Functions: or not
% 27.39/7.32 Problem Properties:
% 27.39/7.32 This is a full first-order problem without equality.
% 27.39/7.32
% 27.39/7.32 After reduction: Problem Properties:
% 27.39/7.32 This is a full first-order problem without equality.
% 27.39/7.32
% 27.39/7.32
% 27.39/7.32 Reduced Input Clauses:
% 27.39/7.32
% 27.39/7.32 Most General Atoms: axiom(x0) theorem(x1)
% 27.39/7.32
% 27.39/7.32 === Starting SPASS-SCL-FOL A Little Less Naive, considering 19 atoms initially, heuristics mode: resolution_1 ===
% 27.39/7.32
% 27.39/7.32 === Backtracking. Learning clause 10:2:1:[7.1,1.1]:Top: theorem(or(x0,x0)) -> theorem(x0)
% 27.39/7.32 === Backtracking. Learning clause 11:2:4:[8.1,5.1]:TopTopTopTop: theorem(or(not(or(not(or(x0,x1)),or(x0,x2))),x3)) -> theorem(or(not(or(not(x1),x2)),x3))
% 27.39/7.32 === Backtracking. Learning clause 12:1:0:[6.2,9.1]:: axiom(or(not(or(not(p),not(q))),not(not(or(not(p),not(q)))))) ->
% 27.39/7.32 === Backtracking. Learning clause 13:2:1:[8.3,9.1]:Top: axiom(or(not(or(not(p),not(q))),x0)),theorem(or(not(x0),not(not(or(not(p),not(q)))))) ->
% 27.39/7.32 === Clause set with instances from active satisfied. Growing active. New size: 24
% 27.39/7.32 === Restarting.
% 27.39/7.32 === Backtracking. Learning clause 14:2:1:[6.2,10.1]:Top: axiom(or(x0,x0)) -> theorem(x0)
% 27.39/7.32 === Backtracking. Learning clause 15:1:1:[6.2,8.2,1.1,2.1]:Top: -> theorem(or(not(x0),x0))
% 27.39/7.32 === Clause set with instances from active satisfied. Growing active. New size: 27
% 27.39/7.32 === Restarting.
% 27.39/7.32 === Backtracking. Learning clause 16:2:2:[7.1,2.1]:TopTop: theorem(x0) -> theorem(or(x1,x0))
% 27.39/7.32 === Backtracking. Learning clause 17:2:1:[6.2,13.2]:Top: axiom(or(not(x0),not(not(or(not(p),not(q)))))),axiom(or(not(or(not(p),not(q))),x0)) ->
% 27.39/7.32 === Clause set with instances from active satisfied. Growing active. New size: 30
% 27.39/7.32 === Restarting.
% 27.39/7.32 === Conflict found: 13:2:1:[8.3,9.1]:Top: axiom(or(not(or(not(p),not(q))),x0)),theorem(or(not(x0),not(not(or(not(p),not(q)))))) -> {x0 -> p}
% 27.39/7.32 === Backtracking. Learning clause 18:2:1:[13.2,16.2]:Top: axiom(or(not(or(not(p),not(q))),x0)),theorem(not(not(or(not(p),not(q))))) ->
% 27.39/7.32 === Conflict found: 16:2:2:[7.1,2.1]:TopTop: theorem(x0) -> theorem(or(x1,x0)) {x0 -> not(not(or(not(p),not(q)))), x1 -> not(or(not(p),not(q)))}
% 27.39/7.32 === Backtracking. Learning clause 19:1:0:[16.2,9.1]:: theorem(not(not(or(not(p),not(q))))) ->
% 27.39/7.32 === Conflict found: 17:2:1:[6.2,13.2]:Top: axiom(or(not(x0),not(not(or(not(p),not(q)))))),axiom(or(not(or(not(p),not(q))),x0)) -> {x0 -> or(not(not(or(not(p),not(q)))),not(not(or(not(p),not(q)))))}
% 27.39/7.32 === Backtracking. Learning clause 20:1:0:[17.1,1.1]:: axiom(or(not(or(not(p),not(q))),or(not(not(or(not(p),not(q)))),not(not(or(not(p),not(q))))))) ->
% 27.39/7.32 === Clause set with instances from active satisfied. Growing active. New size: 34
% 27.39/7.32 === Restarting.
% 27.39/7.32 === Backtracking. Learning clause 21:1:0:[6.2,19.1]:: axiom(not(not(or(not(p),not(q))))) ->
% 27.39/7.32 === Clause set with instances from active satisfied. Growing active. New size: 98
% 27.39/7.32 === Clause set with instances from active satisfied. Growing active. New size: 162
% 27.39/7.32 === Clause set with instances from active satisfied. Growing active. New size: 226
% 27.39/7.32 === Clause set with instances from active satisfied. Growing active. New size: 290
% 27.39/7.32 === Clause set with instances from active satisfied. Growing active. New size: 354
% 27.39/7.32 === Clause set with instances from active satisfied. Growing active. New size: 418
% 27.39/7.32 === Clause set with instances from active satisfied. Growing active. New size: 482
% 27.39/7.32 === Backtracking. Learning clause 22:4:3:[8.3,10.1,8.3]:TopTopTop: axiom(or(not(x0),x1)),axiom(or(not(x1),x2)),theorem(or(not(x2),not(x0))) -> theorem(not(x0))
% 27.39/7.32 === Conflict found: 22:4:3:[8.3,10.1,8.3]:TopTopTop: axiom(or(not(x0),x1)),axiom(or(not(x1),x2)),theorem(or(not(x2),not(x0))) -> theorem(not(x0)) {x0 -> p, x1 -> p, x2 -> or(q,p)}
% 27.39/7.32 === Backtracking. Learning clause 23:3:3:[22.2,2.1]:TopTopTop: axiom(or(not(x0),x1)),theorem(or(not(or(x2,x1)),not(x0))) -> theorem(not(x0))
% 27.39/7.32 === Backtracking. Learning clause 24:2:2:[7.2,15.1]:TopTop: axiom(or(not(or(not(x0),x0)),x1)) -> theorem(x1)
% 27.39/7.32 === Clause set with instances from active satisfied. Growing active. New size: 546
% 27.39/7.32 === Conflict found: 22:4:3:[8.3,10.1,8.3]:TopTopTop: axiom(or(not(x0),x1)),axiom(or(not(x1),x2)),theorem(or(not(x2),not(x0))) -> theorem(not(x0)) {x0 -> p, x1 -> or(not(or(p,p)),p), x2 -> not(q)}
% 27.39/7.32 === Backtracking. Learning clause 25:3:3:[22.1,2.1]:TopTopTop: axiom(or(not(or(x0,x1)),x2)),theorem(or(not(x2),not(x1))) -> theorem(not(x1))
% 27.39/7.32 === Clause set with instances from active satisfied. Growing active. New size: 610
% 27.39/7.32 === Clause set with instances from active satisfied. Growing active. New size: 674
% 27.39/7.32 === Clause set with instances from active satisfied. Growing active. New size: 738
% 27.39/7.32 === Clause set with instances from active satisfied. Growing active. New size: 802
% 27.39/7.32 === Clause set with instances from active satisfied. Growing active. New size: 866
% 27.39/7.32 === Clause set with instances from active satisfied. Growing active. New size: 930
% 27.39/7.32 === Clause set with instances from active satisfied. Growing active. New size: 994
% 27.39/7.32 === Clause set with instances from active satisfied. Growing active. New size: 1058
% 27.39/7.32 === Clause set with instances from active satisfied. Growing active. New size: 1122
% 27.39/7.32 === Backtracking. Learning clause 26:2:2:[7.1,3.1]:TopTop: theorem(or(x0,x1)) -> theorem(or(x1,x0))
% 27.39/7.32 === Backtracking. Learning clause 27:1:3:[6.1,5.1]:TopTopTop: -> theorem(or(not(or(not(x0),x1)),or(not(or(x2,x0)),or(x2,x1))))
% 27.39/7.32 === Clause set with instances from active satisfied. Growing active. New size: 1186
% 27.39/7.32 === Conflict found: 26:2:2:[7.1,3.1]:TopTop: theorem(or(x0,x1)) -> theorem(or(x1,x0)) {x0 -> not(or(p,q)), x1 -> not(p)}
% 27.39/7.32 === Backtracking. Learning clause 28:3:3:[26.1,8.3]:TopTopTop: axiom(or(not(x0),x1)),theorem(or(not(x1),x2)) -> theorem(or(x2,not(x0)))
% 27.39/7.32 === Conflict found: 26:2:2:[7.1,3.1]:TopTop: theorem(or(x0,x1)) -> theorem(or(x1,x0)) {x0 -> not(not(or(not(p),not(q)))), x1 -> not(or(not(p),not(q)))}
% 27.39/7.32
% 27.39/7.32 SZS status Unsatisfiable
% 27.39/7.32
% 27.39/7.32 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 27.39/7.32
% 27.39/7.32 SPASS-SCL-FOL Statistics:
% 27.39/7.32 Number of learned clauses: 19
% 27.39/7.32 Number of propagations: 3690
% 27.39/7.32 Number of decisions: 737
% 27.39/7.32 Number of resolutions: 24
% 27.39/7.32 Number of condensations: 0
% 27.39/7.32 Number of sub resolutions: 0
% 27.39/7.32 Number of input literals (deduplicated): 10
% 27.39/7.32 Number of grows: 22
% 27.39/7.32 Number of considered ground atoms: 1186
% 27.39/7.32
% 27.39/7.32 Needed: 0:00:06.78
% 27.39/7.32
%------------------------------------------------------------------------------