%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC292-1 : TPTP v9.2.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n024.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 : Tue May 5 05:19:03 PM UTC 2026
% Result : Unsatisfiable 1.17s 1.65s
% Output : CNFRefutation 1.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 29 ( 18 unt; 2 nHn; 29 RR)
% Number of literals : 44 ( 15 equ; 18 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
~ strictorderedP(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_8,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause3,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause3) ).
cnf(co1_10,negated_conjecture,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_9,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause66,axiom,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause66) ).
cnf(c_0_11,negated_conjecture,
~ strictorderedP(sk1),
co1_7 ).
cnf(c_0_12,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_13,negated_conjecture,
~ strictorderedP(sk3),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,negated_conjecture,
( nil = sk3
| nil != sk4 ),
co1_8 ).
cnf(c_0_15,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_16,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_17,negated_conjecture,
( sk4 != nil
| ~ strictorderedP(nil) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,axiom,
strictorderedP(nil),
clause3 ).
cnf(c_0_19,negated_conjecture,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
co1_10 ).
cnf(c_0_20,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_21,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,axiom,
ssList(nil),
clause8 ).
cnf(c_0_23,negated_conjecture,
sk4 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_24,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
co1_9 ).
cnf(c_0_25,axiom,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
clause66 ).
cnf(c_0_26,negated_conjecture,
cons(sk5,nil) = sk3,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]),c_0_23]) ).
cnf(c_0_27,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_20]),c_0_21]),c_0_22])]),c_0_23]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SWC292-1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.07 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.08/0.27 % Computer : n024.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 300
% 0.08/0.27 % DateTime : Mon May 4 23:42:11 EDT 2026
% 0.08/0.27 % CPUTime :
% 0.08/0.27 % start to proof: theBenchmark
% 1.17/1.65 % Version : CSE_E---1.7
% 1.17/1.65 % Problem : theBenchmark.p
% 1.17/1.65 % SZS status Unsatisfiable for theBenchmark.p
% 1.17/1.65 % SZS output start CNFRefutation
% See solution above
% 1.17/1.65 % Total time : 1.368s
%------------------------------------------------------------------------------