%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC284-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:19:01 PM UTC 2026
% Result : Unsatisfiable 1.61s 1.80s
% Output : CNFRefutation 1.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 28
% Syntax : Number of clauses : 94 ( 34 unt; 10 nHn; 94 RR)
% Number of literals : 222 ( 65 equ; 125 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 67 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_10,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause119,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(co1_9,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_8,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_12,negated_conjecture,
( memberP(sk6,sk8)
| memberP(sk7,sk8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(co1_11,negated_conjecture,
ssItem(sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_18,negated_conjecture,
( cons(sk9,nil) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_16,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_17,negated_conjecture,
( ssItem(sk9)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
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(clause175,axiom,
( memberP(X4,X2)
| app(X1,cons(X2,X3)) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause175) ).
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_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause161,axiom,
( memberP(X2,X3)
| X3 = X1
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause161) ).
cnf(clause141,axiom,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause141) ).
cnf(clause140,axiom,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause140) ).
cnf(co1_15,negated_conjecture,
( ~ leq(sk8,sk5)
| ~ leq(sk5,sk8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(clause62,axiom,
( leq(X1,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause62) ).
cnf(c_0_28,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk1,
co1_10 ).
cnf(c_0_29,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_30,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause119 ).
cnf(c_0_31,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk3,
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
ssList(sk7),
co1_9 ).
cnf(c_0_33,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause118 ).
cnf(c_0_34,negated_conjecture,
( sk7 = nil
| sk3 != nil
| ~ ssList(app(sk6,cons(sk5,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_35,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_36,negated_conjecture,
ssList(sk6),
co1_8 ).
cnf(c_0_37,negated_conjecture,
( app(sk6,cons(sk5,nil)) = nil
| sk3 != nil
| ~ ssList(app(sk6,cons(sk5,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_31]),c_0_32])]) ).
cnf(c_0_38,negated_conjecture,
( sk7 = nil
| sk3 != nil
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_39,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_40,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_41,axiom,
ssList(nil),
clause8 ).
cnf(c_0_42,negated_conjecture,
( app(sk6,cons(sk5,nil)) = nil
| sk3 != nil
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_35]),c_0_36])]) ).
cnf(c_0_43,negated_conjecture,
( memberP(sk6,sk8)
| memberP(sk7,sk8) ),
co1_12 ).
cnf(c_0_44,negated_conjecture,
( sk7 = nil
| sk3 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_41])]) ).
cnf(c_0_45,negated_conjecture,
( sk6 = nil
| sk3 != nil
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_42]),c_0_36])]) ).
cnf(c_0_46,negated_conjecture,
( memberP(nil,sk8)
| memberP(sk6,sk8)
| sk3 != nil ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
( sk6 = nil
| sk3 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_39]),c_0_40]),c_0_41])]) ).
cnf(c_0_48,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_49,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_50,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
clause71 ).
cnf(c_0_51,negated_conjecture,
( memberP(nil,sk8)
| sk3 != nil ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_52,negated_conjecture,
ssItem(sk8),
co1_11 ).
cnf(c_0_53,negated_conjecture,
( cons(sk9,nil) = sk3
| ~ neq(sk4,nil) ),
co1_18 ).
cnf(c_0_54,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_55,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_56,negated_conjecture,
sk3 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]) ).
cnf(c_0_57,negated_conjecture,
( nil = sk3
| nil != sk4 ),
co1_16 ).
cnf(c_0_58,negated_conjecture,
( ssItem(sk9)
| ~ neq(sk4,nil) ),
co1_17 ).
cnf(c_0_59,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_60,negated_conjecture,
( cons(sk9,nil) = sk3
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]),c_0_41])]) ).
cnf(c_0_61,negated_conjecture,
sk4 != nil,
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_62,negated_conjecture,
( sk4 = nil
| ssItem(sk9) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_54]),c_0_55]),c_0_41])]) ).
cnf(c_0_63,axiom,
( memberP(X4,X2)
| app(X1,cons(X2,X3)) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ ssList(X4) ),
clause175 ).
cnf(c_0_64,negated_conjecture,
( app(sk6,app(cons(sk5,nil),sk7)) = sk3
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_59]),c_0_36]),c_0_32])]) ).
cnf(c_0_65,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_66,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_67,axiom,
( memberP(X2,X3)
| X3 = X1
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
clause161 ).
cnf(c_0_68,negated_conjecture,
cons(sk9,nil) = sk3,
inference(sr,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_69,negated_conjecture,
ssItem(sk9),
inference(sr,[status(thm)],[c_0_62,c_0_61]) ).
cnf(c_0_70,plain,
( memberP(app(X1,cons(X2,X3)),X2)
| ~ ssItem(X2)
| ~ ssList(app(X1,cons(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_63]) ).
cnf(c_0_71,negated_conjecture,
( app(sk6,cons(sk5,sk7)) = sk3
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_40]),c_0_32])]) ).
cnf(c_0_72,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_66,c_0_29]) ).
cnf(c_0_73,negated_conjecture,
( sk9 = X1
| ~ memberP(sk3,X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]),c_0_41])]),c_0_50]) ).
cnf(c_0_74,negated_conjecture,
( memberP(sk3,sk5)
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_40]),c_0_72]),c_0_32]),c_0_36])]) ).
cnf(c_0_75,negated_conjecture,
( sk9 = sk5
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_40])]) ).
cnf(c_0_76,negated_conjecture,
sk9 = sk5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_39]),c_0_40]),c_0_41])]) ).
cnf(c_0_77,negated_conjecture,
cons(sk5,nil) = sk3,
inference(rw,[status(thm)],[c_0_68,c_0_76]) ).
cnf(c_0_78,axiom,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
clause141 ).
cnf(c_0_79,negated_conjecture,
app(app(sk6,sk3),sk7) = sk3,
inference(rw,[status(thm)],[c_0_31,c_0_77]) ).
cnf(c_0_80,axiom,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
clause140 ).
cnf(c_0_81,negated_conjecture,
app(sk6,app(sk3,sk7)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_77]),c_0_77]),c_0_72])]) ).
cnf(c_0_82,negated_conjecture,
( memberP(sk3,X1)
| ~ memberP(sk7,X1)
| ~ ssItem(X1)
| ~ ssList(app(sk6,sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_32])]) ).
cnf(c_0_83,negated_conjecture,
( memberP(sk3,X1)
| ~ memberP(sk6,X1)
| ~ ssItem(X1)
| ~ ssList(app(sk3,sk7)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_36])]) ).
cnf(c_0_84,negated_conjecture,
( memberP(sk6,sk8)
| memberP(sk3,sk8)
| ~ ssList(app(sk6,sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_43]),c_0_52])]) ).
cnf(c_0_85,negated_conjecture,
( sk5 = X1
| ~ memberP(sk3,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_73,c_0_76]) ).
cnf(c_0_86,negated_conjecture,
( memberP(sk3,sk8)
| ~ ssList(app(sk3,sk7))
| ~ ssList(app(sk6,sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_52])]) ).
cnf(c_0_87,negated_conjecture,
( sk5 = sk8
| ~ ssList(app(sk3,sk7))
| ~ ssList(app(sk6,sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_52])]) ).
cnf(c_0_88,negated_conjecture,
( sk5 = sk8
| ~ ssList(app(sk3,sk7)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_35]),c_0_36]),c_0_72])]) ).
cnf(c_0_89,negated_conjecture,
( ~ leq(sk8,sk5)
| ~ leq(sk5,sk8) ),
co1_15 ).
cnf(c_0_90,negated_conjecture,
sk5 = sk8,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_35]),c_0_72]),c_0_32])]) ).
cnf(c_0_91,negated_conjecture,
~ leq(sk8,sk8),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_90]),c_0_90])]) ).
cnf(c_0_92,axiom,
( leq(X1,X1)
| ~ ssItem(X1) ),
clause62 ).
cnf(c_0_93,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_52])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC284-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.16/0.33 % Computer : n006.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:41:46 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 1.61/1.80 % Version : CSE_E---1.7
% 1.61/1.80 % Problem : theBenchmark.p
% 1.61/1.80 % SZS status Unsatisfiable for theBenchmark.p
% 1.61/1.80 % SZS output start CNFRefutation
% See solution above
% 1.61/1.80 % Total time : 1.373s
%------------------------------------------------------------------------------