%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC167-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 : n031.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:34 PM UTC 2026
% Result : Unsatisfiable 1.35s 1.75s
% Output : CNFRefutation 1.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 19
% Syntax : Number of clauses : 57 ( 28 unt; 5 nHn; 50 RR)
% Number of literals : 144 ( 19 equ; 93 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 71 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_15,negated_conjecture,
app(app(app(sk8,cons(sk6,nil)),cons(sk7,nil)),sk9) = sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_16,negated_conjecture,
~ neq(sk6,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(clause102,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause102) ).
cnf(co1_11,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_12,negated_conjecture,
ssItem(sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(co1_14,negated_conjecture,
ssList(sk9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(clause179,axiom,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_13,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
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/sandbox2/benchmark/Axioms/SWC001-0.ax',clause181) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause63,axiom,
( ~ lt(X1,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause63) ).
cnf(co1_9,negated_conjecture,
strictorderedP(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(c_0_19,negated_conjecture,
app(app(app(sk8,cons(sk6,nil)),cons(sk7,nil)),sk9) = sk1,
co1_15 ).
cnf(c_0_20,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_21,negated_conjecture,
~ neq(sk6,sk7),
co1_16 ).
cnf(c_0_22,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
clause102 ).
cnf(c_0_23,negated_conjecture,
ssItem(sk6),
co1_11 ).
cnf(c_0_24,negated_conjecture,
ssItem(sk7),
co1_12 ).
cnf(c_0_25,negated_conjecture,
app(app(app(sk8,cons(sk6,nil)),cons(sk7,nil)),sk9) = sk3,
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,negated_conjecture,
sk7 = sk6,
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_27,negated_conjecture,
app(app(app(sk8,cons(sk6,nil)),cons(sk6,nil)),sk9) = sk3,
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_29,negated_conjecture,
ssList(sk9),
co1_14 ).
cnf(c_0_30,axiom,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
clause179 ).
cnf(c_0_31,negated_conjecture,
( app(app(sk8,cons(sk6,nil)),app(cons(sk6,nil),sk9)) = sk3
| ~ ssList(app(sk8,cons(sk6,nil)))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_32,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_33,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_34,plain,
( ~ ssItem(X1)
| ~ ssList(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ duplicatefreeP(app(app(X2,cons(X1,X3)),cons(X1,X4))) ),
inference(er,[status(thm)],[c_0_30]) ).
cnf(c_0_35,negated_conjecture,
( app(app(sk8,cons(sk6,nil)),cons(sk6,sk9)) = sk3
| ~ ssList(app(sk8,cons(sk6,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_32]),c_0_23]),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,axiom,
ssList(nil),
clause8 ).
cnf(c_0_38,negated_conjecture,
ssList(sk8),
co1_13 ).
cnf(c_0_39,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_40,negated_conjecture,
( ~ ssList(app(sk8,cons(sk6,nil)))
| ~ ssList(cons(sk6,nil))
| ~ duplicatefreeP(sk3) ),
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(spm,[status(thm)],[c_0_34,c_0_35]),c_0_23]),c_0_36]),c_0_29]),c_0_37]),c_0_38])]) ).
cnf(c_0_41,negated_conjecture,
( ssItem(X1)
| duplicatefreeP(sk3) ),
inference(spm,[status(thm)],[c_0_39,c_0_36]) ).
cnf(c_0_42,negated_conjecture,
( ssItem(X1)
| ~ ssList(app(sk8,cons(sk6,nil)))
| ~ ssList(cons(sk6,nil)) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_43,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_44,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_45,negated_conjecture,
( ssItem(X1)
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_38])]) ).
cnf(c_0_46,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_47,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_44]) ).
cnf(c_0_48,negated_conjecture,
ssItem(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_23]),c_0_37])]) ).
cnf(c_0_49,axiom,
( ~ lt(X1,X1)
| ~ ssItem(X1) ),
clause63 ).
cnf(c_0_50,plain,
( lt(X1,X2)
| ~ 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(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48]),c_0_48])]) ).
cnf(c_0_51,negated_conjecture,
strictorderedP(sk3),
co1_9 ).
cnf(c_0_52,plain,
~ lt(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_48])]) ).
cnf(c_0_53,negated_conjecture,
( ~ ssList(app(sk8,cons(sk6,nil)))
| ~ ssList(cons(sk6,nil)) ),
inference(sr,[status(thm)],[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(spm,[status(thm)],[c_0_50,c_0_35]),c_0_36]),c_0_29]),c_0_37]),c_0_38]),c_0_51])]),c_0_52]) ).
cnf(c_0_54,negated_conjecture,
~ ssList(cons(sk6,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_43]),c_0_38])]) ).
cnf(c_0_55,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_48])]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWC167-1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.11 % 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.14/0.31 % Computer : n031.cluster.edu
% 0.14/0.31 % Model : x86_64 x86_64
% 0.14/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.31 % Memory : 8042.1875MB
% 0.14/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.31 % CPULimit : 300
% 0.14/0.31 % WCLimit : 300
% 0.14/0.31 % DateTime : Tue May 5 04:33:23 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.33 % start to proof: theBenchmark
% 1.35/1.75 % Version : CSE_E---1.7
% 1.35/1.75 % Problem : theBenchmark.p
% 1.35/1.75 % SZS status Unsatisfiable for theBenchmark.p
% 1.35/1.75 % SZS output start CNFRefutation
% See solution above
% 1.35/1.76 % Total time : 1.372s
%------------------------------------------------------------------------------