%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC393-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 : n003.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:13 PM UTC 2026
% Result : Unsatisfiable 4.99s 6.15s
% Output : CNFRefutation 4.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 30
% Syntax : Number of clauses : 111 ( 41 unt; 9 nHn; 91 RR)
% Number of literals : 279 ( 42 equ; 174 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 156 ( 34 sgn)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(clause169,axiom,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause169) ).
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(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause72,axiom,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause136,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ rearsegP(X1,X2)
| rearsegP(app(X3,X1),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause136) ).
cnf(clause58,axiom,
( ~ ssList(X1)
| rearsegP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause58) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause131,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause131) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause149,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause50) ).
cnf(co1_12,negated_conjecture,
( ~ neq(sk4,nil)
| segmentP(sk4,sk3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
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(clause141,axiom,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| memberP(app(X3,X1),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause141) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause168,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause168) ).
cnf(co1_9,negated_conjecture,
~ memberP(sk2,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause71,axiom,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(co1_10,negated_conjecture,
( nil != sk4
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause48,axiom,
ssList(skaf48(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause48) ).
cnf(clause49,axiom,
ssList(skaf47(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause49) ).
cnf(c_0_30,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_31,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
inference(fof_simplification,[status(thm)],[clause169]) ).
cnf(c_0_32,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_30 ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
c_0_31 ).
cnf(c_0_34,negated_conjecture,
memberP(sk1,sk5),
co1_8 ).
cnf(c_0_35,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_36,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_37,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_38,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_39,plain,
( ~ duplicatefreeP(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_40,negated_conjecture,
app(skaf42(sk1,sk5),cons(sk5,skaf43(sk5,sk1))) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_41,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_42,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
c_0_37 ).
cnf(c_0_44,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_38 ).
cnf(c_0_45,negated_conjecture,
( ~ duplicatefreeP(app(sk1,cons(sk5,X1)))
| ~ ssList(X1)
| ~ ssList(app(sk1,cons(sk5,X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_35]),c_0_41]),c_0_42])]) ).
cnf(c_0_46,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| duplicatefreeP(app(X2,X3))
| ssItem(X1) ),
inference(spm,[status(thm)],[c_0_43,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(X2)
| ~ ssList(cons(sk5,X2))
| ~ ssList(app(sk1,cons(sk5,X2)))
| ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_36])]) ).
cnf(c_0_49,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_47 ).
cnf(c_0_50,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(app(sk1,cons(sk5,X2)))
| ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_35])]) ).
cnf(c_0_51,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ rearsegP(X1,X2)
| rearsegP(app(X3,X1),X2) ),
inference(fof_simplification,[status(thm)],[clause136]) ).
cnf(c_0_52,plain,
( ~ ssList(X1)
| rearsegP(X1,nil) ),
inference(fof_simplification,[status(thm)],[clause58]) ).
cnf(c_0_53,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(cons(sk5,X2))
| ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_44]),c_0_36])]) ).
cnf(c_0_54,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ rearsegP(X1,X2)
| rearsegP(app(X3,X1),X2) ),
c_0_51 ).
cnf(c_0_55,plain,
( ~ ssList(X1)
| rearsegP(X1,nil) ),
c_0_52 ).
cnf(c_0_56,axiom,
ssList(nil),
clause8 ).
cnf(c_0_57,negated_conjecture,
( ~ ssList(X2)
| ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_49]),c_0_35])]) ).
cnf(c_0_58,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| rearsegP(app(X1,X2),nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56])]) ).
cnf(c_0_59,negated_conjecture,
ssItem(X1),
inference(spm,[status(thm)],[c_0_57,c_0_42]) ).
cnf(c_0_60,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
inference(fof_simplification,[status(thm)],[clause131]) ).
cnf(c_0_61,negated_conjecture,
( ~ ssList(cons(sk5,skaf43(sk5,sk1)))
| rearsegP(sk1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_40]),c_0_42])]) ).
cnf(c_0_62,plain,
( ~ ssList(X2)
| ssList(cons(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_59])]) ).
cnf(c_0_63,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_64,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
c_0_60 ).
cnf(c_0_65,negated_conjecture,
rearsegP(sk1,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_41])]) ).
cnf(c_0_66,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_67,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_63 ).
cnf(c_0_68,negated_conjecture,
app(skaf46(sk1,nil),nil) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_56]),c_0_36])]) ).
cnf(c_0_69,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_70,negated_conjecture,
( ~ neq(sk4,nil)
| segmentP(sk4,sk3) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_71,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
inference(fof_simplification,[status(thm)],[clause140]) ).
cnf(c_0_72,plain,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| memberP(app(X3,X1),X2) ),
inference(fof_simplification,[status(thm)],[clause141]) ).
cnf(c_0_73,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_66 ).
cnf(c_0_74,negated_conjecture,
skaf46(sk1,nil) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69])]) ).
cnf(c_0_75,negated_conjecture,
( ~ neq(sk4,nil)
| segmentP(sk4,sk3) ),
c_0_70 ).
cnf(c_0_76,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_77,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_78,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_79,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_80,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
c_0_71 ).
cnf(c_0_81,plain,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| memberP(app(X3,X1),X2) ),
c_0_72 ).
cnf(c_0_82,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ssList(app(X1,app(X2,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_73]),c_0_44]) ).
cnf(c_0_83,negated_conjecture,
app(sk1,nil) = sk1,
inference(rw,[status(thm)],[c_0_68,c_0_74]) ).
cnf(c_0_84,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause168]) ).
cnf(c_0_85,negated_conjecture,
( ~ neq(sk4,nil)
| segmentP(sk4,sk1) ),
inference(rw,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_86,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_77 ).
cnf(c_0_87,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_88,negated_conjecture,
~ memberP(sk2,sk5),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_89,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_90,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ memberP(X1,X3)
| memberP(app(X1,X2),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_59])]) ).
cnf(c_0_91,negated_conjecture,
( ~ ssList(X1)
| memberP(app(X1,sk1),sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_92,negated_conjecture,
( ~ ssList(X1)
| ssList(app(X1,sk1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_56]),c_0_36])]) ).
cnf(c_0_93,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1 ),
c_0_84 ).
cnf(c_0_94,negated_conjecture,
( segmentP(sk4,sk1)
| nil = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_87]),c_0_56])]) ).
cnf(c_0_95,negated_conjecture,
~ memberP(sk2,sk5),
c_0_88 ).
cnf(c_0_96,negated_conjecture,
( nil != sk4
| nil = sk3 ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_97,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
c_0_89 ).
cnf(c_0_98,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| memberP(app(app(X1,sk1),X2),sk5) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_92]) ).
cnf(c_0_99,negated_conjecture,
( nil = sk4
| app(app(skaf47(sk4,sk1),sk1),skaf48(sk1,sk4)) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_36]),c_0_87])]) ).
cnf(c_0_100,axiom,
ssList(skaf48(X1,X2)),
clause48 ).
cnf(c_0_101,axiom,
ssList(skaf47(X1,X2)),
clause49 ).
cnf(c_0_102,negated_conjecture,
~ memberP(sk4,sk5),
inference(rw,[status(thm)],[c_0_95,c_0_79]) ).
cnf(c_0_103,negated_conjecture,
( nil != sk4
| nil = sk3 ),
c_0_96 ).
cnf(c_0_104,plain,
~ memberP(nil,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_97,c_0_59])]) ).
cnf(c_0_105,negated_conjecture,
nil = sk4,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_100]),c_0_101])]),c_0_102]) ).
cnf(c_0_106,negated_conjecture,
( nil != sk4
| nil = sk1 ),
inference(rw,[status(thm)],[c_0_103,c_0_76]) ).
cnf(c_0_107,plain,
~ memberP(sk4,X1),
inference(rw,[status(thm)],[c_0_104,c_0_105]) ).
cnf(c_0_108,negated_conjecture,
sk4 = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_106,c_0_105]),c_0_105])]) ).
cnf(c_0_109,plain,
~ memberP(sk1,X1),
inference(rw,[status(thm)],[c_0_107,c_0_108]) ).
cnf(c_0_110,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_34,c_0_109]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC393-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/5.38 % Computer : n003.cluster.edu
% 0.09/5.38 % Model : x86_64 x86_64
% 0.09/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.38 % Memory : 8046.5625MB
% 0.09/5.38 % OS : Linux 6.8.0-71-generic
% 0.09/5.38 % CPULimit : 300
% 0.09/5.38 % WCLimit : 300
% 0.09/5.38 % DateTime : Mon Sep 21 08:22:21 UTC 2026
% 0.09/5.38 % CPUTime :
% 0.09/5.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.42 Running first-order theorem proving
% 0.14/5.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
% 4.99/6.15 % Version: 3.5.1
% 4.99/6.15 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.99/6.15 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.99/6.15 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.99/6.15 % Starting new_bool_3 with 300s (1) cores
% 4.99/6.15 % Starting new_bool_1 with 300s (1) cores
% 4.99/6.15 % Starting sh5l with 300s (1) cores
% 4.99/6.15 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3842418 completed with status 0
% 4.99/6.15 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 4.99/6.15 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.99/6.15 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.99/6.15 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.99/6.15 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.99/6.15 % No SInE strategy applied
% 4.99/6.15 % Search class: FGHSM-FSLM21-MFFFFFNN
% 4.99/6.15 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 4.99/6.15 % Starting SubtermCWHack with 136s (1) cores
% 4.99/6.15 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 4.99/6.15 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 4.99/6.15 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 4.99/6.15 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 4.99/6.15 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 3842428 completed with status 0
% 4.99/6.15 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 4.99/6.15 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.99/6.15 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.99/6.15 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.99/6.15 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.99/6.15 % No SInE strategy applied
% 4.99/6.15 % Search class: FGHSM-FSLM21-MFFFFFNN
% 4.99/6.15 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 4.99/6.15 % Starting SubtermCWHack with 136s (1) cores
% 4.99/6.15 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 4.99/6.15 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 4.99/6.15 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 4.99/6.15 % Preprocessing time : 0.002 s
% 4.99/6.15
% 4.99/6.15 % Proof found!
% 4.99/6.15 % SZS status Unsatisfiable
% 4.99/6.15 % SZS output start CNFRefutation
% See solution above
% 4.99/6.15 % Parsed axioms : 197
% 4.99/6.15 % Removed by relevancy pruning/SinE : 0
% 4.99/6.15 % Initial clauses : 197
% 4.99/6.15 % Removed in clause preprocessing : 0
% 4.99/6.15 % Initial clauses in saturation : 197
% 4.99/6.15 % Processed clauses : 7682
% 4.99/6.15 % ...of these trivial : 53
% 4.99/6.15 % ...subsumed : 5428
% 4.99/6.15 % ...remaining for further processing : 2201
% 4.99/6.15 % Other redundant clauses eliminated : 844
% 4.99/6.15 % Clauses deleted for lack of memory : 0
% 4.99/6.15 % Backward-subsumed : 154
% 4.99/6.15 % Backward-rewritten : 1416
% 4.99/6.15 % Generated clauses : 34473
% 4.99/6.15 % ...of the previous two non-redundant : 31587
% 4.99/6.15 % ...aggressively subsumed : 0
% 4.99/6.15 % Contextual simplify-reflections : 361
% 4.99/6.15 % Paramodulations : 33611
% 4.99/6.15 % Factorizations : 0
% 4.99/6.15 % NegExts : 0
% 4.99/6.15 % Equation resolutions : 862
% 4.99/6.15 % Disequality decompositions : 0
% 4.99/6.15 % Total rewrite steps : 40320
% 4.99/6.15 % ...of those cached : 39648
% 4.99/6.15 % Propositional unsat checks : 0
% 4.99/6.15 % Propositional check models : 0
% 4.99/6.15 % Propositional check unsatisfiable : 0
% 4.99/6.15 % Propositional clauses : 0
% 4.99/6.15 % Propositional clauses after purity: 0
% 4.99/6.15 % Propositional unsat core size : 0
% 4.99/6.15 % Propositional preprocessing time : 0.000
% 4.99/6.15 % Propositional encoding time : 0.000
% 4.99/6.15 % Propositional solver time : 0.000
% 4.99/6.15 % Success case prop preproc time : 0.000
% 4.99/6.15 % Success case prop encoding time : 0.000
% 4.99/6.15 % Success case prop solver time : 0.000
% 4.99/6.15 % Current number of processed clauses : 607
% 4.99/6.15 % Positive orientable unit clauses : 67
% 4.99/6.15 % Positive unorientable unit clauses: 0
% 4.99/6.15 % Negative unit clauses : 14
% 4.99/6.15 % Non-unit-clauses : 526
% 4.99/6.15 % Current number of unprocessed clauses: 22478
% 4.99/6.15 % ...number of literals in the above : 119111
% 4.99/6.15 % Current number of archived formulas : 0
% 4.99/6.15 % Current number of archived clauses : 1571
% 4.99/6.15 % Clause-clause subsumption calls (NU) : 762609
% 4.99/6.15 % Rec. Clause-clause subsumption calls : 221715
% 4.99/6.15 % Non-unit clause-clause subsumptions : 4262
% 4.99/6.15 % Unit Clause-clause subsumption calls : 3776
% 4.99/6.15 % Rewrite failures with RHS unbound : 0
% 4.99/6.15 % BW rewrite match attempts : 68
% 4.99/6.15 % BW rewrite match successes : 55
% 4.99/6.15 % Condensation attempts : 0
% 4.99/6.15 % Condensation successes : 0
% 4.99/6.15 % Termbank termtop insertions : 700766
% 4.99/6.15 % Search garbage collected termcells : 536
% 4.99/6.15
% 4.99/6.15 % -------------------------------------------------
% 4.99/6.15 % User time : 0.644 s
% 4.99/6.15 % System time : 0.024 s
% 4.99/6.15 % Total time : 0.668 s
% 4.99/6.15 % Maximum resident set size: 3808 pages
% 4.99/6.15
% 4.99/6.15 % -------------------------------------------------
% 4.99/6.15 % User time : 3.191 s
% 4.99/6.15 % System time : 0.155 s
% 4.99/6.15 % Total time : 3.347 s
% 4.99/6.15 % Maximum resident set size: 4864 pages
% 4.99/6.15 % E exiting
%------------------------------------------------------------------------------