%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC396-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:44:14 PM UTC 2026
% Result : Unsatisfiable 0.23s 5.70s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 24
% Syntax : Number of clauses : 100 ( 22 unt; 44 nHn; 100 RR)
% Number of literals : 325 ( 115 equ; 189 neg)
% Maximal clause size : 12 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 104 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_12,negated_conjecture,
( ~ neq(nil,sk3)
| ~ neq(nil,sk3)
| hd(sk3) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(sk3) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(sk4,nil)
| sk4 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
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_10,negated_conjecture,
( nil != sk4
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
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(clause76,axiom,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause75,axiom,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause133,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| tl(app(X2,X1)) = app(tl(X2),X1)
| nil = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause133) ).
cnf(clause104,axiom,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).
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(clause118,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(clause140,axiom,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause140) ).
cnf(co1_8,negated_conjecture,
memberP(sk1,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
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(co1_9,negated_conjecture,
~ memberP(sk2,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
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(co1_11,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk3,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(clause115,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(c_0_24,negated_conjecture,
( ~ neq(nil,sk3)
| ~ neq(nil,sk3)
| hd(sk3) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(sk3) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(sk4,nil)
| sk4 = X1 ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_25,negated_conjecture,
( ~ neq(nil,sk3)
| ~ neq(nil,sk3)
| hd(sk3) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(sk3) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(sk4,nil)
| sk4 = X1 ),
c_0_24 ).
cnf(c_0_26,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_27,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk3)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| cons(X4,nil) != X3
| app(X2,X3) != X1
| hd(sk3) != X4
| tl(sk3) != X2
| sk4 = X1 ),
inference(cn,[status(thm)],[c_0_25]) ).
cnf(c_0_28,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_29,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_26 ).
cnf(c_0_30,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_31,negated_conjecture,
( nil != sk4
| nil = sk3 ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_32,negated_conjecture,
( ~ ssList(tl(sk1))
| ~ ssList(cons(hd(sk1),nil))
| ~ ssItem(hd(sk1))
| ~ neq(sk4,nil)
| ~ neq(nil,sk1)
| app(tl(sk1),cons(hd(sk1),nil)) = sk4 ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_28]),c_0_28])])])])]),c_0_29]) ).
cnf(c_0_33,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_30 ).
cnf(c_0_34,axiom,
ssList(nil),
clause8 ).
cnf(c_0_35,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_36,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_37,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_38,negated_conjecture,
( nil != sk4
| nil = sk3 ),
c_0_31 ).
cnf(c_0_39,negated_conjecture,
( ~ ssList(tl(sk1))
| ~ ssList(cons(hd(sk1),nil))
| ~ ssItem(hd(sk1))
| ~ neq(sk4,nil)
| nil = sk1
| app(tl(sk1),cons(hd(sk1),nil)) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35])]) ).
cnf(c_0_40,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
( nil != sk4
| nil = sk1 ),
inference(rw,[status(thm)],[c_0_38,c_0_28]) ).
cnf(c_0_42,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_43,negated_conjecture,
( ~ ssList(tl(sk1))
| ~ ssList(cons(hd(sk1),nil))
| ~ ssItem(hd(sk1))
| nil = sk1
| app(tl(sk1),cons(hd(sk1),nil)) = sk4 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_33]),c_0_40]),c_0_34])]),c_0_41]) ).
cnf(c_0_44,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
c_0_42 ).
cnf(c_0_45,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_46,negated_conjecture,
( ~ ssList(tl(sk1))
| ~ ssList(cons(hd(sk1),nil))
| nil = sk1
| app(tl(sk1),cons(hd(sk1),nil)) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_35])]) ).
cnf(c_0_47,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
c_0_45 ).
cnf(c_0_48,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_49,negated_conjecture,
( ~ ssList(cons(hd(sk1),nil))
| nil = sk1
| app(tl(sk1),cons(hd(sk1),nil)) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_35])]) ).
cnf(c_0_50,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_48 ).
cnf(c_0_51,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| tl(app(X2,X1)) = app(tl(X2),X1)
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause133]) ).
cnf(c_0_52,negated_conjecture,
( ~ ssItem(hd(sk1))
| nil = sk1
| app(tl(sk1),cons(hd(sk1),nil)) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_34])]) ).
cnf(c_0_53,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| tl(app(X2,X1)) = app(tl(X2),X1)
| nil = X2 ),
c_0_51 ).
cnf(c_0_54,negated_conjecture,
( nil = sk1
| app(tl(sk1),cons(hd(sk1),nil)) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_44]),c_0_35])]) ).
cnf(c_0_55,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_56,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| hd(app(X2,X1)) = hd(X2)
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause123]) ).
cnf(c_0_57,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_58,negated_conjecture,
( ~ ssList(cons(hd(sk1),nil))
| nil = sk1
| tl(app(sk1,cons(hd(sk1),nil))) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_35])]) ).
cnf(c_0_59,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
c_0_55 ).
cnf(c_0_60,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| hd(app(X2,X1)) = hd(X2)
| nil = X2 ),
c_0_56 ).
cnf(c_0_61,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
c_0_57 ).
cnf(c_0_62,negated_conjecture,
( ~ ssItem(hd(sk1))
| nil = sk1
| tl(app(sk1,cons(hd(sk1),nil))) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_50]),c_0_34])]) ).
cnf(c_0_63,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(app(X1,X2))) = app(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_29]),c_0_61]) ).
cnf(c_0_64,negated_conjecture,
( nil = sk1
| tl(app(sk1,cons(hd(sk1),nil))) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_44]),c_0_35])]) ).
cnf(c_0_65,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
inference(fof_simplification,[status(thm)],[clause140]) ).
cnf(c_0_66,negated_conjecture,
( ~ ssList(cons(hd(sk1),nil))
| nil = sk1
| app(sk1,cons(hd(sk1),nil)) = cons(hd(sk1),sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_35])]) ).
cnf(c_0_67,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
c_0_65 ).
cnf(c_0_68,negated_conjecture,
memberP(sk1,sk5),
co1_8 ).
cnf(c_0_69,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_70,negated_conjecture,
( ~ ssItem(hd(sk1))
| nil = sk1
| app(sk1,cons(hd(sk1),nil)) = cons(hd(sk1),sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_50]),c_0_34])]) ).
cnf(c_0_71,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_72,negated_conjecture,
( ~ ssList(X1)
| memberP(app(sk1,X1),sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]),c_0_35])]) ).
cnf(c_0_73,negated_conjecture,
( nil = sk1
| app(sk1,cons(hd(sk1),nil)) = cons(hd(sk1),sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_44]),c_0_35])]) ).
cnf(c_0_74,plain,
( ~ ssList(X4)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(X1,cons(X2,X3)) != X4
| memberP(X4,X2) ),
c_0_71 ).
cnf(c_0_75,negated_conjecture,
( ~ ssList(cons(hd(sk1),nil))
| memberP(cons(hd(sk1),sk4),sk5)
| nil = sk1 ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_76,negated_conjecture,
~ memberP(sk2,sk5),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_77,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(app(X1,cons(X2,X3)))
| ~ ssItem(X2)
| memberP(app(X1,cons(X2,X3)),X2) ),
inference(er,[status(thm)],[c_0_74]) ).
cnf(c_0_78,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_79,negated_conjecture,
( ~ ssItem(hd(sk1))
| memberP(cons(hd(sk1),sk4),sk5)
| nil = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_50]),c_0_34])]) ).
cnf(c_0_80,negated_conjecture,
~ memberP(sk2,sk5),
c_0_76 ).
cnf(c_0_81,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk3,nil) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_82,negated_conjecture,
( ~ ssList(tl(sk1))
| ~ ssItem(hd(sk1))
| memberP(sk4,hd(sk1))
| nil = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_54]),c_0_40]),c_0_34])]) ).
cnf(c_0_83,plain,
( ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ memberP(cons(X1,X2),X3)
| X3 = X1
| memberP(X2,X3) ),
c_0_78 ).
cnf(c_0_84,negated_conjecture,
( memberP(cons(hd(sk1),sk4),sk5)
| nil = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_44]),c_0_35])]) ).
cnf(c_0_85,negated_conjecture,
~ memberP(sk4,sk5),
inference(rw,[status(thm)],[c_0_80,c_0_37]) ).
cnf(c_0_86,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk3,nil) ),
c_0_81 ).
cnf(c_0_87,negated_conjecture,
( ~ ssList(tl(sk1))
| memberP(sk4,hd(sk1))
| nil = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_44]),c_0_35])]) ).
cnf(c_0_88,negated_conjecture,
( ~ ssItem(hd(sk1))
| nil = sk1
| hd(sk1) = sk5 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_69]),c_0_40])]),c_0_85]) ).
cnf(c_0_89,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_90,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk1,nil) ),
inference(rw,[status(thm)],[c_0_86,c_0_28]) ).
cnf(c_0_91,negated_conjecture,
( memberP(sk4,hd(sk1))
| nil = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_47]),c_0_35])]) ).
cnf(c_0_92,negated_conjecture,
( nil = sk1
| hd(sk1) = sk5 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_44]),c_0_35])]) ).
cnf(c_0_93,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_89 ).
cnf(c_0_94,negated_conjecture,
( neq(sk1,nil)
| nil = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_33]),c_0_40]),c_0_34])]) ).
cnf(c_0_95,negated_conjecture,
nil = sk1,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_85]) ).
cnf(c_0_96,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_93]) ).
cnf(c_0_97,negated_conjecture,
( neq(sk1,sk1)
| sk4 = sk1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_94,c_0_95]),c_0_95]) ).
cnf(c_0_98,negated_conjecture,
sk4 = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_35])]) ).
cnf(c_0_99,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_98]),c_0_68])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC396-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/5.45 % Computer : n005.cluster.edu
% 0.18/5.45 % Model : x86_64 x86_64
% 0.18/5.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/5.45 % Memory : 8046.5625MB
% 0.18/5.45 % OS : Linux 6.8.0-71-generic
% 0.18/5.45 % CPULimit : 300
% 0.18/5.45 % WCLimit : 300
% 0.18/5.45 % DateTime : Mon Sep 21 08:21:09 UTC 2026
% 0.18/5.45 % CPUTime :
% 0.18/5.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/5.52 Running first-order theorem proving
% 0.23/5.52 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.23/5.70 % Version: 3.5.1
% 0.23/5.70 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/5.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.70 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/5.70 % Starting new_bool_3 with 300s (1) cores
% 0.23/5.70 % Starting new_bool_1 with 300s (1) cores
% 0.23/5.70 % Starting sh5l with 300s (1) cores
% 0.23/5.70 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3004695 completed with status 0
% 0.23/5.70 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.23/5.70 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/5.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.70 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/5.70 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/5.70 % No SInE strategy applied
% 0.23/5.70 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.23/5.70 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/5.70 % Starting SubtermCWHack with 136s (1) cores
% 0.23/5.70 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.23/5.70 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.23/5.70 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.23/5.70 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.23/5.70 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 3004705 completed with status 0
% 0.23/5.70 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.23/5.70 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/5.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.70 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/5.70 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/5.70 % No SInE strategy applied
% 0.23/5.70 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.23/5.70 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/5.70 % Starting SubtermCWHack with 136s (1) cores
% 0.23/5.70 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.23/5.70 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.23/5.70 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.23/5.70 % Preprocessing time : 0.003 s
% 0.23/5.70
% 0.23/5.70 % Proof found!
% 0.23/5.70 % SZS status Unsatisfiable
% 0.23/5.70 % SZS output start CNFRefutation
% See solution above
% 0.23/5.70 % Parsed axioms : 197
% 0.23/5.70 % Removed by relevancy pruning/SinE : 0
% 0.23/5.70 % Initial clauses : 197
% 0.23/5.70 % Removed in clause preprocessing : 0
% 0.23/5.70 % Initial clauses in saturation : 197
% 0.23/5.70 % Processed clauses : 885
% 0.23/5.70 % ...of these trivial : 2
% 0.23/5.70 % ...subsumed : 345
% 0.23/5.70 % ...remaining for further processing : 538
% 0.23/5.70 % Other redundant clauses eliminated : 126
% 0.23/5.70 % Clauses deleted for lack of memory : 0
% 0.23/5.70 % Backward-subsumed : 65
% 0.23/5.70 % Backward-rewritten : 237
% 0.23/5.70 % Generated clauses : 3291
% 0.23/5.70 % ...of the previous two non-redundant : 3107
% 0.23/5.70 % ...aggressively subsumed : 0
% 0.23/5.70 % Contextual simplify-reflections : 75
% 0.23/5.70 % Paramodulations : 3162
% 0.23/5.70 % Factorizations : 0
% 0.23/5.70 % NegExts : 0
% 0.23/5.70 % Equation resolutions : 133
% 0.23/5.70 % Disequality decompositions : 0
% 0.23/5.70 % Total rewrite steps : 2447
% 0.23/5.70 % ...of those cached : 2356
% 0.23/5.70 % Propositional unsat checks : 0
% 0.23/5.70 % Propositional check models : 0
% 0.23/5.70 % Propositional check unsatisfiable : 0
% 0.23/5.70 % Propositional clauses : 0
% 0.23/5.70 % Propositional clauses after purity: 0
% 0.23/5.70 % Propositional unsat core size : 0
% 0.23/5.70 % Propositional preprocessing time : 0.000
% 0.23/5.70 % Propositional encoding time : 0.000
% 0.23/5.70 % Propositional solver time : 0.000
% 0.23/5.70 % Success case prop preproc time : 0.000
% 0.23/5.70 % Success case prop encoding time : 0.000
% 0.23/5.70 % Success case prop solver time : 0.000
% 0.23/5.70 % Current number of processed clauses : 212
% 0.23/5.70 % Positive orientable unit clauses : 57
% 0.23/5.70 % Positive unorientable unit clauses: 0
% 0.23/5.70 % Negative unit clauses : 2
% 0.23/5.70 % Non-unit-clauses : 153
% 0.23/5.70 % Current number of unprocessed clauses: 2233
% 0.23/5.70 % ...number of literals in the above : 12689
% 0.23/5.70 % Current number of archived formulas : 0
% 0.23/5.70 % Current number of archived clauses : 302
% 0.23/5.70 % Clause-clause subsumption calls (NU) : 28995
% 0.23/5.70 % Rec. Clause-clause subsumption calls : 6208
% 0.23/5.70 % Non-unit clause-clause subsumptions : 421
% 0.23/5.70 % Unit Clause-clause subsumption calls : 121
% 0.23/5.70 % Rewrite failures with RHS unbound : 0
% 0.23/5.70 % BW rewrite match attempts : 4
% 0.23/5.70 % BW rewrite match successes : 4
% 0.23/5.70 % Condensation attempts : 0
% 0.23/5.70 % Condensation successes : 0
% 0.23/5.70 % Termbank termtop insertions : 67572
% 0.23/5.70 % Search garbage collected termcells : 556
% 0.23/5.70
% 0.23/5.70 % -------------------------------------------------
% 0.23/5.70 % User time : 0.105 s
% 0.23/5.70 % System time : 0.011 s
% 0.23/5.70 % Total time : 0.116 s
% 0.23/5.70 % Maximum resident set size: 4016 pages
% 0.23/5.70
% 0.23/5.70 % -------------------------------------------------
% 0.23/5.70 % User time : 0.458 s
% 0.23/5.70 % System time : 0.050 s
% 0.23/5.70 % Total time : 0.508 s
% 0.23/5.70 % Maximum resident set size: 5120 pages
% 0.23/5.70 % E exiting
%------------------------------------------------------------------------------