%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC160-1 : TPTP v9.2.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n006.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:18:32 PM UTC 2026
% Result : Unsatisfiable 1.44s 1.77s
% Output : CNFRefutation 1.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 19
% Syntax : Number of clauses : 56 ( 27 unt; 2 nHn; 56 RR)
% Number of literals : 140 ( 22 equ; 88 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_16,negated_conjecture,
app(app(app(app(sk8,cons(sk6,nil)),sk9),cons(sk7,nil)),sk10) = sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(co1_13,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_14,negated_conjecture,
ssList(sk9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(co1_11,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_15,negated_conjecture,
ssList(sk10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(clause181,axiom,
( lt(X2,X4)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ strictorderedP(X6)
| ~ ssList(X6) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause181) ).
cnf(co1_12,negated_conjecture,
ssItem(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_9,negated_conjecture,
strictorderedP(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause114,axiom,
( ~ lt(X1,X2)
| ~ lt(X2,X1)
| ~ ssItem(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause114) ).
cnf(clause121,axiom,
( lt(X1,X2)
| X1 = X2
| ~ leq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause121) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_17,negated_conjecture,
leq(sk7,sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause63,axiom,
( ~ lt(X1,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause63) ).
cnf(c_0_19,negated_conjecture,
app(app(app(app(sk8,cons(sk6,nil)),sk9),cons(sk7,nil)),sk10) = sk1,
co1_16 ).
cnf(c_0_20,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_21,negated_conjecture,
app(app(app(app(sk8,cons(sk6,nil)),sk9),cons(sk7,nil)),sk10) = sk3,
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_23,negated_conjecture,
ssList(sk8),
co1_13 ).
cnf(c_0_24,negated_conjecture,
ssList(sk9),
co1_14 ).
cnf(c_0_25,negated_conjecture,
( app(app(app(sk8,app(cons(sk6,nil),sk9)),cons(sk7,nil)),sk10) = sk3
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_26,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_27,negated_conjecture,
ssItem(sk6),
co1_11 ).
cnf(c_0_28,negated_conjecture,
( app(app(app(sk8,cons(sk6,sk9)),cons(sk7,nil)),sk10) = sk3
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_24])]) ).
cnf(c_0_29,negated_conjecture,
ssList(sk10),
co1_15 ).
cnf(c_0_30,axiom,
( lt(X2,X4)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ strictorderedP(X6)
| ~ ssList(X6) ),
clause181 ).
cnf(c_0_31,negated_conjecture,
( app(app(sk8,cons(sk6,sk9)),app(cons(sk7,nil),sk10)) = sk3
| ~ ssList(app(sk8,cons(sk6,sk9)))
| ~ ssList(cons(sk7,nil))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_28]),c_0_29])]) ).
cnf(c_0_32,negated_conjecture,
ssItem(sk7),
co1_12 ).
cnf(c_0_33,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_34,plain,
( lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5))) ),
inference(er,[status(thm)],[c_0_30]) ).
cnf(c_0_35,negated_conjecture,
( app(app(sk8,cons(sk6,sk9)),cons(sk7,sk10)) = sk3
| ~ ssList(app(sk8,cons(sk6,sk9)))
| ~ ssList(cons(sk7,nil))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_26]),c_0_32]),c_0_29])]) ).
cnf(c_0_36,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_33,c_0_20]) ).
cnf(c_0_37,negated_conjecture,
strictorderedP(sk3),
co1_9 ).
cnf(c_0_38,axiom,
( ~ lt(X1,X2)
| ~ lt(X2,X1)
| ~ ssItem(X1)
| ~ ssItem(X2) ),
clause114 ).
cnf(c_0_39,axiom,
( lt(X1,X2)
| X1 = X2
| ~ leq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
clause121 ).
cnf(c_0_40,negated_conjecture,
( lt(sk6,sk7)
| ~ ssList(app(sk8,cons(sk6,sk9)))
| ~ ssList(cons(sk7,nil))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_32]),c_0_27]),c_0_36]),c_0_29]),c_0_24]),c_0_23]),c_0_37])]) ).
cnf(c_0_41,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_42,plain,
( X1 = X2
| ~ lt(X2,X1)
| ~ leq(X1,X2)
| ~ ssItem(X1)
| ~ ssItem(X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( lt(sk6,sk7)
| ~ ssList(cons(sk7,nil))
| ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk6,sk9)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_23])]) ).
cnf(c_0_44,negated_conjecture,
leq(sk7,sk6),
co1_17 ).
cnf(c_0_45,negated_conjecture,
( sk7 = sk6
| ~ ssList(cons(sk7,nil))
| ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk6,sk9)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_32]),c_0_27])]) ).
cnf(c_0_46,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_47,axiom,
ssList(nil),
clause8 ).
cnf(c_0_48,negated_conjecture,
( sk7 = sk6
| ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk6,sk9)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_32]),c_0_47])]) ).
cnf(c_0_49,negated_conjecture,
( sk7 = sk6
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_46]),c_0_27]),c_0_24])]) ).
cnf(c_0_50,negated_conjecture,
sk7 = sk6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_46]),c_0_27]),c_0_47])]) ).
cnf(c_0_51,axiom,
( ~ lt(X1,X1)
| ~ ssItem(X1) ),
clause63 ).
cnf(c_0_52,negated_conjecture,
( lt(sk6,sk6)
| ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk6,sk9)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_50]),c_0_50])]) ).
cnf(c_0_53,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk6,sk9)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_27])]) ).
cnf(c_0_54,negated_conjecture,
~ ssList(cons(sk6,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_46]),c_0_27]),c_0_24])]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_46]),c_0_27]),c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC160-1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n006.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 04:30:46 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.44/1.77 % Version : CSE_E---1.7
% 1.44/1.77 % Problem : theBenchmark.p
% 1.44/1.77 % SZS status Unsatisfiable for theBenchmark.p
% 1.44/1.77 % SZS output start CNFRefutation
% See solution above
% 1.44/1.77 % Total time : 1.372s
%------------------------------------------------------------------------------