%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC015-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:42:37 PM UTC 2026
% Result : Unsatisfiable 0.65s 0.52s
% Output : CNFRefutation 0.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 28
% Syntax : Number of clauses : 108 ( 23 unt; 31 nHn; 102 RR)
% Number of literals : 330 ( 127 equ; 204 neg)
% Maximal clause size : 7 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 121 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_11,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| app(sk3,X2) != X1
| tl(sk4) != X2
| ~ ssList(X2)
| ~ ssList(X1)
| sk4 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause151,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != app(X3,X2)
| X1 = X3 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause151) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
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(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause104,axiom,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause97,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(clause75,axiom,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(co1_12,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(X1,nil),X2) != sk2
| cons(X1,nil) != sk1
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(clause109,axiom,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(clause101,axiom,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(clause116,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause116) ).
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(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(clause118,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause99,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(clause76,axiom,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).
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_28,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_29,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| app(sk3,X2) != X1
| tl(sk4) != X2
| ~ ssList(X2)
| ~ ssList(X1)
| sk4 = X1 ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_30,negated_conjecture,
neq(sk2,nil),
c_0_28 ).
cnf(c_0_31,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_32,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| app(sk3,X2) != X1
| tl(sk4) != X2
| ~ ssList(X2)
| ~ ssList(X1)
| sk4 = X1 ),
c_0_29 ).
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_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(nil,sk4)
| tl(sk4) != X2
| app(sk1,X2) != X1
| sk4 = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_36,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_37,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(app(sk1,X1))
| ~ neq(nil,sk4)
| tl(sk4) != X1
| app(sk1,X1) = sk4 ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_38,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_36 ).
cnf(c_0_39,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_40,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != app(X3,X2)
| X1 = X3 ),
inference(fof_simplification,[status(thm)],[clause151]) ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_42,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| tl(app(X2,X1)) = app(tl(X2),X1)
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause133]) ).
cnf(c_0_43,negated_conjecture,
( ~ ssList(X1)
| ~ neq(nil,sk4)
| tl(sk4) != X1
| app(sk1,X1) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
cnf(c_0_44,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != app(X3,X2)
| X1 = X3 ),
c_0_40 ).
cnf(c_0_45,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_41 ).
cnf(c_0_46,axiom,
ssList(nil),
clause8 ).
cnf(c_0_47,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| tl(app(X2,X1)) = app(tl(X2),X1)
| nil = X2 ),
c_0_42 ).
cnf(c_0_48,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ neq(nil,sk4)
| app(sk1,tl(sk4)) = sk4 ),
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_49,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_50,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause97]) ).
cnf(c_0_51,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_52,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_53,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != X2
| X1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]) ).
cnf(c_0_54,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ neq(nil,sk4)
| sk1 = nil
| app(tl(sk1),tl(sk4)) = tl(sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_39])]) ).
cnf(c_0_55,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_56,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(X1,nil),X2) != sk2
| cons(X1,nil) != sk1
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_57,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
c_0_49 ).
cnf(c_0_58,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
c_0_50 ).
cnf(c_0_59,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_51 ).
cnf(c_0_60,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_52 ).
cnf(c_0_61,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_62,negated_conjecture,
( ~ ssList(tl(sk1))
| ~ ssList(tl(sk4))
| ~ neq(nil,sk4)
| sk1 = nil
| tl(sk1) = nil ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_63,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
c_0_55 ).
cnf(c_0_64,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_65,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(X1,nil),X2) != sk2
| cons(X1,nil) != sk1
| ~ ssList(X2)
| ~ ssItem(X1) ),
c_0_56 ).
cnf(c_0_66,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_67,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_68,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,tl(cons(X1,X2))) = cons(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),c_0_60]) ).
cnf(c_0_69,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
c_0_61 ).
cnf(c_0_70,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_71,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_72,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ neq(nil,sk4)
| sk1 = nil
| tl(sk1) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_39])]) ).
cnf(c_0_73,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_64,c_0_31]) ).
cnf(c_0_74,negated_conjecture,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != sk1
| app(cons(X1,nil),X2) != sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_31]),c_0_34])]) ).
cnf(c_0_75,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
c_0_66 ).
cnf(c_0_76,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_77,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
c_0_67 ).
cnf(c_0_78,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),tl(X1)) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]),c_0_71])]) ).
cnf(c_0_79,negated_conjecture,
( ~ neq(nil,sk4)
| sk1 = nil
| sk4 = nil
| tl(sk1) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_63]),c_0_73])]) ).
cnf(c_0_80,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_81,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ singletonP(X1)
| X1 != sk1
| app(X1,X2) != sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76])]) ).
cnf(c_0_82,plain,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_77]) ).
cnf(c_0_83,negated_conjecture,
( ~ neq(nil,sk4)
| sk1 = nil
| sk4 = nil
| cons(skaf83(sk1),nil) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_39])]) ).
cnf(c_0_84,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
c_0_80 ).
cnf(c_0_85,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ singletonP(sk1)
| ~ neq(nil,sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_48]),c_0_39])]) ).
cnf(c_0_86,negated_conjecture,
( ~ neq(nil,sk4)
| singletonP(sk1)
| sk4 = nil
| sk1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_70]),c_0_39])]) ).
cnf(c_0_87,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ neq(nil,sk4)
| sk4 != nil
| sk1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_48]),c_0_39])]) ).
cnf(c_0_88,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ neq(nil,sk4)
| sk1 = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_87]) ).
cnf(c_0_89,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_90,negated_conjecture,
( ~ neq(nil,sk4)
| sk1 = nil
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_63]),c_0_73])]) ).
cnf(c_0_91,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_89 ).
cnf(c_0_92,negated_conjecture,
( sk4 = nil
| sk1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_46]),c_0_73])]) ).
cnf(c_0_93,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
inference(fof_simplification,[status(thm)],[clause99]) ).
cnf(c_0_94,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_95,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ neq(nil,sk4)
| sk4 = nil
| app(nil,tl(sk4)) = sk4 ),
inference(spm,[status(thm)],[c_0_48,c_0_92]) ).
cnf(c_0_96,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
c_0_93 ).
cnf(c_0_97,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
c_0_94 ).
cnf(c_0_98,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ neq(nil,sk4)
| sk4 = nil
| tl(sk4) = sk4 ),
inference(spm,[status(thm)],[c_0_45,c_0_95]) ).
cnf(c_0_99,plain,
( ~ ssList(X1)
| tl(X1) != X1
| nil = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_57]),c_0_63]),c_0_97]) ).
cnf(c_0_100,negated_conjecture,
( ~ neq(nil,sk4)
| sk4 = nil
| tl(sk4) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_63]),c_0_73])]) ).
cnf(c_0_101,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_102,negated_conjecture,
( ~ neq(nil,sk4)
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_73])]) ).
cnf(c_0_103,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_101 ).
cnf(c_0_104,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_91]),c_0_46]),c_0_73])]) ).
cnf(c_0_105,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_103]) ).
cnf(c_0_106,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_34,c_0_104]) ).
cnf(c_0_107,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_46])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC015-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n026.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 07:52:09 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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.65/0.52 % Version: 3.5.1
% 0.65/0.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.65/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.65/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.65/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.65/0.52 % Starting sh5l with 300s (1) cores
% 0.65/0.52 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1770644 completed with status 0
% 0.65/0.52 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.65/0.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.65/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.65/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.65/0.52 % No SInE strategy applied
% 0.65/0.52 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.65/0.52 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.65/0.52 % Starting SubtermCWHack with 136s (1) cores
% 0.65/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.65/0.52 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.65/0.52 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.65/0.52 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.65/0.52 % G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with pid 1770652 completed with status 0
% 0.65/0.52 % Result found by G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y
% 0.65/0.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.65/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.65/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.65/0.52 % No SInE strategy applied
% 0.65/0.52 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.65/0.52 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.65/0.52 % Starting SubtermCWHack with 136s (1) cores
% 0.65/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.65/0.52 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.65/0.52 % Preprocessing time : 0.004 s
% 0.65/0.52 % Presaturation interreduction done
% 0.65/0.52
% 0.65/0.52 % Proof found!
% 0.65/0.52 % SZS status Unsatisfiable
% 0.65/0.52 % SZS output start CNFRefutation
% See solution above
% 0.65/0.52 % Parsed axioms : 197
% 0.65/0.52 % Removed by relevancy pruning/SinE : 0
% 0.65/0.52 % Initial clauses : 197
% 0.65/0.52 % Removed in clause preprocessing : 0
% 0.65/0.52 % Initial clauses in saturation : 197
% 0.65/0.52 % Processed clauses : 650
% 0.65/0.52 % ...of these trivial : 8
% 0.65/0.52 % ...subsumed : 124
% 0.65/0.52 % ...remaining for further processing : 518
% 0.65/0.52 % Other redundant clauses eliminated : 90
% 0.65/0.52 % Clauses deleted for lack of memory : 0
% 0.65/0.52 % Backward-subsumed : 39
% 0.65/0.52 % Backward-rewritten : 24
% 0.65/0.52 % Generated clauses : 2157
% 0.65/0.52 % ...of the previous two non-redundant : 1865
% 0.65/0.52 % ...aggressively subsumed : 0
% 0.65/0.52 % Contextual simplify-reflections : 29
% 0.65/0.52 % Paramodulations : 2043
% 0.65/0.52 % Factorizations : 0
% 0.65/0.52 % NegExts : 0
% 0.65/0.52 % Equation resolutions : 111
% 0.65/0.52 % Disequality decompositions : 0
% 0.65/0.52 % Total rewrite steps : 1627
% 0.65/0.52 % ...of those cached : 1500
% 0.65/0.52 % Propositional unsat checks : 0
% 0.65/0.52 % Propositional check models : 0
% 0.65/0.52 % Propositional check unsatisfiable : 0
% 0.65/0.52 % Propositional clauses : 0
% 0.65/0.52 % Propositional clauses after purity: 0
% 0.65/0.52 % Propositional unsat core size : 0
% 0.65/0.52 % Propositional preprocessing time : 0.000
% 0.65/0.52 % Propositional encoding time : 0.000
% 0.65/0.52 % Propositional solver time : 0.000
% 0.65/0.52 % Success case prop preproc time : 0.000
% 0.65/0.52 % Success case prop encoding time : 0.000
% 0.65/0.52 % Success case prop solver time : 0.000
% 0.65/0.52 % Current number of processed clauses : 259
% 0.65/0.52 % Positive orientable unit clauses : 58
% 0.65/0.52 % Positive unorientable unit clauses: 0
% 0.65/0.52 % Negative unit clauses : 2
% 0.65/0.52 % Non-unit-clauses : 199
% 0.65/0.52 % Current number of unprocessed clauses: 1538
% 0.65/0.52 % ...number of literals in the above : 10472
% 0.65/0.52 % Current number of archived formulas : 0
% 0.65/0.52 % Current number of archived clauses : 253
% 0.65/0.52 % Clause-clause subsumption calls (NU) : 15908
% 0.65/0.52 % Rec. Clause-clause subsumption calls : 3126
% 0.65/0.52 % Non-unit clause-clause subsumptions : 176
% 0.65/0.52 % Unit Clause-clause subsumption calls : 110
% 0.65/0.52 % Rewrite failures with RHS unbound : 0
% 0.65/0.52 % BW rewrite match attempts : 3
% 0.65/0.52 % BW rewrite match successes : 3
% 0.65/0.52 % Condensation attempts : 0
% 0.65/0.52 % Condensation successes : 0
% 0.65/0.52 % Termbank termtop insertions : 48220
% 0.65/0.52 % Search garbage collected termcells : 559
% 0.65/0.52
% 0.65/0.52 % -------------------------------------------------
% 0.65/0.52 % User time : 0.080 s
% 0.65/0.52 % System time : 0.008 s
% 0.65/0.52 % Total time : 0.088 s
% 0.65/0.52 % Maximum resident set size: 4068 pages
% 0.65/0.52
% 0.65/0.52 % -------------------------------------------------
% 0.65/0.52 % User time : 0.358 s
% 0.65/0.52 % System time : 0.042 s
% 0.65/0.52 % Total time : 0.400 s
% 0.65/0.52 % Maximum resident set size: 4864 pages
% 0.65/0.52 % E exiting
%------------------------------------------------------------------------------