%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC252-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 : n009.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:54 PM UTC 2026
% Result : Unsatisfiable 33.56s 20.09s
% Output : CNFRefutation 33.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 23
% Syntax : Number of clauses : 71 ( 31 unt; 9 nHn; 59 RR)
% Number of literals : 159 ( 38 equ; 92 neg)
% Maximal clause size : 7 ( 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; 6 con; 0-3 aty)
% Number of variables : 84 ( 18 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause143,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause143) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
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(clause131,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause131) ).
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/sandbox/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(co1_17,negated_conjecture,
( cons(sk6,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_7,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_14,negated_conjecture,
( ssItem(sk6)
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause50) ).
cnf(clause169,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause169) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(co1_18,negated_conjecture,
( memberP(sk4,sk6)
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(c_0_23,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause143 ).
cnf(c_0_24,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_25,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_23]),c_0_24]) ).
cnf(c_0_26,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_27,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_28,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_29,negated_conjecture,
( rearsegP(app(X1,sk1),sk1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause131 ).
cnf(c_0_32,negated_conjecture,
rearsegP(app(sk4,sk1),sk1),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,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_34,negated_conjecture,
( cons(sk6,nil) = sk3
| nil = sk3 ),
co1_17 ).
cnf(c_0_35,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_36,negated_conjecture,
nil != sk1,
co1_7 ).
cnf(c_0_37,negated_conjecture,
( ssItem(sk6)
| nil = sk3 ),
co1_14 ).
cnf(c_0_38,negated_conjecture,
( app(skaf46(app(sk4,sk1),sk1),sk1) = app(sk4,sk1)
| ~ ssList(app(sk4,sk1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_26])]) ).
cnf(c_0_39,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_33]) ).
cnf(c_0_40,negated_conjecture,
cons(sk6,nil) = sk1,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_35]),c_0_36]) ).
cnf(c_0_41,negated_conjecture,
ssItem(sk6),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_35]),c_0_36]) ).
cnf(c_0_42,axiom,
ssList(nil),
clause8 ).
cnf(c_0_43,negated_conjecture,
app(skaf46(app(sk4,sk1),sk1),sk1) = app(sk4,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_24]),c_0_30]),c_0_26])]) ).
cnf(c_0_44,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_45,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_39,c_0_40]),c_0_41]),c_0_42])]) ).
cnf(c_0_46,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
clause169 ).
cnf(c_0_47,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_48,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_49,negated_conjecture,
( memberP(sk4,sk6)
| nil = sk3 ),
co1_18 ).
cnf(c_0_50,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_51,negated_conjecture,
ssList(app(sk4,sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_43]),c_0_44]),c_0_26])]) ).
cnf(c_0_52,negated_conjecture,
( ~ memberP(X1,sk6)
| ~ ssList(app(X1,sk1))
| ~ ssList(X1)
| ~ duplicatefreeP(app(X1,sk1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_48]),c_0_41])]) ).
cnf(c_0_53,negated_conjecture,
memberP(sk4,sk6),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_35]),c_0_36]) ).
cnf(c_0_54,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_55,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_56,negated_conjecture,
( ssItem(X1)
| duplicatefreeP(app(sk4,sk1)) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_57,negated_conjecture,
~ duplicatefreeP(app(sk4,sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_51]),c_0_53]),c_0_30])]) ).
cnf(c_0_58,plain,
( app(nil,cons(X1,X2)) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,negated_conjecture,
ssItem(X1),
inference(sr,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_60,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_61,plain,
( app(nil,cons(X1,X2)) = cons(X1,X2)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59])]) ).
cnf(c_0_62,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
clause71 ).
cnf(c_0_63,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_60,c_0_59])]) ).
cnf(c_0_64,plain,
app(nil,cons(X1,nil)) = cons(X1,nil),
inference(spm,[status(thm)],[c_0_61,c_0_42]) ).
cnf(c_0_65,plain,
~ memberP(nil,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_59])]) ).
cnf(c_0_66,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_63,c_0_64]),c_0_42])]),c_0_65]) ).
cnf(c_0_67,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_68,negated_conjecture,
( app(sk1,X1) != sk1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_66,c_0_40]) ).
cnf(c_0_69,negated_conjecture,
app(sk1,nil) = sk1,
inference(spm,[status(thm)],[c_0_67,c_0_26]) ).
cnf(c_0_70,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_42]),c_0_69])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15 % Problem : SWC252-1 : TPTP v9.2.1. Released v2.4.0.
% 0.07/0.15 % 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.36 % Computer : n009.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue May 5 04:38:56 EDT 2026
% 0.15/0.36 % CPUTime :
% 0.15/0.37 % start to proof: theBenchmark
% 33.56/20.09 % Version : CSE_E---1.7
% 33.56/20.09 % Problem : theBenchmark.p
% 33.56/20.09 % SZS status Unsatisfiable for theBenchmark.p
% 33.56/20.09 % SZS output start CNFRefutation
% See solution above
% 33.74/20.21 % Total time : 15.406s
%------------------------------------------------------------------------------