%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC307-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:43:52 PM UTC 2026
% Result : Unsatisfiable 0.18s 0.49s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 30
% Syntax : Number of clauses : 106 ( 37 unt; 5 nHn; 104 RR)
% Number of literals : 287 ( 67 equ; 188 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 105 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_13,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause149,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(clause118,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(co1_10,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_11,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(clause120,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(co1_12,negated_conjecture,
ssList(sk9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_8,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause119,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(clause181,axiom,
( ~ ssList(X6)
| ~ strictorderedP(X6)
| ~ ssItem(X2)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X5)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| lt(X2,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause181) ).
cnf(clause114,axiom,
( ~ ssItem(X2)
| ~ ssItem(X1)
| ~ lt(X2,X1)
| ~ lt(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause114) ).
cnf(co1_9,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_14,negated_conjecture,
lt(sk6,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(clause66,axiom,
( ~ ssItem(X1)
| strictorderedP(cons(X1,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause66) ).
cnf(clause101,axiom,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(co1_15,negated_conjecture,
( ~ neq(sk4,nil)
| singletonP(sk3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause152,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X2,X3)
| ~ segmentP(X1,X2)
| segmentP(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause152) ).
cnf(clause99,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(clause80,axiom,
( ~ ssList(X1)
| ~ segmentP(nil,X1)
| nil = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause80) ).
cnf(co1_7,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(clause79,axiom,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause79) ).
cnf(c_0_30,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk1,
co1_13 ).
cnf(c_0_31,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_32,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_33,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_34,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk3,
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_32 ).
cnf(c_0_36,negated_conjecture,
ssList(sk7),
co1_10 ).
cnf(c_0_37,negated_conjecture,
ssList(sk8),
co1_11 ).
cnf(c_0_38,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_39,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
c_0_33 ).
cnf(c_0_40,negated_conjecture,
ssList(sk9),
co1_12 ).
cnf(c_0_41,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_42,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| app(app(app(sk7,app(cons(sk5,nil),sk8)),cons(sk6,nil)),sk9) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_37])]) ).
cnf(c_0_43,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_38 ).
cnf(c_0_44,negated_conjecture,
ssItem(sk5),
co1_8 ).
cnf(c_0_45,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_46,negated_conjecture,
( ~ ssList(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)))
| sk3 != nil
| app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_34]),c_0_40])]) ).
cnf(c_0_47,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_41 ).
cnf(c_0_48,plain,
( ~ ssList(X6)
| ~ strictorderedP(X6)
| ~ ssItem(X2)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X5)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| lt(X2,X4) ),
inference(fof_simplification,[status(thm)],[clause181]) ).
cnf(c_0_49,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| app(app(app(sk7,cons(sk5,sk8)),cons(sk6,nil)),sk9) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_37])]) ).
cnf(c_0_50,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| ~ lt(X2,X1)
| ~ lt(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause114]) ).
cnf(c_0_51,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
c_0_45 ).
cnf(c_0_52,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssList(app(app(sk7,cons(sk5,nil)),sk8))
| sk3 != nil
| app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)) = nil ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_53,plain,
( ~ ssList(X6)
| ~ strictorderedP(X6)
| ~ ssItem(X2)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X5)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| lt(X2,X4) ),
c_0_48 ).
cnf(c_0_54,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,nil))
| ~ ssList(app(sk7,cons(sk5,sk8)))
| app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_49]),c_0_40])]) ).
cnf(c_0_55,negated_conjecture,
ssItem(sk6),
co1_9 ).
cnf(c_0_56,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_57,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| ~ lt(X2,X1)
| ~ lt(X1,X2) ),
c_0_50 ).
cnf(c_0_58,negated_conjecture,
lt(sk6,sk5),
co1_14 ).
cnf(c_0_59,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssList(app(app(sk7,cons(sk5,nil)),sk8))
| sk3 != nil
| cons(sk6,nil) = nil ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_60,plain,
( ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssItem(X1)
| ~ ssItem(X2)
| lt(X1,X2) ),
inference(er,[status(thm)],[c_0_53]) ).
cnf(c_0_61,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,nil))
| ~ ssList(app(sk7,cons(sk5,sk8)))
| app(app(sk7,cons(sk5,sk8)),cons(sk6,sk9)) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_43]),c_0_55]),c_0_40])]) ).
cnf(c_0_62,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_56,c_0_31]) ).
cnf(c_0_63,negated_conjecture,
~ lt(sk5,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_55]),c_0_44])]) ).
cnf(c_0_64,plain,
( ~ ssItem(X1)
| strictorderedP(cons(X1,nil)) ),
inference(fof_simplification,[status(thm)],[clause66]) ).
cnf(c_0_65,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_66,negated_conjecture,
( ~ neq(sk4,nil)
| singletonP(sk3) ),
inference(fof_simplification,[status(thm)],[co1_15]) ).
cnf(c_0_67,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_68,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_69,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_70,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssList(app(sk7,cons(sk5,nil)))
| sk3 != nil
| cons(sk6,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_47]),c_0_37])]) ).
cnf(c_0_71,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_72,negated_conjecture,
( ~ strictorderedP(sk3)
| ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,nil))
| ~ ssList(app(sk7,cons(sk5,sk8))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_55]),c_0_44]),c_0_62]),c_0_40]),c_0_37]),c_0_36])]),c_0_63]) ).
cnf(c_0_73,plain,
( ~ ssItem(X1)
| strictorderedP(cons(X1,nil)) ),
c_0_64 ).
cnf(c_0_74,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
c_0_65 ).
cnf(c_0_75,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_76,negated_conjecture,
( ~ neq(sk4,nil)
| singletonP(sk3) ),
c_0_66 ).
cnf(c_0_77,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_67 ).
cnf(c_0_78,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_79,axiom,
ssList(nil),
clause8 ).
cnf(c_0_80,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,nil))
| sk3 != nil
| cons(sk6,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_47]),c_0_36])]) ).
cnf(c_0_81,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_71 ).
cnf(c_0_82,negated_conjecture,
( ~ strictorderedP(sk3)
| ~ ssList(cons(sk5,sk8))
| ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_47]),c_0_36])]) ).
cnf(c_0_83,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| strictorderedP(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75])]) ).
cnf(c_0_84,negated_conjecture,
( singletonP(sk3)
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_78]),c_0_79])]) ).
cnf(c_0_85,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X2,X3)
| ~ segmentP(X1,X2)
| segmentP(X1,X3) ),
inference(fof_simplification,[status(thm)],[clause152]) ).
cnf(c_0_86,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
inference(fof_simplification,[status(thm)],[clause99]) ).
cnf(c_0_87,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| sk3 != nil
| cons(sk6,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_55]),c_0_79])]) ).
cnf(c_0_88,negated_conjecture,
( ~ strictorderedP(sk3)
| ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_81]),c_0_44]),c_0_37])]) ).
cnf(c_0_89,negated_conjecture,
( strictorderedP(sk3)
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_62])]) ).
cnf(c_0_90,plain,
( ~ ssList(X1)
| ~ segmentP(nil,X1)
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause80]) ).
cnf(c_0_91,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X2,X3)
| ~ segmentP(X1,X2)
| segmentP(X1,X3) ),
c_0_85 ).
cnf(c_0_92,negated_conjecture,
segmentP(sk4,sk3),
co1_7 ).
cnf(c_0_93,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
c_0_86 ).
cnf(c_0_94,negated_conjecture,
( sk3 != nil
| cons(sk6,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_81]),c_0_44]),c_0_79])]) ).
cnf(c_0_95,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,nil))
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_96,plain,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause79]) ).
cnf(c_0_97,plain,
( ~ ssList(X1)
| ~ segmentP(nil,X1)
| nil = X1 ),
c_0_90 ).
cnf(c_0_98,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(X1,sk4)
| segmentP(X1,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_62]),c_0_78])]) ).
cnf(c_0_99,negated_conjecture,
sk3 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_55]),c_0_79])]) ).
cnf(c_0_100,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_81]),c_0_55]),c_0_79])]) ).
cnf(c_0_101,plain,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
c_0_96 ).
cnf(c_0_102,negated_conjecture,
~ segmentP(nil,sk4),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_62]),c_0_79])]),c_0_99]) ).
cnf(c_0_103,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_81]),c_0_44]),c_0_79])]) ).
cnf(c_0_104,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_101]),c_0_79])]) ).
cnf(c_0_105,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_102,c_0_103]),c_0_104])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC307-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n009.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 08:14:12 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.49 % Version: 3.5.1
% 0.18/0.49 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.18/0.49 % Starting sh5l with 300s (1) cores
% 0.18/0.49 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1287290 completed with status 0
% 0.18/0.49 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.18/0.49 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/0.49 % No SInE strategy applied
% 0.18/0.49 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.18/0.49 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.18/0.49 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.18/0.49 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.18/0.49 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.18/0.49 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.18/0.49 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1287297 completed with status 0
% 0.18/0.49 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.18/0.49 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/0.49 % No SInE strategy applied
% 0.18/0.49 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.18/0.49 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.18/0.49 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.18/0.49 % Preprocessing time : 0.002 s
% 0.18/0.49 % Presaturation interreduction done
% 0.18/0.49
% 0.18/0.49 % Proof found!
% 0.18/0.49 % SZS status Unsatisfiable
% 0.18/0.49 % SZS output start CNFRefutation
% See solution above
% 0.18/0.50 % Parsed axioms : 200
% 0.18/0.50 % Removed by relevancy pruning/SinE : 0
% 0.18/0.50 % Initial clauses : 200
% 0.18/0.50 % Removed in clause preprocessing : 0
% 0.18/0.50 % Initial clauses in saturation : 200
% 0.18/0.50 % Processed clauses : 700
% 0.18/0.50 % ...of these trivial : 2
% 0.18/0.50 % ...subsumed : 97
% 0.18/0.50 % ...remaining for further processing : 601
% 0.18/0.50 % Other redundant clauses eliminated : 74
% 0.18/0.50 % Clauses deleted for lack of memory : 0
% 0.18/0.50 % Backward-subsumed : 29
% 0.18/0.50 % Backward-rewritten : 27
% 0.18/0.50 % Generated clauses : 2044
% 0.18/0.50 % ...of the previous two non-redundant : 1860
% 0.18/0.50 % ...aggressively subsumed : 0
% 0.18/0.50 % Contextual simplify-reflections : 6
% 0.18/0.50 % Paramodulations : 1966
% 0.18/0.50 % Factorizations : 0
% 0.18/0.50 % NegExts : 0
% 0.18/0.50 % Equation resolutions : 79
% 0.18/0.50 % Disequality decompositions : 0
% 0.18/0.50 % Total rewrite steps : 1327
% 0.18/0.50 % ...of those cached : 1208
% 0.18/0.50 % Propositional unsat checks : 0
% 0.18/0.50 % Propositional check models : 0
% 0.18/0.50 % Propositional check unsatisfiable : 0
% 0.18/0.50 % Propositional clauses : 0
% 0.18/0.50 % Propositional clauses after purity: 0
% 0.18/0.50 % Propositional unsat core size : 0
% 0.18/0.50 % Propositional preprocessing time : 0.000
% 0.18/0.50 % Propositional encoding time : 0.000
% 0.18/0.50 % Propositional solver time : 0.000
% 0.18/0.50 % Success case prop preproc time : 0.000
% 0.18/0.50 % Success case prop encoding time : 0.000
% 0.18/0.50 % Success case prop solver time : 0.000
% 0.18/0.50 % Current number of processed clauses : 330
% 0.18/0.50 % Positive orientable unit clauses : 69
% 0.18/0.50 % Positive unorientable unit clauses: 0
% 0.18/0.50 % Negative unit clauses : 5
% 0.18/0.50 % Non-unit-clauses : 256
% 0.18/0.50 % Current number of unprocessed clauses: 1520
% 0.18/0.50 % ...number of literals in the above : 7277
% 0.18/0.50 % Current number of archived formulas : 0
% 0.18/0.50 % Current number of archived clauses : 248
% 0.18/0.50 % Clause-clause subsumption calls (NU) : 28816
% 0.18/0.50 % Rec. Clause-clause subsumption calls : 8155
% 0.18/0.50 % Non-unit clause-clause subsumptions : 106
% 0.18/0.50 % Unit Clause-clause subsumption calls : 292
% 0.18/0.50 % Rewrite failures with RHS unbound : 0
% 0.18/0.50 % BW rewrite match attempts : 1
% 0.18/0.50 % BW rewrite match successes : 1
% 0.18/0.50 % Condensation attempts : 0
% 0.18/0.50 % Condensation successes : 0
% 0.18/0.50 % Termbank termtop insertions : 45301
% 0.18/0.50 % Search garbage collected termcells : 530
% 0.18/0.50
% 0.18/0.50 % -------------------------------------------------
% 0.18/0.50 % User time : 0.045 s
% 0.18/0.50 % System time : 0.007 s
% 0.18/0.50 % Total time : 0.052 s
% 0.18/0.50 % Maximum resident set size: 4068 pages
% 0.18/0.50
% 0.18/0.50 % -------------------------------------------------
% 0.18/0.50 % User time : 0.205 s
% 0.18/0.50 % System time : 0.023 s
% 0.18/0.50 % Total time : 0.228 s
% 0.18/0.50 % Maximum resident set size: 5120 pages
% 0.18/0.50 % E exiting
%------------------------------------------------------------------------------