%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC237-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:43:35 PM UTC 2026
% Result : Unsatisfiable 11.05s 2.16s
% Output : CNFRefutation 11.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 28
% Syntax : Number of clauses : 111 ( 31 unt; 24 nHn; 100 RR)
% Number of literals : 298 ( 98 equ; 180 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-3 aty)
% Number of variables : 152 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause123,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| hd(app(X2,X1)) = hd(X2)
| nil = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause123) ).
cnf(co1_14,negated_conjecture,
app(sk3,sk6) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
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(clause118,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(clause75,axiom,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause133,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| tl(app(X2,X1)) = app(tl(X2),X1)
| nil = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause133) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause149,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(clause179,axiom,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(clause104,axiom,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause76,axiom,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_13,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
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(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause150,axiom,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != app(X1,X3)
| X2 = X3 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause150) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause72,axiom,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause157,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause71,axiom,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(co1_9,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| memberP(X2,sk5(X3,X2,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause120,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause109,axiom,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause13) ).
cnf(c_0_28,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| hd(app(X2,X1)) = hd(X2)
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause123]) ).
cnf(c_0_29,negated_conjecture,
app(sk3,sk6) = sk4,
co1_14 ).
cnf(c_0_30,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_31,negated_conjecture,
nil != sk1,
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_34,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| tl(app(X2,X1)) = app(tl(X2),X1)
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause133]) ).
cnf(c_0_35,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_36,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_37,plain,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
inference(fof_simplification,[status(thm)],[clause179]) ).
cnf(c_0_38,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_39,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_40,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| hd(app(X2,X1)) = hd(X2)
| nil = X2 ),
c_0_28 ).
cnf(c_0_41,negated_conjecture,
app(sk1,sk6) = sk4,
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_42,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_43,negated_conjecture,
ssList(sk6),
co1_13 ).
cnf(c_0_44,negated_conjecture,
nil != sk1,
c_0_31 ).
cnf(c_0_45,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_46,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_47,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
c_0_32 ).
cnf(c_0_48,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
c_0_33 ).
cnf(c_0_49,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| tl(app(X2,X1)) = app(tl(X2),X1)
| nil = X2 ),
c_0_34 ).
cnf(c_0_50,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_35 ).
cnf(c_0_51,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_36 ).
cnf(c_0_52,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_53,plain,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
c_0_37 ).
cnf(c_0_54,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
c_0_38 ).
cnf(c_0_55,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
c_0_39 ).
cnf(c_0_56,negated_conjecture,
hd(sk4) = hd(sk1),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_43])]),c_0_44]) ).
cnf(c_0_57,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_58,negated_conjecture,
sk4 != nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_41]),c_0_43]),c_0_42])]),c_0_44]) ).
cnf(c_0_59,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(tl(X1),X2))
| nil = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_47]) ).
cnf(c_0_60,negated_conjecture,
app(tl(sk1),sk6) = tl(sk4),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_41]),c_0_42]),c_0_43])]),c_0_44]) ).
cnf(c_0_61,negated_conjecture,
( ~ ssList(X1)
| app(sk1,app(sk6,X1)) = app(sk4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_41]),c_0_42]),c_0_43])]) ).
cnf(c_0_62,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != app(X1,X3)
| X2 = X3 ),
inference(fof_simplification,[status(thm)],[clause150]) ).
cnf(c_0_63,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_52 ).
cnf(c_0_64,axiom,
ssList(nil),
clause8 ).
cnf(c_0_65,plain,
( ~ duplicatefreeP(X4)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X2,cons(hd(X1),X3)),X1) != X4
| nil = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_48]),c_0_55]) ).
cnf(c_0_66,negated_conjecture,
cons(hd(sk1),tl(sk4)) = sk4,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_56]),c_0_57])]),c_0_58]) ).
cnf(c_0_67,negated_conjecture,
ssList(tl(sk4)),
inference(sr,[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_42]),c_0_43])]),c_0_44]) ).
cnf(c_0_68,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_69,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_70,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(app(sk6,X1))
| ssList(app(sk4,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_61]),c_0_42])]) ).
cnf(c_0_71,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != app(X1,X3)
| X2 = X3 ),
c_0_62 ).
cnf(c_0_72,negated_conjecture,
app(sk4,nil) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_63]),c_0_41]),c_0_64]),c_0_43])]) ).
cnf(c_0_73,negated_conjecture,
( ~ duplicatefreeP(X2)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,sk4),sk1) != X2 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]),c_0_42])]),c_0_44]) ).
cnf(c_0_74,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_68 ).
cnf(c_0_75,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
c_0_69 ).
cnf(c_0_76,negated_conjecture,
( ~ ssList(X1)
| ssList(app(sk4,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_50]),c_0_43])]) ).
cnf(c_0_77,negated_conjecture,
( ~ ssList(X1)
| app(sk4,X1) != sk4
| nil = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_64]),c_0_57])]) ).
cnf(c_0_78,negated_conjecture,
( ~ ssList(X1)
| app(sk4,app(nil,X1)) = app(sk4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_72]),c_0_57]),c_0_64])]) ).
cnf(c_0_79,negated_conjecture,
( ~ duplicatefreeP(X1)
| ~ ssList(X1)
| app(sk4,sk1) != X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_64]),c_0_57])]) ).
cnf(c_0_80,negated_conjecture,
( ~ ssList(X2)
| duplicatefreeP(app(sk4,X2))
| ssItem(X1) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_81,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_82,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_83,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(app(nil,X1))
| app(sk4,X1) != sk4
| app(nil,X1) = nil ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_84,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_85,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| memberP(X2,sk5(X3,X2,X1)) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_86,negated_conjecture,
( ~ duplicatefreeP(app(sk4,sk1))
| ~ ssList(app(sk4,sk1)) ),
inference(er,[status(thm)],[c_0_79]) ).
cnf(c_0_87,negated_conjecture,
( duplicatefreeP(app(sk4,sk1))
| ssItem(X1) ),
inference(spm,[status(thm)],[c_0_80,c_0_42]) ).
cnf(c_0_88,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
c_0_81 ).
cnf(c_0_89,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_82 ).
cnf(c_0_90,negated_conjecture,
( ~ ssList(app(nil,nil))
| app(nil,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_63]),c_0_64]),c_0_57])]) ).
cnf(c_0_91,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
c_0_84 ).
cnf(c_0_92,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| memberP(X2,sk5(X3,X2,X1)) ),
c_0_85 ).
cnf(c_0_93,negated_conjecture,
( ~ ssList(app(sk4,sk1))
| ssItem(X1) ),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_94,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1)
| ssList(cons(X1,app(X2,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_88]),c_0_89]) ).
cnf(c_0_95,negated_conjecture,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_50]),c_0_64])]) ).
cnf(c_0_96,negated_conjecture,
( ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(sk5(X2,nil,X1))
| app(app(nil,cons(X1,nil)),X2) != sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_64])]) ).
cnf(c_0_97,negated_conjecture,
ssItem(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_50]),c_0_57]),c_0_42])]) ).
cnf(c_0_98,negated_conjecture,
( ~ ssItem(X1)
| ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_64])]) ).
cnf(c_0_99,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_100,negated_conjecture,
( ~ ssList(X2)
| app(app(nil,cons(X1,nil)),X2) != sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_97]),c_0_97])]) ).
cnf(c_0_101,negated_conjecture,
ssList(cons(X1,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_97])]) ).
cnf(c_0_102,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_99 ).
cnf(c_0_103,negated_conjecture,
( ~ ssList(X2)
| app(cons(X1,nil),X2) != sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_74]),c_0_101])]) ).
cnf(c_0_104,plain,
( ~ ssList(X2)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_102,c_0_97])]) ).
cnf(c_0_105,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_106,negated_conjecture,
( ~ ssList(X2)
| cons(X1,X2) != sk1 ),
inference(spm,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_107,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
c_0_105 ).
cnf(c_0_108,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_109,negated_conjecture,
( ~ ssList(X1)
| X1 != sk1
| nil = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_107]),c_0_108])]) ).
cnf(c_0_110,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_42]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC237-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.44 % Computer : n026.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Mon Sep 21 08:10:21 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/0.51 Running first-order theorem proving
% 0.26/0.51 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 11.05/2.16 % Version: 3.5.1
% 11.05/2.16 % Preprocessing class: FSLSSMSMSSSNFFN.
% 11.05/2.16 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.05/2.16 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 11.05/2.16 % Starting new_bool_3 with 300s (1) cores
% 11.05/2.16 % Starting new_bool_1 with 300s (1) cores
% 11.05/2.16 % Starting sh5l with 300s (1) cores
% 11.05/2.16 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1803023 completed with status 0
% 11.05/2.16 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 11.05/2.16 % Preprocessing class: FSLSSMSMSSSNFFN.
% 11.05/2.16 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.05/2.16 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 11.05/2.16 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.05/2.16 % No SInE strategy applied
% 11.05/2.16 % Search class: FGHSM-FSLM31-MFFFFFNN
% 11.05/2.16 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 11.05/2.16 % Starting SubtermCWHack with 136s (1) cores
% 11.05/2.16 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 11.05/2.16 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 11.05/2.16 % Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 11.05/2.16 % Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 11.05/2.16 % G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with pid 1803033 completed with status 0
% 11.05/2.16 % Result found by G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y
% 11.05/2.16 % Preprocessing class: FSLSSMSMSSSNFFN.
% 11.05/2.16 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.05/2.16 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 11.05/2.16 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.05/2.16 % No SInE strategy applied
% 11.05/2.16 % Search class: FGHSM-FSLM31-MFFFFFNN
% 11.05/2.16 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 11.05/2.16 % Starting SubtermCWHack with 136s (1) cores
% 11.05/2.16 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 11.05/2.16 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 11.05/2.16 % Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 11.05/2.16 % Preprocessing time : 0.005 s
% 11.05/2.16 % Presaturation interreduction done
% 11.05/2.16
% 11.05/2.16 % Proof found!
% 11.05/2.16 % SZS status Unsatisfiable
% 11.05/2.16 % SZS output start CNFRefutation
% See solution above
% 11.05/2.16 % Parsed axioms : 202
% 11.05/2.16 % Removed by relevancy pruning/SinE : 0
% 11.05/2.16 % Initial clauses : 202
% 11.05/2.16 % Removed in clause preprocessing : 0
% 11.05/2.16 % Initial clauses in saturation : 202
% 11.05/2.16 % Processed clauses : 5798
% 11.05/2.16 % ...of these trivial : 61
% 11.05/2.16 % ...subsumed : 3464
% 11.05/2.16 % ...remaining for further processing : 2273
% 11.05/2.16 % Other redundant clauses eliminated : 455
% 11.05/2.16 % Clauses deleted for lack of memory : 0
% 11.05/2.16 % Backward-subsumed : 729
% 11.05/2.16 % Backward-rewritten : 399
% 11.05/2.16 % Generated clauses : 28215
% 11.05/2.16 % ...of the previous two non-redundant : 26595
% 11.05/2.16 % ...aggressively subsumed : 0
% 11.05/2.16 % Contextual simplify-reflections : 221
% 11.05/2.16 % Paramodulations : 27642
% 11.05/2.16 % Factorizations : 0
% 11.05/2.16 % NegExts : 0
% 11.05/2.16 % Equation resolutions : 573
% 11.05/2.16 % Disequality decompositions : 0
% 11.05/2.16 % Total rewrite steps : 21122
% 11.05/2.16 % ...of those cached : 20710
% 11.05/2.16 % Propositional unsat checks : 0
% 11.05/2.16 % Propositional check models : 0
% 11.05/2.16 % Propositional check unsatisfiable : 0
% 11.05/2.16 % Propositional clauses : 0
% 11.05/2.16 % Propositional clauses after purity: 0
% 11.05/2.16 % Propositional unsat core size : 0
% 11.05/2.16 % Propositional preprocessing time : 0.000
% 11.05/2.16 % Propositional encoding time : 0.000
% 11.05/2.16 % Propositional solver time : 0.000
% 11.05/2.16 % Success case prop preproc time : 0.000
% 11.05/2.16 % Success case prop encoding time : 0.000
% 11.05/2.16 % Success case prop solver time : 0.000
% 11.05/2.16 % Current number of processed clauses : 945
% 11.05/2.16 % Positive orientable unit clauses : 103
% 11.05/2.16 % Positive unorientable unit clauses: 0
% 11.05/2.16 % Negative unit clauses : 61
% 11.05/2.16 % Non-unit-clauses : 781
% 11.05/2.16 % Current number of unprocessed clauses: 20899
% 11.05/2.16 % ...number of literals in the above : 128409
% 11.05/2.16 % Current number of archived formulas : 0
% 11.05/2.16 % Current number of archived clauses : 1323
% 11.05/2.16 % Clause-clause subsumption calls (NU) : 646551
% 11.05/2.16 % Rec. Clause-clause subsumption calls : 163853
% 11.05/2.16 % Non-unit clause-clause subsumptions : 2529
% 11.05/2.16 % Unit Clause-clause subsumption calls : 12563
% 11.05/2.16 % Rewrite failures with RHS unbound : 0
% 11.05/2.16 % BW rewrite match attempts : 62
% 11.05/2.16 % BW rewrite match successes : 48
% 11.05/2.16 % Condensation attempts : 0
% 11.05/2.16 % Condensation successes : 0
% 11.05/2.16 % Termbank termtop insertions : 478472
% 11.05/2.16 % Search garbage collected termcells : 567
% 11.05/2.16
% 11.05/2.16 % -------------------------------------------------
% 11.05/2.16 % User time : 1.542 s
% 11.05/2.16 % System time : 0.037 s
% 11.05/2.16 % Total time : 1.579 s
% 11.05/2.16 % Maximum resident set size: 4072 pages
% 11.05/2.16
% 11.05/2.16 % -------------------------------------------------
% 11.05/2.16 % User time : 7.661 s
% 11.05/2.16 % System time : 0.283 s
% 11.05/2.16 % Total time : 7.945 s
% 11.05/2.16 % Maximum resident set size: 4864 pages
% 11.05/2.16 % E exiting
%------------------------------------------------------------------------------