%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : LCL226-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n011.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:11 PM UTC 2026
% Result : Unsatisfiable 75.36s 75.61s
% Output : Proof 75.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 8 ( 4 unt; 0 nHn; 6 RR)
% Number of literals : 13 ( 0 equ; 6 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 15 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
cnf(axiom_1_6,axiom,
axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
file('LCL003-0.ax',axiom_1_6) ).
% FILE RECORD
cnf(axiom_1_5,axiom,
axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
file('LCL003-0.ax',axiom_1_5) ).
% 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_46,plain,
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(X1,or(X0,X2))) ),
inference(resolution,[status(thm)],[axiom_1_5,rule_2]) ).
% FILE RECORD
cnf(rule_1,axiom,
( ~ axiom(X0)
| theorem(X0) ),
file('LCL003-0.ax',rule_1) ).
% CNF SPASS RESOLUTION.
cnf(c_49,plain,
( ~ axiom(or(X0,or(X1,X2)))
| theorem(or(X1,or(X0,X2))) ),
inference(resolution,[status(thm)],[c_46,rule_1]) ).
% FILE RECORD
cnf(prove_this,negated_conjecture,
~ theorem(or(not(or(q,r)),or(not(or(not(r),s)),or(q,s)))),
file('theBenchmark.p',prove_this) ).
% CNF SPASS RESOLUTION.
cnf(c_50,plain,
$false,
inference(resolution,[status(thm)],[axiom_1_6,c_49,prove_this]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL226-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n011.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Fri Sep 4 18:33:13 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 75.36/75.61
% 75.36/75.61 % Input Clauses:
% 75.36/75.61 % 1:1:1:INP:Top: -> axiom(or(not(or(x0,x0)),x0))
% 75.36/75.61 % 2:1:2:INP:TopTop: -> axiom(or(not(x0),or(x1,x0)))
% 75.36/75.61 % 3:1:2:INP:TopTop: -> axiom(or(not(or(x0,x1)),or(x1,x0)))
% 75.36/75.61 % 4:1:3:INP:TopTopTop: -> axiom(or(not(or(x0,or(x1,x2))),or(x1,or(x0,x2))))
% 75.36/75.61 % 5:1:3:INP:TopTopTop: -> axiom(or(not(or(not(x0),x1)),or(not(or(x2,x0)),or(x2,x1))))
% 75.36/75.61 % 6:2:1:INP:Top: axiom(x0) -> theorem(x0)
% 75.36/75.61 % 7:3:2:INP:TopTop: axiom(or(not(x0),x1)),theorem(x0) -> theorem(x1)
% 75.36/75.61 % 8:3:3:INP:TopTopTop: axiom(or(not(x0),x1)),theorem(or(not(x1),x2)) -> theorem(or(not(x0),x2))
% 75.36/75.61 % 9:1:0:INP:: theorem(or(not(or(q,r)),or(not(or(not(r),s)),or(q,s)))) ->
% 75.36/75.61
% 75.36/75.61 % Predicates: axiom theorem
% 75.36/75.61 % Fol Constants: q r s
% 75.36/75.61 % Fol Functions: or not
% 75.36/75.61 % Problem Properties:
% 75.36/75.61 % This is a full first-order problem without equality. The Problem is non-linear.
% 75.36/75.61
% 75.36/75.61
% 75.36/75.61 % Reduced Input Axiom Clauses:
% 75.36/75.61 % 1:1:1:INP:Top: -> axiom(or(not(or(x0,x0)),x0))
% 75.36/75.61 % 2:1:2:INP:TopTop: -> axiom(or(not(x0),or(x1,x0)))
% 75.36/75.61 % 3:1:2:INP:TopTop: -> axiom(or(not(or(x0,x1)),or(x1,x0)))
% 75.36/75.61 % 4:1:3:INP:TopTopTop: -> axiom(or(not(or(x0,or(x1,x2))),or(x1,or(x0,x2))))
% 75.36/75.61 % 5:1:3:INP:TopTopTop: -> axiom(or(not(or(not(x0),x1)),or(not(or(x2,x0)),or(x2,x1))))
% 75.36/75.61 % 6:2:1:INP:Top: axiom(x0) -> theorem(x0)
% 75.36/75.61 % 7:3:2:INP:TopTop: axiom(or(not(x0),x1)),theorem(x0) -> theorem(x1)
% 75.36/75.61 % 8:3:3:INP:TopTopTop: axiom(or(not(x0),x1)),theorem(or(not(x1),x2)) -> theorem(or(not(x0),x2))
% 75.36/75.61
% 75.36/75.61 % Reduced Input Conjecture Clauses:
% 75.36/75.61 % 9:1:0:INP:: theorem(or(not(or(q,r)),or(not(or(not(r),s)),or(q,s)))) ->
% 75.36/75.61
% 75.36/75.61
% 75.36/75.61 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 14 atoms initially. Used heuristic: lmodel_grow ===
% 75.36/75.61
% 75.36/75.61
% 75.36/75.61
% 75.36/75.61 % SZS status Unsatisfiable
% 75.36/75.61 % Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 75.36/75.61
% 75.36/75.61 % SPASS-SCL-FOL Statistics:
% 75.36/75.61 % Number of learned clauses: 40
% 75.36/75.61 % Number of propagations: 18122
% 75.36/75.61 % Number of decisions: 4340
% 75.36/75.61 % Number of resolutions: 49
% 75.36/75.61 % Number of condensations: 0
% 75.36/75.61 % Number of sub resolutions: 0
% 75.36/75.61
% 75.36/75.61 % Solver is done. Empty clause found
% 75.36/75.61
% 75.36/75.61 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 75.36/75.61 % SZS output start Proof for theBenchmark
% See solution above
% 75.36/75.61 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 75.36/75.61
% 75.36/75.61
% 75.36/75.61 % Needed: 0:1:15.24
% 75.36/75.61
% 75.36/75.61 % ###
% 75.36/75.61 % ### Pagesize: 8192
% 75.36/75.61 % ### Marksize: 0
% 75.36/75.61 % ### Memory demanded: 109011 KBytes
% 75.36/75.61 % ### Memory freed: 109011 KBytes
% 75.36/75.61 % ### Memory remaining: 0 Bytes
% 75.36/75.61 % ### Pages allocated: 11374 Pages
% 75.36/75.61 % ###
%------------------------------------------------------------------------------