%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC314-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 : n005.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:45:50 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.56s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 26
% Syntax : Number of clauses : 109 ( 22 unt; 34 nHn; 109 RR)
% Number of literals : 299 ( 136 equ; 159 neg)
% Maximal clause size : 12 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 91 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause123,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| hd(app(X2,X1)) = hd(X2)
| nil = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause123) ).
cnf(co1_12,negated_conjecture,
( nil = sk2
| app(cons(sk5,nil),sk6) = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_11,negated_conjecture,
( nil = sk2
| ssList(sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(clause157,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(co1_9,negated_conjecture,
( nil = sk2
| ssItem(sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause96,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause76,axiom,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(co1_8,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| hd(sk4) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(sk4) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| sk3 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
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(clause97,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(co1_13,negated_conjecture,
( app(sk6,cons(sk5,nil)) != sk1
| nil = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_7,negated_conjecture,
( nil != sk4
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_15,negated_conjecture,
( nil != sk1
| app(cons(sk5,nil),sk6) = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_10,negated_conjecture,
( nil != sk1
| ssItem(sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_14,negated_conjecture,
( nil != sk1
| ssList(sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
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(c_0_26,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| hd(app(X2,X1)) = hd(X2)
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause123]) ).
cnf(c_0_27,negated_conjecture,
( nil = sk2
| app(cons(sk5,nil),sk6) = sk2 ),
co1_12 ).
cnf(c_0_28,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_29,negated_conjecture,
( nil = sk2
| ssList(sk6) ),
co1_11 ).
cnf(c_0_30,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
inference(fof_simplification,[status(thm)],[clause157]) ).
cnf(c_0_31,negated_conjecture,
( nil = sk2
| ssItem(sk5) ),
co1_9 ).
cnf(c_0_32,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| hd(app(X2,X1)) = hd(X2)
| nil = X2 ),
c_0_26 ).
cnf(c_0_33,negated_conjecture,
( nil = sk4
| app(cons(sk5,nil),sk6) = sk4 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_28]) ).
cnf(c_0_34,negated_conjecture,
( ssList(sk6)
| nil = sk4 ),
inference(rw,[status(thm)],[c_0_29,c_0_28]) ).
cnf(c_0_35,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_36,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_37,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
c_0_30 ).
cnf(c_0_38,axiom,
ssList(nil),
clause8 ).
cnf(c_0_39,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
inference(rw,[status(thm)],[c_0_31,c_0_28]) ).
cnf(c_0_40,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_41,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| nil = sk4
| cons(sk5,nil) = nil
| hd(cons(sk5,nil)) = hd(sk4) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_42,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_35 ).
cnf(c_0_43,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| hd(sk4) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(sk4) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| sk3 = X1 ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_44,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
c_0_36 ).
cnf(c_0_45,negated_conjecture,
( nil = sk4
| cons(sk5,app(nil,sk6)) = sk4 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_37]),c_0_38])]),c_0_34]),c_0_39]) ).
cnf(c_0_46,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_47,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
c_0_40 ).
cnf(c_0_48,negated_conjecture,
( nil = sk4
| cons(sk5,nil) = nil
| hd(cons(sk5,nil)) = hd(sk4) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_38])]),c_0_39]) ).
cnf(c_0_49,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| hd(sk4) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(sk4) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| sk3 = X1 ),
c_0_43 ).
cnf(c_0_50,negated_conjecture,
( ~ ssList(app(nil,sk6))
| nil = sk4
| app(nil,sk6) = tl(sk4) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_39]) ).
cnf(c_0_51,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_46 ).
cnf(c_0_52,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_53,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ssItem(hd(sk4))
| nil = sk4
| cons(sk5,nil) = nil ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_54,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| cons(X4,nil) != X3
| app(X2,X3) != X1
| hd(sk4) != X4
| tl(sk4) != X2
| sk3 = X1 ),
inference(cn,[status(thm)],[c_0_49]) ).
cnf(c_0_55,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_56,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_57,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_58,negated_conjecture,
( nil = sk4
| app(nil,sk6) = tl(sk4) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_38])]),c_0_34]) ).
cnf(c_0_59,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_52 ).
cnf(c_0_60,negated_conjecture,
( ssItem(hd(sk4))
| nil = sk4
| cons(sk5,nil) = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_42]),c_0_38])]),c_0_39]) ).
cnf(c_0_61,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_62,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ ssList(cons(hd(sk4),nil))
| ~ ssItem(hd(sk4))
| ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| app(tl(sk4),cons(hd(sk4),nil)) = sk1 ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55])])])])]),c_0_51]) ).
cnf(c_0_63,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_56 ).
cnf(c_0_64,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_57,c_0_28]) ).
cnf(c_0_65,negated_conjecture,
( ssList(tl(sk4))
| nil = sk4 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_58]),c_0_38])]),c_0_34]) ).
cnf(c_0_66,negated_conjecture,
( ssItem(hd(sk4))
| nil = sk4 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_38])]),c_0_39]) ).
cnf(c_0_67,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause97]) ).
cnf(c_0_68,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_61 ).
cnf(c_0_69,negated_conjecture,
( ~ ssList(cons(hd(sk4),nil))
| ~ neq(sk4,nil)
| nil = sk4
| app(tl(sk4),cons(hd(sk4),nil)) = sk1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_38]),c_0_64])]),c_0_65]),c_0_66]) ).
cnf(c_0_70,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
c_0_67 ).
cnf(c_0_71,negated_conjecture,
( nil = sk4
| cons(sk5,sk6) = sk4 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_68]),c_0_34]),c_0_39]) ).
cnf(c_0_72,negated_conjecture,
( ~ ssList(cons(hd(sk4),nil))
| nil = sk4
| app(tl(sk4),cons(hd(sk4),nil)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_63]),c_0_64]),c_0_38])]) ).
cnf(c_0_73,negated_conjecture,
( nil = sk4
| hd(sk4) = sk5 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_34]),c_0_39]) ).
cnf(c_0_74,negated_conjecture,
( app(sk6,cons(sk5,nil)) != sk1
| nil = sk2 ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_75,negated_conjecture,
( nil != sk4
| nil = sk3 ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_76,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| nil = sk4
| app(tl(sk4),cons(sk5,nil)) = sk1 ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_77,negated_conjecture,
( app(sk6,cons(sk5,nil)) != sk1
| nil = sk2 ),
c_0_74 ).
cnf(c_0_78,negated_conjecture,
( nil != sk1
| app(cons(sk5,nil),sk6) = sk2 ),
inference(fof_simplification,[status(thm)],[co1_15]) ).
cnf(c_0_79,negated_conjecture,
( nil != sk4
| nil = sk3 ),
c_0_75 ).
cnf(c_0_80,negated_conjecture,
( nil = sk4
| app(tl(sk4),cons(sk5,nil)) = sk1 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_42]),c_0_38])]),c_0_39]) ).
cnf(c_0_81,negated_conjecture,
( nil = sk4
| tl(sk4) = sk6 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_71]),c_0_34]),c_0_39]) ).
cnf(c_0_82,negated_conjecture,
( app(sk6,cons(sk5,nil)) != sk1
| nil = sk4 ),
inference(rw,[status(thm)],[c_0_77,c_0_28]) ).
cnf(c_0_83,negated_conjecture,
( nil != sk1
| app(cons(sk5,nil),sk6) = sk2 ),
c_0_78 ).
cnf(c_0_84,negated_conjecture,
( nil != sk4
| nil = sk1 ),
inference(rw,[status(thm)],[c_0_79,c_0_55]) ).
cnf(c_0_85,negated_conjecture,
nil = sk4,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_82]) ).
cnf(c_0_86,negated_conjecture,
( nil != sk1
| ssItem(sk5) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_87,negated_conjecture,
( nil != sk1
| ssList(sk6) ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_88,negated_conjecture,
( nil != sk1
| app(cons(sk5,nil),sk6) = sk4 ),
inference(rw,[status(thm)],[c_0_83,c_0_28]) ).
cnf(c_0_89,negated_conjecture,
sk4 = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_85]),c_0_85])]) ).
cnf(c_0_90,negated_conjecture,
( nil != sk1
| ssItem(sk5) ),
c_0_86 ).
cnf(c_0_91,negated_conjecture,
( nil != sk1
| ssList(sk6) ),
c_0_87 ).
cnf(c_0_92,negated_conjecture,
app(cons(sk5,sk1),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)],[c_0_88,c_0_85]),c_0_85]),c_0_89]),c_0_89]),c_0_89])]) ).
cnf(c_0_93,negated_conjecture,
ssItem(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_90,c_0_85]),c_0_89])]) ).
cnf(c_0_94,negated_conjecture,
ssList(sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_85]),c_0_89])]) ).
cnf(c_0_95,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_96,negated_conjecture,
cons(sk5,app(sk1,sk6)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_92]),c_0_93]),c_0_94]),c_0_95])]) ).
cnf(c_0_97,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
inference(fof_simplification,[status(thm)],[clause138]) ).
cnf(c_0_98,negated_conjecture,
( ~ ssList(app(sk1,sk6))
| app(sk1,sk6) = tl(sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_96]),c_0_93])]) ).
cnf(c_0_99,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_100,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
c_0_97 ).
cnf(c_0_101,negated_conjecture,
app(sk1,sk6) = tl(sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_51]),c_0_95]),c_0_94])]) ).
cnf(c_0_102,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
c_0_99 ).
cnf(c_0_103,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| memberP(cons(X1,X2),X1) ),
inference(er,[status(thm)],[c_0_100]) ).
cnf(c_0_104,negated_conjecture,
cons(sk5,tl(sk1)) = sk1,
inference(rw,[status(thm)],[c_0_96,c_0_101]) ).
cnf(c_0_105,negated_conjecture,
ssList(tl(sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_101]),c_0_95]),c_0_94])]) ).
cnf(c_0_106,plain,
( ~ ssItem(X1)
| ~ memberP(sk1,X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_102,c_0_85]),c_0_89]) ).
cnf(c_0_107,negated_conjecture,
memberP(sk1,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_93]),c_0_105])]) ).
cnf(c_0_108,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_107]),c_0_93])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC314-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n005.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 08:14:48 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 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
% 0.12/0.56 % Version: 3.5.1
% 0.12/0.56 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.12/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.56 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.12/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.56 % Starting sh5l with 300s (1) cores
% 0.12/0.56 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2990323 completed with status 0
% 0.12/0.56 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.12/0.56 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.12/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.56 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.12/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.56 % No SInE strategy applied
% 0.12/0.56 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.12/0.56 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.56 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.12/0.56 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.12/0.56 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.12/0.56 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.12/0.56 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 2990331 completed with status 0
% 0.12/0.56 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.12/0.56 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.12/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.56 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.12/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.56 % No SInE strategy applied
% 0.12/0.56 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.12/0.56 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.56 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.12/0.56 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.12/0.56 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.12/0.56 % Preprocessing time : 0.005 s
% 0.12/0.56
% 0.12/0.56 % Proof found!
% 0.12/0.56 % SZS status Unsatisfiable
% 0.12/0.56 % SZS output start CNFRefutation
% See solution above
% 0.12/0.56 % Parsed axioms : 201
% 0.12/0.56 % Removed by relevancy pruning/SinE : 0
% 0.12/0.56 % Initial clauses : 201
% 0.12/0.56 % Removed in clause preprocessing : 0
% 0.12/0.56 % Initial clauses in saturation : 201
% 0.12/0.56 % Processed clauses : 493
% 0.12/0.56 % ...of these trivial : 5
% 0.12/0.56 % ...subsumed : 110
% 0.12/0.56 % ...remaining for further processing : 378
% 0.12/0.56 % Other redundant clauses eliminated : 62
% 0.12/0.56 % Clauses deleted for lack of memory : 0
% 0.12/0.56 % Backward-subsumed : 20
% 0.12/0.56 % Backward-rewritten : 137
% 0.12/0.56 % Generated clauses : 1450
% 0.12/0.56 % ...of the previous two non-redundant : 1353
% 0.12/0.56 % ...aggressively subsumed : 0
% 0.12/0.56 % Contextual simplify-reflections : 87
% 0.12/0.56 % Paramodulations : 1387
% 0.12/0.56 % Factorizations : 0
% 0.12/0.56 % NegExts : 0
% 0.12/0.56 % Equation resolutions : 67
% 0.12/0.56 % Disequality decompositions : 0
% 0.12/0.56 % Total rewrite steps : 1377
% 0.12/0.56 % ...of those cached : 1286
% 0.12/0.56 % Propositional unsat checks : 0
% 0.12/0.56 % Propositional check models : 0
% 0.12/0.56 % Propositional check unsatisfiable : 0
% 0.12/0.56 % Propositional clauses : 0
% 0.12/0.56 % Propositional clauses after purity: 0
% 0.12/0.56 % Propositional unsat core size : 0
% 0.12/0.56 % Propositional preprocessing time : 0.000
% 0.12/0.56 % Propositional encoding time : 0.000
% 0.12/0.56 % Propositional solver time : 0.000
% 0.12/0.56 % Success case prop preproc time : 0.000
% 0.12/0.56 % Success case prop encoding time : 0.000
% 0.12/0.56 % Success case prop solver time : 0.000
% 0.12/0.56 % Current number of processed clauses : 197
% 0.12/0.56 % Positive orientable unit clauses : 70
% 0.12/0.56 % Positive unorientable unit clauses: 0
% 0.12/0.56 % Negative unit clauses : 5
% 0.12/0.56 % Non-unit-clauses : 122
% 0.12/0.56 % Current number of unprocessed clauses: 1032
% 0.12/0.56 % ...number of literals in the above : 6101
% 0.12/0.56 % Current number of archived formulas : 0
% 0.12/0.56 % Current number of archived clauses : 157
% 0.12/0.56 % Clause-clause subsumption calls (NU) : 14896
% 0.12/0.56 % Rec. Clause-clause subsumption calls : 2650
% 0.12/0.56 % Non-unit clause-clause subsumptions : 200
% 0.12/0.56 % Unit Clause-clause subsumption calls : 217
% 0.12/0.56 % Rewrite failures with RHS unbound : 0
% 0.12/0.56 % BW rewrite match attempts : 7
% 0.12/0.56 % BW rewrite match successes : 7
% 0.12/0.56 % Condensation attempts : 0
% 0.12/0.56 % Condensation successes : 0
% 0.12/0.56 % Termbank termtop insertions : 36658
% 0.12/0.56 % Search garbage collected termcells : 562
% 0.12/0.56
% 0.12/0.56 % -------------------------------------------------
% 0.12/0.56 % User time : 0.099 s
% 0.12/0.56 % System time : 0.012 s
% 0.12/0.56 % Total time : 0.111 s
% 0.12/0.56 % Maximum resident set size: 4072 pages
% 0.12/0.56
% 0.12/0.56 % -------------------------------------------------
% 0.12/0.56 % User time : 0.346 s
% 0.12/0.56 % System time : 0.033 s
% 0.12/0.56 % Total time : 0.379 s
% 0.12/0.56 % Maximum resident set size: 5120 pages
% 0.12/0.56 % E exiting
%------------------------------------------------------------------------------