%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : LCL236-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Sep 7 01:09:12 PM UTC 2026
% Result : Unsatisfiable 0.79s 1.10s
% Output : Proof 0.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 7
% Syntax : Number of clauses : 10 ( 6 unt; 0 nHn; 6 RR)
% Number of literals : 16 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 14 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
cnf(axiom_1_3,axiom,
axiom(or(not(X0),or(X1,X0))),
file('LCL003-0.ax',axiom_1_3) ).
% FILE RECORD
cnf(rule_3,axiom,
( ~ axiom(or(not(X0),X1))
| ~ theorem(or(not(X1),X2))
| theorem(or(not(X0),X2)) ),
file('LCL003-0.ax',rule_3) ).
% FILE RECORD
cnf(rule_1,axiom,
( ~ axiom(X0)
| theorem(X0) ),
file('LCL003-0.ax',rule_1) ).
% FILE RECORD
cnf(axiom_1_2,axiom,
axiom(or(not(or(X0,X0)),X0)),
file('LCL003-0.ax',axiom_1_2) ).
% CNF SPASS RESOLUTION.
cnf(c_20,plain,
theorem(or(not(X0),X0)),
inference(resolution,[status(thm)],[axiom_1_3,rule_3,rule_1,axiom_1_2]) ).
% FILE RECORD
cnf(axiom_1_4,axiom,
axiom(or(not(or(X0,X1)),or(X1,X0))),
file('LCL003-0.ax',axiom_1_4) ).
% FILE RECORD
cnf(rule_2,axiom,
( ~ axiom(or(not(X0),X1))
| ~ theorem(X0)
| theorem(X1) ),
file('LCL003-0.ax',rule_2) ).
% CNF SPASS RESOLUTION.
cnf(c_18,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X1,X0)) ),
inference(resolution,[status(thm)],[axiom_1_4,rule_2]) ).
% FILE RECORD
cnf(prove_this,negated_conjecture,
~ theorem(or(not(or(not(p),not(q))),not(not(or(not(p),not(q)))))),
file('theBenchmark.p',prove_this) ).
% CNF SPASS RESOLUTION.
cnf(c_21,plain,
$false,
inference(resolution,[status(thm)],[c_20,c_18,prove_this]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL236-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n017.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sat Sep 5 07:26:51 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.79/1.10
% 0.79/1.10 % Input Clauses:
% 0.79/1.10 % 1:1:1:INP:Top: -> axiom(or(not(or(x0,x0)),x0))
% 0.79/1.10 % 2:1:2:INP:TopTop: -> axiom(or(not(x0),or(x1,x0)))
% 0.79/1.10 % 3:1:2:INP:TopTop: -> axiom(or(not(or(x0,x1)),or(x1,x0)))
% 0.79/1.10 % 4:1:3:INP:TopTopTop: -> axiom(or(not(or(x0,or(x1,x2))),or(x1,or(x0,x2))))
% 0.79/1.10 % 5:1:3:INP:TopTopTop: -> axiom(or(not(or(not(x0),x1)),or(not(or(x2,x0)),or(x2,x1))))
% 0.79/1.10 % 6:2:1:INP:Top: axiom(x0) -> theorem(x0)
% 0.79/1.10 % 7:3:2:INP:TopTop: axiom(or(not(x0),x1)),theorem(x0) -> theorem(x1)
% 0.79/1.10 % 8:3:3:INP:TopTopTop: axiom(or(not(x0),x1)),theorem(or(not(x1),x2)) -> theorem(or(not(x0),x2))
% 0.79/1.10 % 9:1:0:INP:: theorem(or(not(or(not(p),not(q))),not(not(or(not(p),not(q)))))) ->
% 0.79/1.10
% 0.79/1.10 % Predicates: axiom theorem
% 0.79/1.10 % Fol Constants: p q
% 0.79/1.10 % Fol Functions: or not
% 0.79/1.10 % Problem Properties:
% 0.79/1.10 % This is a full first-order problem without equality. The Problem is non-linear.
% 0.79/1.10
% 0.79/1.10
% 0.79/1.10 % Reduced Input Axiom Clauses:
% 0.79/1.10 % 1:1:1:INP:Top: -> axiom(or(not(or(x0,x0)),x0))
% 0.79/1.10 % 2:1:2:INP:TopTop: -> axiom(or(not(x0),or(x1,x0)))
% 0.79/1.10 % 3:1:2:INP:TopTop: -> axiom(or(not(or(x0,x1)),or(x1,x0)))
% 0.79/1.10 % 4:1:3:INP:TopTopTop: -> axiom(or(not(or(x0,or(x1,x2))),or(x1,or(x0,x2))))
% 0.79/1.10 % 5:1:3:INP:TopTopTop: -> axiom(or(not(or(not(x0),x1)),or(not(or(x2,x0)),or(x2,x1))))
% 0.79/1.10 % 6:2:1:INP:Top: axiom(x0) -> theorem(x0)
% 0.79/1.10 % 7:3:2:INP:TopTop: axiom(or(not(x0),x1)),theorem(x0) -> theorem(x1)
% 0.79/1.10 % 8:3:3:INP:TopTopTop: axiom(or(not(x0),x1)),theorem(or(not(x1),x2)) -> theorem(or(not(x0),x2))
% 0.79/1.10
% 0.79/1.10 % Reduced Input Conjecture Clauses:
% 0.79/1.10 % 9:1:0:INP:: theorem(or(not(or(not(p),not(q))),not(not(or(not(p),not(q)))))) ->
% 0.79/1.10
% 0.79/1.10
% 0.79/1.10 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 14 atoms initially. Used heuristic: lmodel_grow ===
% 0.79/1.10
% 0.79/1.10
% 0.79/1.10
% 0.79/1.10 % SZS status Unsatisfiable
% 0.79/1.10 % Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.79/1.10
% 0.79/1.10 % SPASS-SCL-FOL Statistics:
% 0.79/1.10 % Number of learned clauses: 11
% 0.79/1.10 % Number of propagations: 1285
% 0.79/1.10 % Number of decisions: 387
% 0.79/1.10 % Number of resolutions: 15
% 0.79/1.10 % Number of condensations: 0
% 0.79/1.10 % Number of sub resolutions: 0
% 0.79/1.10
% 0.79/1.10 % Solver is done. Empty clause found
% 0.79/1.10
% 0.79/1.10 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.79/1.10 % SZS output start Proof for theBenchmark
% See solution above
% 0.79/1.11 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.79/1.11
% 0.79/1.11
% 0.79/1.11 % Needed: 0:00:00.74
% 0.79/1.11
% 0.79/1.11 % ###
% 0.79/1.11 % ### Pagesize: 8192
% 0.79/1.11 % ### Marksize: 0
% 0.79/1.11 % ### Memory demanded: 9257 KBytes
% 0.79/1.11 % ### Memory freed: 9257 KBytes
% 0.79/1.11 % ### Memory remaining: 0 Bytes
% 0.79/1.11 % ### Pages allocated: 1213 Pages
% 0.79/1.11 % ###
%------------------------------------------------------------------------------