%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC388-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:44:12 PM UTC 2026
% Result : Unsatisfiable 17.83s 3.01s
% Output : CNFRefutation 17.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 31
% Syntax : Number of clauses : 117 ( 28 unt; 16 nHn; 111 RR)
% Number of literals : 330 ( 88 equ; 214 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 146 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(clause101,axiom,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(co1_9,negated_conjecture,
( ~ neq(sk4,nil)
| singletonP(sk3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause152,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X2,X3)
| ~ segmentP(X1,X2)
| segmentP(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause152) ).
cnf(co1_7,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_10,negated_conjecture,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause96,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause79,axiom,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause79) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause80,axiom,
( ~ ssList(X1)
| ~ segmentP(nil,X1)
| nil = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause80) ).
cnf(clause97,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(clause116,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause116) ).
cnf(clause104,axiom,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause161,axiom,
( ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ memberP(cons(X1,X2),X3)
| X3 = X1
| memberP(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause161) ).
cnf(clause75,axiom,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause76,axiom,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause138,axiom,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause138) ).
cnf(clause71,axiom,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(clause120,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause175,axiom,
( ~ ssList(X4)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(X1,cons(X2,X3)) != X4
| memberP(X4,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause175) ).
cnf(clause149,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(clause168,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause168) ).
cnf(co1_8,negated_conjecture,
( ~ memberP(sk2,X1)
| cons(X1,nil) != sk1
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause49,axiom,
ssList(skaf47(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause49) ).
cnf(clause48,axiom,
ssList(skaf48(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause48) ).
cnf(c_0_31,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_33,negated_conjecture,
( ~ neq(sk4,nil)
| singletonP(sk3) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X2,X3)
| ~ segmentP(X1,X2)
| segmentP(X1,X3) ),
inference(fof_simplification,[status(thm)],[clause152]) ).
cnf(c_0_35,negated_conjecture,
segmentP(sk4,sk3),
co1_7 ).
cnf(c_0_36,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_37,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_38,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_39,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_31 ).
cnf(c_0_40,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
c_0_32 ).
cnf(c_0_41,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_42,axiom,
ssList(nil),
clause8 ).
cnf(c_0_43,negated_conjecture,
( ~ neq(sk4,nil)
| singletonP(sk3) ),
c_0_33 ).
cnf(c_0_44,negated_conjecture,
( nil != sk1
| nil != sk2 ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_45,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_46,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X2,X3)
| ~ segmentP(X1,X2)
| segmentP(X1,X3) ),
c_0_34 ).
cnf(c_0_47,negated_conjecture,
segmentP(sk4,sk1),
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_48,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_49,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_50,plain,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause79]) ).
cnf(c_0_51,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| X1 != nil ),
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_52,negated_conjecture,
( ~ neq(sk4,nil)
| singletonP(sk1) ),
inference(rw,[status(thm)],[c_0_43,c_0_36]) ).
cnf(c_0_53,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_54,negated_conjecture,
( nil != sk1
| nil != sk2 ),
c_0_44 ).
cnf(c_0_55,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
c_0_45 ).
cnf(c_0_56,plain,
( ~ ssList(X1)
| ~ segmentP(nil,X1)
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause80]) ).
cnf(c_0_57,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(X1,sk4)
| segmentP(X1,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_49])]) ).
cnf(c_0_58,plain,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
c_0_50 ).
cnf(c_0_59,negated_conjecture,
( ~ neq(sk4,nil)
| sk1 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_48])]) ).
cnf(c_0_60,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_53 ).
cnf(c_0_61,negated_conjecture,
( sk4 != nil
| sk1 != nil ),
inference(rw,[status(thm)],[c_0_54,c_0_38]) ).
cnf(c_0_62,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause97]) ).
cnf(c_0_63,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| tl(X1) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_40]),c_0_41]),c_0_42])]) ).
cnf(c_0_64,plain,
( ~ ssList(X1)
| ~ segmentP(nil,X1)
| nil = X1 ),
c_0_56 ).
cnf(c_0_65,negated_conjecture,
( sk4 != nil
| segmentP(nil,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_42]),c_0_49])]) ).
cnf(c_0_66,negated_conjecture,
sk1 != nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_49]),c_0_42])]),c_0_61]) ).
cnf(c_0_67,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
c_0_62 ).
cnf(c_0_68,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_69,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_70,negated_conjecture,
( ~ neq(sk4,nil)
| tl(sk1) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_52]),c_0_48])]) ).
cnf(c_0_71,negated_conjecture,
sk4 != nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_48])]),c_0_66]) ).
cnf(c_0_72,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| skaf44(X1) = hd(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_40]),c_0_41]),c_0_42])]) ).
cnf(c_0_73,plain,
( ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ memberP(cons(X1,X2),X3)
| X3 = X1
| memberP(X2,X3) ),
inference(fof_simplification,[status(thm)],[clause161]) ).
cnf(c_0_74,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_75,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_76,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
inference(fof_simplification,[status(thm)],[clause138]) ).
cnf(c_0_77,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
c_0_68 ).
cnf(c_0_78,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
c_0_69 ).
cnf(c_0_79,negated_conjecture,
tl(sk1) = nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_60]),c_0_49]),c_0_42])]),c_0_71]) ).
cnf(c_0_80,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| ssItem(hd(X1)) ),
inference(spm,[status(thm)],[c_0_41,c_0_72]) ).
cnf(c_0_81,plain,
( ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ memberP(cons(X1,X2),X3)
| X3 = X1
| memberP(X2,X3) ),
c_0_73 ).
cnf(c_0_82,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
c_0_74 ).
cnf(c_0_83,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
c_0_75 ).
cnf(c_0_84,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_85,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
c_0_76 ).
cnf(c_0_86,plain,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_77]) ).
cnf(c_0_87,negated_conjecture,
cons(hd(sk1),nil) = sk1,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_48])]),c_0_66]) ).
cnf(c_0_88,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(hd(sk1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_52]),c_0_48])]) ).
cnf(c_0_89,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_90,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| memberP(tl(X1),X2)
| nil = X1
| hd(X1) = X2 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_78]),c_0_82]),c_0_83]) ).
cnf(c_0_91,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
c_0_84 ).
cnf(c_0_92,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| memberP(cons(X1,X2),X1) ),
inference(er,[status(thm)],[c_0_85]) ).
cnf(c_0_93,negated_conjecture,
( ~ ssItem(hd(sk1))
| singletonP(sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_48])]) ).
cnf(c_0_94,negated_conjecture,
ssItem(hd(sk1)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_60]),c_0_49]),c_0_42])]),c_0_71]) ).
cnf(c_0_95,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_89 ).
cnf(c_0_96,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(sk1,X1)
| hd(sk1) = X1 ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_79]),c_0_48])]),c_0_66]),c_0_91]) ).
cnf(c_0_97,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| memberP(X1,skaf44(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_40]),c_0_41]),c_0_42])]) ).
cnf(c_0_98,negated_conjecture,
singletonP(sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_93,c_0_94])]) ).
cnf(c_0_99,plain,
( ~ ssList(X4)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(X1,cons(X2,X3)) != X4
| memberP(X4,X2) ),
inference(fof_simplification,[status(thm)],[clause175]) ).
cnf(c_0_100,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ singletonP(X1)
| cons(skaf44(X1),X2) = app(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_40]),c_0_41])]) ).
cnf(c_0_101,negated_conjecture,
skaf44(sk1) = hd(sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_41]),c_0_98]),c_0_48])]) ).
cnf(c_0_102,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_103,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause168]) ).
cnf(c_0_104,negated_conjecture,
( ~ memberP(sk2,X1)
| cons(X1,nil) != sk1
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_105,plain,
( ~ ssList(X4)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(X1,cons(X2,X3)) != X4
| memberP(X4,X2) ),
c_0_99 ).
cnf(c_0_106,negated_conjecture,
( ~ ssList(X1)
| cons(hd(sk1),X1) = app(sk1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_98]),c_0_48])]) ).
cnf(c_0_107,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_102 ).
cnf(c_0_108,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1 ),
c_0_103 ).
cnf(c_0_109,axiom,
ssList(skaf47(X1,X2)),
clause49 ).
cnf(c_0_110,axiom,
ssList(skaf48(X1,X2)),
clause48 ).
cnf(c_0_111,negated_conjecture,
( ~ memberP(sk2,X1)
| cons(X1,nil) != sk1
| ~ ssItem(X1) ),
c_0_104 ).
cnf(c_0_112,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| app(X2,app(sk1,X3)) != X1
| memberP(X1,hd(sk1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_94])]) ).
cnf(c_0_113,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| app(skaf47(X1,X2),app(X2,skaf48(X2,X1))) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_109]),c_0_110])]) ).
cnf(c_0_114,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(sk4,X1)
| cons(X1,nil) != sk1 ),
inference(rw,[status(thm)],[c_0_111,c_0_38]) ).
cnf(c_0_115,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(X1,sk1)
| memberP(X1,hd(sk1)) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_113]),c_0_110]),c_0_109]),c_0_48])])]) ).
cnf(c_0_116,negated_conjecture,
$false,
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_114,c_0_115]),c_0_87]),c_0_94]),c_0_47]),c_0_49])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC388-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.62 % Computer : n010.cluster.edu
% 0.17/0.62 % Model : x86_64 x86_64
% 0.17/0.62 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.62 % Memory : 8046.5625MB
% 0.17/0.62 % OS : Linux 6.8.0-71-generic
% 0.17/0.62 % CPULimit : 300
% 0.17/0.62 % WCLimit : 300
% 0.17/0.62 % DateTime : Mon Sep 21 08:20:58 UTC 2026
% 0.17/0.62 % CPUTime :
% 0.17/0.62 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.66 Running first-order theorem proving
% 0.20/0.66 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 17.83/3.01 % Version: 3.5.1
% 17.83/3.01 % Preprocessing class: FSLSSMSSSSSNFFN.
% 17.83/3.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.83/3.01 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 17.83/3.01 % Starting new_bool_3 with 300s (1) cores
% 17.83/3.01 % Starting new_bool_1 with 300s (1) cores
% 17.83/3.01 % Starting sh5l with 300s (1) cores
% 17.83/3.01 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 460428 completed with status 0
% 17.83/3.01 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 17.83/3.01 % Preprocessing class: FSLSSMSSSSSNFFN.
% 17.83/3.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.83/3.01 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 17.83/3.01 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 17.83/3.01 % No SInE strategy applied
% 17.83/3.01 % Search class: FGHSM-FSLM21-MFFFFFNN
% 17.83/3.01 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 17.83/3.01 % Starting SubtermCWHack with 136s (1) cores
% 17.83/3.01 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 17.83/3.01 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 17.83/3.01 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 17.83/3.01 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 17.83/3.01 % G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with pid 460436 completed with status 0
% 17.83/3.01 % Result found by G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y
% 17.83/3.01 % Preprocessing class: FSLSSMSSSSSNFFN.
% 17.83/3.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.83/3.01 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 17.83/3.01 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 17.83/3.01 % No SInE strategy applied
% 17.83/3.01 % Search class: FGHSM-FSLM21-MFFFFFNN
% 17.83/3.01 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 17.83/3.01 % Starting SubtermCWHack with 136s (1) cores
% 17.83/3.01 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 17.83/3.01 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 17.83/3.01 % Preprocessing time : 0.004 s
% 17.83/3.01 % Presaturation interreduction done
% 17.83/3.01
% 17.83/3.01 % Proof found!
% 17.83/3.01 % SZS status Unsatisfiable
% 17.83/3.01 % SZS output start CNFRefutation
% See solution above
% 17.83/3.01 % Parsed axioms : 195
% 17.83/3.01 % Removed by relevancy pruning/SinE : 0
% 17.83/3.01 % Initial clauses : 195
% 17.83/3.01 % Removed in clause preprocessing : 0
% 17.83/3.01 % Initial clauses in saturation : 195
% 17.83/3.01 % Processed clauses : 9356
% 17.83/3.01 % ...of these trivial : 262
% 17.83/3.01 % ...subsumed : 6599
% 17.83/3.01 % ...remaining for further processing : 2495
% 17.83/3.01 % Other redundant clauses eliminated : 1424
% 17.83/3.01 % Clauses deleted for lack of memory : 0
% 17.83/3.01 % Backward-subsumed : 90
% 17.83/3.01 % Backward-rewritten : 127
% 17.83/3.01 % Generated clauses : 74216
% 17.83/3.01 % ...of the previous two non-redundant : 68014
% 17.83/3.01 % ...aggressively subsumed : 0
% 17.83/3.01 % Contextual simplify-reflections : 443
% 17.83/3.01 % Paramodulations : 72539
% 17.83/3.01 % Factorizations : 2
% 17.83/3.01 % NegExts : 0
% 17.83/3.01 % Equation resolutions : 1647
% 17.83/3.01 % Disequality decompositions : 0
% 17.83/3.01 % Total rewrite steps : 67253
% 17.83/3.01 % ...of those cached : 66089
% 17.83/3.01 % Propositional unsat checks : 0
% 17.83/3.01 % Propositional check models : 0
% 17.83/3.01 % Propositional check unsatisfiable : 0
% 17.83/3.01 % Propositional clauses : 0
% 17.83/3.01 % Propositional clauses after purity: 0
% 17.83/3.01 % Propositional unsat core size : 0
% 17.83/3.01 % Propositional preprocessing time : 0.000
% 17.83/3.01 % Propositional encoding time : 0.000
% 17.83/3.01 % Propositional solver time : 0.000
% 17.83/3.01 % Success case prop preproc time : 0.000
% 17.83/3.01 % Success case prop encoding time : 0.000
% 17.83/3.01 % Success case prop solver time : 0.000
% 17.83/3.01 % Current number of processed clauses : 2070
% 17.83/3.01 % Positive orientable unit clauses : 168
% 17.83/3.01 % Positive unorientable unit clauses: 0
% 17.83/3.01 % Negative unit clauses : 112
% 17.83/3.01 % Non-unit-clauses : 1790
% 17.83/3.01 % Current number of unprocessed clauses: 58736
% 17.83/3.01 % ...number of literals in the above : 464134
% 17.83/3.01 % Current number of archived formulas : 0
% 17.83/3.01 % Current number of archived clauses : 408
% 17.83/3.01 % Clause-clause subsumption calls (NU) : 845501
% 17.83/3.01 % Rec. Clause-clause subsumption calls : 148025
% 17.83/3.01 % Non-unit clause-clause subsumptions : 3374
% 17.83/3.01 % Unit Clause-clause subsumption calls : 29060
% 17.83/3.01 % Rewrite failures with RHS unbound : 0
% 17.83/3.01 % BW rewrite match attempts : 32
% 17.83/3.01 % BW rewrite match successes : 30
% 17.83/3.01 % Condensation attempts : 0
% 17.83/3.01 % Condensation successes : 0
% 17.83/3.01 % Termbank termtop insertions : 1768021
% 17.83/3.01 % Search garbage collected termcells : 541
% 17.83/3.01
% 17.83/3.01 % -------------------------------------------------
% 17.83/3.01 % User time : 2.190 s
% 17.83/3.01 % System time : 0.082 s
% 17.83/3.01 % Total time : 2.272 s
% 17.83/3.01 % Maximum resident set size: 4064 pages
% 17.83/3.01
% 17.83/3.01 % -------------------------------------------------
% 17.83/3.01 % User time : 10.958 s
% 17.83/3.01 % System time : 0.392 s
% 17.83/3.01 % Total time : 11.350 s
% 17.83/3.01 % Maximum resident set size: 4864 pages
% 17.83/3.01 % E exiting
%------------------------------------------------------------------------------