%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC421-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 : 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:46:17 PM UTC 2026
% Result : Unsatisfiable 0.63s 0.77s
% Output : CNFRefutation 0.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 27
% Syntax : Number of clauses : 113 ( 22 unt; 44 nHn; 109 RR)
% Number of literals : 346 ( 144 equ; 197 neg)
% Maximal clause size : 12 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 118 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_11,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_11) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
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(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(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(co1_8,negated_conjecture,
( app(app(X3,cons(X1,nil)),X2) != sk1
| app(app(X2,cons(X1,nil)),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
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(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(clause96,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause109,axiom,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause13) ).
cnf(clause97,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(co1_10,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk3,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
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_27,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_11]) ).
cnf(c_0_28,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_27 ).
cnf(c_0_29,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_30,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_31,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_32,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_28]) ).
cnf(c_0_33,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_34,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_31 ).
cnf(c_0_36,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_37,negated_conjecture,
( ~ ssList(tl(sk1))
| ~ ssList(cons(hd(sk1),nil))
| ~ ssItem(hd(sk1))
| ~ 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(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33]),c_0_33]),c_0_33]),c_0_34])])])])])]),c_0_35]) ).
cnf(c_0_38,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_36 ).
cnf(c_0_39,axiom,
ssList(nil),
clause8 ).
cnf(c_0_40,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_42,negated_conjecture,
( ~ ssList(tl(sk1))
| ~ ssList(cons(hd(sk1),nil))
| ~ ssItem(hd(sk1))
| 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_37,c_0_38]),c_0_39]),c_0_40])]) ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
c_0_41 ).
cnf(c_0_44,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_45,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_42,c_0_43]),c_0_40])]) ).
cnf(c_0_46,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
c_0_44 ).
cnf(c_0_47,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_48,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_45,c_0_46]),c_0_40])]) ).
cnf(c_0_49,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_47 ).
cnf(c_0_50,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| tl(app(X2,X1)) = app(tl(X2),X1)
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause133]) ).
cnf(c_0_51,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_48,c_0_49]),c_0_39])]) ).
cnf(c_0_52,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| tl(app(X2,X1)) = app(tl(X2),X1)
| nil = X2 ),
c_0_50 ).
cnf(c_0_53,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_51,c_0_43]),c_0_40])]) ).
cnf(c_0_54,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_55,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| hd(app(X2,X1)) = hd(X2)
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause123]) ).
cnf(c_0_56,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_57,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_52,c_0_53]),c_0_40])]) ).
cnf(c_0_58,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
c_0_54 ).
cnf(c_0_59,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| hd(app(X2,X1)) = hd(X2)
| nil = X2 ),
c_0_55 ).
cnf(c_0_60,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
c_0_56 ).
cnf(c_0_61,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_57,c_0_49]),c_0_39])]) ).
cnf(c_0_62,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_58,c_0_59]),c_0_35]),c_0_60]) ).
cnf(c_0_63,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_61,c_0_43]),c_0_40])]) ).
cnf(c_0_64,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_62,c_0_63]),c_0_40])]) ).
cnf(c_0_65,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_64,c_0_49]),c_0_39])]) ).
cnf(c_0_66,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_65,c_0_43]),c_0_40])]) ).
cnf(c_0_67,negated_conjecture,
( ~ ssList(cons(hd(sk1),nil))
| nil = sk1
| hd(cons(hd(sk1),sk4)) = hd(sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_66]),c_0_40])]) ).
cnf(c_0_68,negated_conjecture,
( ~ ssList(cons(hd(sk1),nil))
| ssList(cons(hd(sk1),sk4))
| nil = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_66]),c_0_40])]) ).
cnf(c_0_69,negated_conjecture,
( app(app(X3,cons(X1,nil)),X2) != sk1
| app(app(X2,cons(X1,nil)),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_70,negated_conjecture,
( ~ ssItem(hd(sk1))
| nil = sk1
| hd(cons(hd(sk1),sk4)) = hd(sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_49]),c_0_39])]) ).
cnf(c_0_71,negated_conjecture,
( ~ ssItem(hd(sk1))
| ssList(cons(hd(sk1),sk4))
| nil = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_49]),c_0_39])]) ).
cnf(c_0_72,negated_conjecture,
( app(app(X3,cons(X1,nil)),X2) != sk1
| app(app(X2,cons(X1,nil)),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
c_0_69 ).
cnf(c_0_73,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_74,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_75,negated_conjecture,
( nil = sk1
| hd(cons(hd(sk1),sk4)) = hd(sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_43]),c_0_40])]) ).
cnf(c_0_76,negated_conjecture,
( ssList(cons(hd(sk1),sk4))
| nil = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_43]),c_0_40])]) ).
cnf(c_0_77,negated_conjecture,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| app(app(X3,cons(X2,nil)),X1) != sk4
| app(app(X1,cons(X2,nil)),X3) != sk1 ),
inference(rw,[status(thm)],[c_0_72,c_0_30]) ).
cnf(c_0_78,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_73 ).
cnf(c_0_79,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_74 ).
cnf(c_0_80,negated_conjecture,
( ~ ssList(cons(hd(sk1),nil))
| cons(hd(sk1),sk4) != nil
| nil = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_66]),c_0_40])]) ).
cnf(c_0_81,negated_conjecture,
( ssItem(hd(sk1))
| nil = sk1
| cons(hd(sk1),sk4) = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_75]),c_0_76]) ).
cnf(c_0_82,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(cons(X2,nil))
| ~ ssItem(X2)
| app(cons(X2,nil),X1) != sk1
| app(app(X1,cons(X2,nil)),nil) != sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_39])]) ).
cnf(c_0_83,plain,
( ~ ssList(X1)
| nil = X1
| app(cons(hd(X1),nil),tl(X1)) = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_79]),c_0_46]),c_0_43]) ).
cnf(c_0_84,negated_conjecture,
( ~ ssList(cons(hd(sk1),nil))
| ssItem(hd(sk1))
| nil = sk1 ),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_85,negated_conjecture,
( ~ ssList(tl(sk1))
| ~ ssList(cons(hd(sk1),nil))
| app(app(tl(sk1),cons(hd(sk1),nil)),nil) != sk4
| nil = sk1 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83])]),c_0_40])]),c_0_84]) ).
cnf(c_0_86,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_87,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_88,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_89,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_90,negated_conjecture,
( ~ ssList(tl(sk1))
| ~ ssList(cons(hd(sk1),nil))
| app(sk4,nil) != sk4
| nil = sk1 ),
inference(spm,[status(thm)],[c_0_85,c_0_53]) ).
cnf(c_0_91,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_86 ).
cnf(c_0_92,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_87,c_0_30]) ).
cnf(c_0_93,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
c_0_88 ).
cnf(c_0_94,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
c_0_89 ).
cnf(c_0_95,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_96,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_97,negated_conjecture,
( ~ ssList(tl(sk1))
| ~ ssList(cons(hd(sk1),nil))
| nil = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_92])]) ).
cnf(c_0_98,plain,
( ~ ssList(X1)
| nil = X1
| tl(X1) = skaf82(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_95]),c_0_96])]) ).
cnf(c_0_99,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause97]) ).
cnf(c_0_100,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk3,nil) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_101,negated_conjecture,
( ~ ssList(cons(hd(sk1),nil))
| nil = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_96]),c_0_40])]) ).
cnf(c_0_102,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
c_0_99 ).
cnf(c_0_103,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_104,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk3,nil) ),
c_0_100 ).
cnf(c_0_105,negated_conjecture,
( ~ ssItem(hd(sk1))
| nil = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_49]),c_0_39])]) ).
cnf(c_0_106,plain,
( ~ ssList(X1)
| nil = X1
| hd(X1) = skaf83(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_94]),c_0_95]),c_0_96])]) ).
cnf(c_0_107,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_103 ).
cnf(c_0_108,negated_conjecture,
neq(sk1,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_104,c_0_33]),c_0_34])]) ).
cnf(c_0_109,negated_conjecture,
nil = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_95]),c_0_40])]) ).
cnf(c_0_110,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_107]) ).
cnf(c_0_111,negated_conjecture,
neq(sk1,sk1),
inference(rw,[status(thm)],[c_0_108,c_0_109]) ).
cnf(c_0_112,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC421-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.20/0.46 % Computer : n026.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Mon Sep 21 08:26:06 UTC 2026
% 0.20/0.47 % CPUTime :
% 0.20/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.54 Running first-order theorem proving
% 0.24/0.54 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.63/0.77 % Version: 3.5.1
% 0.63/0.77 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.63/0.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.63/0.77 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.63/0.77 % Starting new_bool_3 with 300s (1) cores
% 0.63/0.77 % Starting new_bool_1 with 300s (1) cores
% 0.63/0.77 % Starting sh5l with 300s (1) cores
% 0.63/0.77 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1832126 completed with status 0
% 0.63/0.77 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.63/0.77 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.63/0.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.63/0.77 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.63/0.77 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.63/0.77 % No SInE strategy applied
% 0.63/0.77 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.63/0.77 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.63/0.77 % Starting SubtermCWHack with 136s (1) cores
% 0.63/0.77 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.63/0.77 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.63/0.77 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.63/0.77 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.63/0.77 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 1832133 completed with status 0
% 0.63/0.77 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.63/0.77 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.63/0.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.63/0.77 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.63/0.77 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.63/0.77 % No SInE strategy applied
% 0.63/0.77 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.63/0.77 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.63/0.77 % Starting SubtermCWHack with 136s (1) cores
% 0.63/0.77 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.63/0.77 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.63/0.77 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.63/0.77 % Preprocessing time : 0.005 s
% 0.63/0.77
% 0.63/0.77 % Proof found!
% 0.63/0.77 % SZS status Unsatisfiable
% 0.63/0.77 % SZS output start CNFRefutation
% See solution above
% 0.63/0.77 % Parsed axioms : 196
% 0.63/0.77 % Removed by relevancy pruning/SinE : 0
% 0.63/0.77 % Initial clauses : 196
% 0.63/0.77 % Removed in clause preprocessing : 0
% 0.63/0.77 % Initial clauses in saturation : 196
% 0.63/0.77 % Processed clauses : 1316
% 0.63/0.77 % ...of these trivial : 2
% 0.63/0.77 % ...subsumed : 657
% 0.63/0.77 % ...remaining for further processing : 657
% 0.63/0.77 % Other redundant clauses eliminated : 217
% 0.63/0.77 % Clauses deleted for lack of memory : 0
% 0.63/0.77 % Backward-subsumed : 125
% 0.63/0.77 % Backward-rewritten : 275
% 0.63/0.77 % Generated clauses : 5098
% 0.63/0.77 % ...of the previous two non-redundant : 4630
% 0.63/0.77 % ...aggressively subsumed : 0
% 0.63/0.77 % Contextual simplify-reflections : 113
% 0.63/0.77 % Paramodulations : 4878
% 0.63/0.77 % Factorizations : 0
% 0.63/0.77 % NegExts : 0
% 0.63/0.77 % Equation resolutions : 224
% 0.63/0.77 % Disequality decompositions : 0
% 0.63/0.77 % Total rewrite steps : 3686
% 0.63/0.77 % ...of those cached : 3558
% 0.63/0.77 % Propositional unsat checks : 0
% 0.63/0.77 % Propositional check models : 0
% 0.63/0.77 % Propositional check unsatisfiable : 0
% 0.63/0.77 % Propositional clauses : 0
% 0.63/0.77 % Propositional clauses after purity: 0
% 0.63/0.77 % Propositional unsat core size : 0
% 0.63/0.77 % Propositional preprocessing time : 0.000
% 0.63/0.77 % Propositional encoding time : 0.000
% 0.63/0.77 % Propositional solver time : 0.000
% 0.63/0.77 % Success case prop preproc time : 0.000
% 0.63/0.77 % Success case prop encoding time : 0.000
% 0.63/0.77 % Success case prop solver time : 0.000
% 0.63/0.77 % Current number of processed clauses : 233
% 0.63/0.77 % Positive orientable unit clauses : 55
% 0.63/0.77 % Positive unorientable unit clauses: 0
% 0.63/0.77 % Negative unit clauses : 2
% 0.63/0.77 % Non-unit-clauses : 176
% 0.63/0.77 % Current number of unprocessed clauses: 3281
% 0.63/0.77 % ...number of literals in the above : 18720
% 0.63/0.77 % Current number of archived formulas : 0
% 0.63/0.77 % Current number of archived clauses : 400
% 0.63/0.77 % Clause-clause subsumption calls (NU) : 47003
% 0.63/0.77 % Rec. Clause-clause subsumption calls : 8524
% 0.63/0.77 % Non-unit clause-clause subsumptions : 722
% 0.63/0.77 % Unit Clause-clause subsumption calls : 66
% 0.63/0.77 % Rewrite failures with RHS unbound : 0
% 0.63/0.77 % BW rewrite match attempts : 3
% 0.63/0.77 % BW rewrite match successes : 3
% 0.63/0.77 % Condensation attempts : 0
% 0.63/0.77 % Condensation successes : 0
% 0.63/0.77 % Termbank termtop insertions : 99586
% 0.63/0.77 % Search garbage collected termcells : 562
% 0.63/0.77
% 0.63/0.77 % -------------------------------------------------
% 0.63/0.77 % User time : 0.152 s
% 0.63/0.77 % System time : 0.011 s
% 0.63/0.77 % Total time : 0.163 s
% 0.63/0.77 % Maximum resident set size: 4068 pages
% 0.63/0.77
% 0.63/0.77 % -------------------------------------------------
% 0.63/0.77 % User time : 0.506 s
% 0.63/0.77 % System time : 0.047 s
% 0.63/0.77 % Total time : 0.553 s
% 0.63/0.77 % Maximum resident set size: 4864 pages
% 0.63/0.77 % E exiting
%------------------------------------------------------------------------------