%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC239-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 : n029.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:51 PM UTC 2026
% Result : Unsatisfiable 32.42s 19.22s
% Output : CNFRefutation 32.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 16
% Syntax : Number of clauses : 56 ( 22 unt; 7 nHn; 50 RR)
% Number of literals : 127 ( 36 equ; 76 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 66 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_14,negated_conjecture,
( ssItem(sk6)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_7,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_18,negated_conjecture,
( cons(sk6,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
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(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
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(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(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(co1_9,negated_conjecture,
( memberP(X2,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(c_0_16,negated_conjecture,
( ssItem(sk6)
| nil = sk3 ),
co1_14 ).
cnf(c_0_17,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_18,negated_conjecture,
nil != sk1,
co1_7 ).
cnf(c_0_19,negated_conjecture,
( cons(sk6,nil) = sk3
| nil = sk3 ),
co1_18 ).
cnf(c_0_20,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_21,negated_conjecture,
ssItem(sk6),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_22,negated_conjecture,
cons(sk6,nil) = sk1,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_17]),c_0_17]),c_0_18]) ).
cnf(c_0_23,negated_conjecture,
( app(sk1,X1) = cons(sk6,X1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_24,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_25,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_26,negated_conjecture,
app(sk1,sk1) = cons(sk6,sk1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
ssList(cons(sk6,sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_24])]) ).
cnf(c_0_28,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_29,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_30,negated_conjecture,
app(sk1,cons(sk6,sk1)) = cons(sk6,cons(sk6,sk1)),
inference(spm,[status(thm)],[c_0_23,c_0_27]) ).
cnf(c_0_31,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_28]) ).
cnf(c_0_32,axiom,
ssList(nil),
clause8 ).
cnf(c_0_33,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_34,negated_conjecture,
( app(sk1,app(sk1,X1)) = app(cons(sk6,sk1),X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_26]),c_0_24])]) ).
cnf(c_0_35,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_36,negated_conjecture,
ssList(cons(sk6,cons(sk6,sk1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_30]),c_0_24]),c_0_27])]) ).
cnf(c_0_37,negated_conjecture,
( ~ ssList(app(app(X1,cons(sk6,X2)),sk1))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ duplicatefreeP(app(app(X1,cons(sk6,X2)),sk1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_22]),c_0_21]),c_0_32])]) ).
cnf(c_0_38,negated_conjecture,
app(nil,cons(sk6,sk1)) = cons(sk6,sk1),
inference(spm,[status(thm)],[c_0_33,c_0_27]) ).
cnf(c_0_39,negated_conjecture,
app(cons(sk6,sk1),sk1) = cons(sk6,cons(sk6,sk1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_24]),c_0_26]),c_0_30]) ).
cnf(c_0_40,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_41,negated_conjecture,
( ssItem(X1)
| duplicatefreeP(cons(sk6,cons(sk6,sk1))) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,negated_conjecture,
~ duplicatefreeP(cons(sk6,cons(sk6,sk1))),
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_37,c_0_38]),c_0_39]),c_0_36]),c_0_24]),c_0_32]),c_0_39])]) ).
cnf(c_0_43,plain,
( app(nil,cons(X1,X2)) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_40]) ).
cnf(c_0_44,negated_conjecture,
ssItem(X1),
inference(sr,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
( memberP(X2,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
co1_9 ).
cnf(c_0_46,plain,
( app(nil,cons(X1,X2)) = cons(X1,X2)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).
cnf(c_0_47,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
clause71 ).
cnf(c_0_48,negated_conjecture,
( memberP(X1,sk5(X2,X1,X3))
| app(app(X1,cons(X3,nil)),X2) != sk1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_44])]) ).
cnf(c_0_49,plain,
app(nil,cons(X1,nil)) = cons(X1,nil),
inference(spm,[status(thm)],[c_0_46,c_0_32]) ).
cnf(c_0_50,plain,
~ memberP(nil,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_44])]) ).
cnf(c_0_51,negated_conjecture,
( app(cons(X1,nil),X2) != sk1
| ~ ssList(X2) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_32])]),c_0_50]) ).
cnf(c_0_52,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_53,negated_conjecture,
( app(sk1,X1) != sk1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_22]) ).
cnf(c_0_54,negated_conjecture,
app(sk1,nil) = sk1,
inference(spm,[status(thm)],[c_0_52,c_0_24]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_32]),c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC239-1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.12 % 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.16/0.33 % Computer : n029.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 04:37:44 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 32.42/19.22 % Version : CSE_E---1.7
% 32.42/19.22 % Problem : theBenchmark.p
% 32.42/19.22 % SZS status Unsatisfiable for theBenchmark.p
% 32.42/19.22 % SZS output start CNFRefutation
% See solution above
% 32.52/19.35 % Total time : 14.396s
%------------------------------------------------------------------------------