%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC229-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 : n016.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:49 PM UTC 2026
% Result : Unsatisfiable 27.72s 16.29s
% Output : CNFRefutation 27.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 36
% Syntax : Number of clauses : 131 ( 50 unt; 16 nHn; 119 RR)
% Number of literals : 324 ( 74 equ; 190 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 5 con; 0-3 aty)
% Number of variables : 142 ( 19 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_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(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause50) ).
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(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(co1_8,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause138,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause138) ).
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause101) ).
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_7,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(co1_14,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause152,axiom,
( segmentP(X1,X3)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X3)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause152) ).
cnf(clause116,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause116) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(co1_10,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_10) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause127,axiom,
( X2 = X1
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause127) ).
cnf(clause145,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause145) ).
cnf(clause56,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause56) ).
cnf(c_0_36,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause143 ).
cnf(c_0_37,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_38,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_39,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_40,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_36]),c_0_37]) ).
cnf(c_0_41,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,negated_conjecture,
( rearsegP(app(X1,sk4),sk4)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_43,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause131 ).
cnf(c_0_44,negated_conjecture,
rearsegP(app(sk4,sk4),sk4),
inference(spm,[status(thm)],[c_0_42,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_46,negated_conjecture,
( app(skaf46(app(sk4,sk4),sk4),sk4) = app(sk4,sk4)
| ~ ssList(app(sk4,sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_41])]) ).
cnf(c_0_47,negated_conjecture,
( rearsegP(app(X1,sk1),sk1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_45]) ).
cnf(c_0_48,negated_conjecture,
app(skaf46(app(sk4,sk4),sk4),sk4) = app(sk4,sk4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_37]),c_0_41])]) ).
cnf(c_0_49,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_50,negated_conjecture,
rearsegP(app(sk1,sk1),sk1),
inference(spm,[status(thm)],[c_0_47,c_0_45]) ).
cnf(c_0_51,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_52,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause104 ).
cnf(c_0_53,negated_conjecture,
nil != sk1,
co1_8 ).
cnf(c_0_54,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
clause76 ).
cnf(c_0_55,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
clause75 ).
cnf(c_0_56,negated_conjecture,
ssList(app(sk4,sk4)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_48]),c_0_49]),c_0_41])]) ).
cnf(c_0_57,negated_conjecture,
( app(skaf46(app(sk1,sk1),sk1),sk1) = app(sk1,sk1)
| ~ ssList(app(sk1,sk1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_50]),c_0_45])]) ).
cnf(c_0_58,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_51]) ).
cnf(c_0_59,negated_conjecture,
cons(hd(sk1),tl(sk1)) = sk1,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_45]),c_0_53]) ).
cnf(c_0_60,negated_conjecture,
ssItem(hd(sk1)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_45]),c_0_53]) ).
cnf(c_0_61,negated_conjecture,
ssList(tl(sk1)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_45]),c_0_53]) ).
cnf(c_0_62,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
clause138 ).
cnf(c_0_63,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
clause173 ).
cnf(c_0_64,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_65,negated_conjecture,
rearsegP(app(app(sk4,sk4),sk4),sk4),
inference(spm,[status(thm)],[c_0_42,c_0_56]) ).
cnf(c_0_66,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
clause101 ).
cnf(c_0_67,negated_conjecture,
app(skaf46(app(sk1,sk1),sk1),sk1) = app(sk1,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_37]),c_0_45])]) ).
cnf(c_0_68,negated_conjecture,
( ~ ssList(app(app(X1,cons(hd(sk1),X2)),sk1))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ duplicatefreeP(app(app(X1,cons(hd(sk1),X2)),sk1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),c_0_61])]) ).
cnf(c_0_69,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
clause169 ).
cnf(c_0_70,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_71,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_72,plain,
( memberP(cons(X1,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_62]) ).
cnf(c_0_73,negated_conjecture,
segmentP(sk4,sk3),
co1_7 ).
cnf(c_0_74,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_75,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_63]) ).
cnf(c_0_76,negated_conjecture,
app(nil,sk4) = sk4,
inference(spm,[status(thm)],[c_0_64,c_0_41]) ).
cnf(c_0_77,axiom,
ssList(nil),
clause8 ).
cnf(c_0_78,negated_conjecture,
( app(skaf46(app(app(sk4,sk4),sk4),sk4),sk4) = app(app(sk4,sk4),sk4)
| ~ ssList(app(app(sk4,sk4),sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_65]),c_0_41])]) ).
cnf(c_0_79,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause96 ).
cnf(c_0_80,negated_conjecture,
( cons(skaf44(sk1),nil) = sk1
| ~ singletonP(sk1) ),
inference(spm,[status(thm)],[c_0_66,c_0_45]) ).
cnf(c_0_81,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_82,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
co1_14 ).
cnf(c_0_83,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_84,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_85,negated_conjecture,
ssList(app(sk1,sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_67]),c_0_49]),c_0_45])]) ).
cnf(c_0_86,negated_conjecture,
( ~ memberP(X1,hd(sk1))
| ~ 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_68,c_0_69]),c_0_70]),c_0_71]),c_0_60])]) ).
cnf(c_0_87,negated_conjecture,
memberP(sk1,hd(sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_59]),c_0_60]),c_0_61])]) ).
cnf(c_0_88,axiom,
( segmentP(X1,X3)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X3)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause152 ).
cnf(c_0_89,negated_conjecture,
segmentP(sk4,sk1),
inference(rw,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_90,negated_conjecture,
( segmentP(app(sk4,X1),sk4)
| ~ ssList(app(sk4,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_41]),c_0_77])]) ).
cnf(c_0_91,negated_conjecture,
app(skaf46(app(app(sk4,sk4),sk4),sk4),sk4) = app(app(sk4,sk4),sk4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_37]),c_0_56]),c_0_41])]) ).
cnf(c_0_92,negated_conjecture,
( tl(sk1) = nil
| ~ singletonP(sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_81]),c_0_77])]) ).
cnf(c_0_93,negated_conjecture,
( singletonP(sk1)
| ~ neq(sk4,nil) ),
inference(rw,[status(thm)],[c_0_82,c_0_74]) ).
cnf(c_0_94,negated_conjecture,
( X1 = sk4
| neq(sk4,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_83,c_0_41]) ).
cnf(c_0_95,negated_conjecture,
( ssItem(X1)
| duplicatefreeP(app(sk1,sk1)) ),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_96,negated_conjecture,
~ duplicatefreeP(app(sk1,sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_85]),c_0_87]),c_0_45])]) ).
cnf(c_0_97,negated_conjecture,
( segmentP(X1,sk1)
| ~ segmentP(X1,sk4)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_45]),c_0_41])]) ).
cnf(c_0_98,negated_conjecture,
( segmentP(app(sk4,X1),sk4)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_37]),c_0_41])]) ).
cnf(c_0_99,negated_conjecture,
ssList(app(app(sk4,sk4),sk4)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_91]),c_0_49]),c_0_41])]) ).
cnf(c_0_100,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause116 ).
cnf(c_0_101,negated_conjecture,
( tl(sk1) = nil
| ~ neq(sk4,nil) ),
inference(spm,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_102,negated_conjecture,
( sk4 = nil
| neq(sk4,nil) ),
inference(spm,[status(thm)],[c_0_94,c_0_77]) ).
cnf(c_0_103,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
clause71 ).
cnf(c_0_104,negated_conjecture,
ssItem(X1),
inference(sr,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_105,negated_conjecture,
( memberP(X2,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
co1_10 ).
cnf(c_0_106,negated_conjecture,
( segmentP(app(X1,X2),sk1)
| ~ segmentP(app(X1,X2),sk4)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_97,c_0_37]) ).
cnf(c_0_107,negated_conjecture,
segmentP(app(sk4,app(app(sk4,sk4),sk4)),sk4),
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_108,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_100]) ).
cnf(c_0_109,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_110,negated_conjecture,
( tl(sk1) = nil
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_111,plain,
~ memberP(nil,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_104])]) ).
cnf(c_0_112,negated_conjecture,
( memberP(X1,sk5(X2,X1,skaf44(sk1)))
| app(app(X1,sk1),X2) != sk1
| ~ singletonP(sk1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_80]),c_0_81])]) ).
cnf(c_0_113,negated_conjecture,
app(nil,sk1) = sk1,
inference(spm,[status(thm)],[c_0_64,c_0_45]) ).
cnf(c_0_114,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_115,axiom,
( X2 = X1
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
clause127 ).
cnf(c_0_116,negated_conjecture,
segmentP(app(sk4,app(app(sk4,sk4),sk4)),sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_107]),c_0_41]),c_0_99])]) ).
cnf(c_0_117,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_109]),c_0_77])]) ).
cnf(c_0_118,negated_conjecture,
( cons(hd(sk1),nil) = sk1
| sk4 = nil ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_110]),c_0_45])]),c_0_53]) ).
cnf(c_0_119,negated_conjecture,
( app(sk1,X1) != sk1
| ~ singletonP(sk1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_113]),c_0_77])]) ).
cnf(c_0_120,negated_conjecture,
app(sk1,nil) = sk1,
inference(spm,[status(thm)],[c_0_114,c_0_45]) ).
cnf(c_0_121,negated_conjecture,
( app(sk4,app(app(sk4,sk4),sk4)) = sk1
| ~ segmentP(sk1,app(sk4,app(app(sk4,sk4),sk4)))
| ~ ssList(app(sk4,app(app(sk4,sk4),sk4))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_116]),c_0_45])]) ).
cnf(c_0_122,negated_conjecture,
( sk4 = nil
| singletonP(sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_60])]) ).
cnf(c_0_123,negated_conjecture,
~ singletonP(sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_77]),c_0_120])]) ).
cnf(c_0_124,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
clause145 ).
cnf(c_0_125,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
clause56 ).
cnf(c_0_126,negated_conjecture,
( app(sk4,app(app(sk4,sk4),sk4)) = sk1
| ~ segmentP(sk1,app(sk4,app(app(sk4,sk4),sk4))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_37]),c_0_41]),c_0_99])]) ).
cnf(c_0_127,negated_conjecture,
sk4 = nil,
inference(sr,[status(thm)],[c_0_122,c_0_123]) ).
cnf(c_0_128,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_124])]),c_0_77])]) ).
cnf(c_0_129,negated_conjecture,
segmentP(sk1,nil),
inference(spm,[status(thm)],[c_0_125,c_0_45]) ).
cnf(c_0_130,negated_conjecture,
$false,
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(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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_126,c_0_127]),c_0_127]),c_0_127]),c_0_128]),c_0_127]),c_0_128]),c_0_128]),c_0_127]),c_0_127]),c_0_127]),c_0_128]),c_0_127]),c_0_128]),c_0_128]),c_0_129])]),c_0_53]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWC229-1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.11 % 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.32 % Computer : n016.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32 % CPULimit : 300
% 0.15/0.32 % WCLimit : 300
% 0.15/0.32 % DateTime : Tue May 5 04:37:21 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 27.72/16.29 % Version : CSE_E---1.7
% 27.72/16.29 % Problem : theBenchmark.p
% 27.72/16.29 % SZS status Unsatisfiable for theBenchmark.p
% 27.72/16.29 % SZS output start CNFRefutation
% See solution above
% 27.91/16.40 % Total time : 12.397s
%------------------------------------------------------------------------------