%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC073-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 : 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:42:53 PM UTC 2026
% Result : Unsatisfiable 186.15s 32.58s
% Output : CNFRefutation 186.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 24
% Syntax : Number of clauses : 109 ( 20 unt; 32 nHn; 109 RR)
% Number of literals : 326 ( 118 equ; 194 neg)
% Maximal clause size : 12 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 105 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause173,axiom,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(clause75,axiom,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_9,negated_conjecture,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
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(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(clause104,axiom,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause76,axiom,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).
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_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(co1_8,negated_conjecture,
( nil != sk4
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_7,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause145,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause145) ).
cnf(clause157,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(co1_10,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk3,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause79,axiom,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause79) ).
cnf(clause56,axiom,
( ~ ssList(X1)
| segmentP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause56) ).
cnf(c_0_24,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
inference(fof_simplification,[status(thm)],[clause173]) ).
cnf(c_0_25,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_26,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_27,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_28,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
c_0_24 ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_30,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_31,negated_conjecture,
( nil != sk1
| nil != sk2 ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_32,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
c_0_25 ).
cnf(c_0_34,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(app(app(X1,X2),X3))
| segmentP(app(app(X1,X2),X3),X2) ),
inference(er,[status(thm)],[c_0_28]) ).
cnf(c_0_36,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_29 ).
cnf(c_0_37,axiom,
ssList(nil),
clause8 ).
cnf(c_0_38,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_30 ).
cnf(c_0_39,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_40,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_42,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_43,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_44,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_45,negated_conjecture,
( nil != sk4
| nil = sk3 ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_46,negated_conjecture,
( nil != sk1
| nil != sk2 ),
c_0_31 ).
cnf(c_0_47,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_48,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_32 ).
cnf(c_0_49,negated_conjecture,
( ssList(tl(sk3))
| sk3 = nil ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_50,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| segmentP(app(X1,X2),X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]),c_0_38]) ).
cnf(c_0_51,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_39 ).
cnf(c_0_52,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
c_0_40 ).
cnf(c_0_53,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
c_0_41 ).
cnf(c_0_54,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_42 ).
cnf(c_0_55,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_56,negated_conjecture,
( nil != sk4
| nil = sk3 ),
c_0_45 ).
cnf(c_0_57,negated_conjecture,
( sk4 != nil
| sk3 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_27]),c_0_44]) ).
cnf(c_0_58,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
c_0_47 ).
cnf(c_0_59,negated_conjecture,
( ~ ssList(X1)
| neq(tl(sk3),X1)
| sk3 = nil
| X1 = tl(sk3) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_60,plain,
( ~ ssList(X2)
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| segmentP(cons(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_61,negated_conjecture,
( sk3 = nil
| cons(hd(sk3),tl(sk3)) = sk3 ),
inference(spm,[status(thm)],[c_0_52,c_0_34]) ).
cnf(c_0_62,negated_conjecture,
( ssItem(hd(sk3))
| sk3 = nil ),
inference(spm,[status(thm)],[c_0_53,c_0_34]) ).
cnf(c_0_63,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_64,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_65,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_54]) ).
cnf(c_0_66,negated_conjecture,
( ~ ssList(X1)
| neq(sk4,X1)
| X1 = sk4 ),
inference(spm,[status(thm)],[c_0_48,c_0_55]) ).
cnf(c_0_67,negated_conjecture,
sk4 != nil,
inference(csr,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_68,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk4,X1)
| ~ segmentP(sk3,X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_27]),c_0_44]) ).
cnf(c_0_69,negated_conjecture,
( neq(tl(sk3),nil)
| sk3 = nil
| tl(sk3) = nil ),
inference(spm,[status(thm)],[c_0_59,c_0_37]) ).
cnf(c_0_70,negated_conjecture,
( ~ ssList(cons(hd(sk3),nil))
| segmentP(sk3,tl(sk3))
| sk3 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_49]),c_0_62]) ).
cnf(c_0_71,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_63 ).
cnf(c_0_72,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_64 ).
cnf(c_0_73,negated_conjecture,
( ~ ssList(tl(sk3))
| ~ ssList(cons(hd(sk3),nil))
| ~ ssItem(hd(sk3))
| ~ neq(sk4,nil)
| ~ neq(nil,sk3)
| app(tl(sk3),cons(hd(sk3),nil)) = sk4 ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_65])])])]),c_0_38]) ).
cnf(c_0_74,negated_conjecture,
neq(sk4,nil),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_37]),c_0_67]) ).
cnf(c_0_75,negated_conjecture,
( ~ segmentP(sk4,tl(sk3))
| ~ segmentP(sk3,tl(sk3))
| sk3 = nil
| tl(sk3) = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_49]) ).
cnf(c_0_76,negated_conjecture,
( segmentP(sk3,tl(sk3))
| sk3 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_37])]),c_0_62]) ).
cnf(c_0_77,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| segmentP(app(X1,X2),X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_72]),c_0_37])]),c_0_38]) ).
cnf(c_0_78,negated_conjecture,
( ~ ssList(tl(sk3))
| ~ ssList(cons(hd(sk3),nil))
| ~ ssItem(hd(sk3))
| ~ neq(nil,sk3)
| app(tl(sk3),cons(hd(sk3),nil)) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_74])]) ).
cnf(c_0_79,plain,
( ~ ssList(X1)
| neq(nil,X1)
| X1 = nil ),
inference(spm,[status(thm)],[c_0_48,c_0_37]) ).
cnf(c_0_80,negated_conjecture,
( ~ segmentP(sk4,tl(sk3))
| sk3 = nil
| tl(sk3) = nil ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_81,negated_conjecture,
( ~ ssList(tl(sk3))
| ~ ssList(cons(hd(sk3),nil))
| ~ ssItem(hd(sk3))
| ~ neq(nil,sk3)
| segmentP(sk4,tl(sk3)) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_82,negated_conjecture,
( neq(nil,sk3)
| sk3 = nil ),
inference(spm,[status(thm)],[c_0_79,c_0_34]) ).
cnf(c_0_83,negated_conjecture,
( ~ ssList(cons(hd(sk3),nil))
| sk3 = nil
| tl(sk3) = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_49]),c_0_62]),c_0_82]) ).
cnf(c_0_84,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
inference(fof_simplification,[status(thm)],[clause145]) ).
cnf(c_0_85,negated_conjecture,
( sk3 = nil
| tl(sk3) = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_71]),c_0_37])]),c_0_62]) ).
cnf(c_0_86,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
inference(fof_simplification,[status(thm)],[clause157]) ).
cnf(c_0_87,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
c_0_84 ).
cnf(c_0_88,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk3,nil) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_89,negated_conjecture,
( sk3 = nil
| cons(hd(sk3),nil) = sk3 ),
inference(spm,[status(thm)],[c_0_61,c_0_85]) ).
cnf(c_0_90,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
c_0_86 ).
cnf(c_0_91,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_87])]),c_0_37])]) ).
cnf(c_0_92,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk3,nil) ),
c_0_88 ).
cnf(c_0_93,negated_conjecture,
( sk3 = nil
| app(tl(sk3),sk3) = sk4 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_89]),c_0_34])]),c_0_49]),c_0_62]),c_0_82]) ).
cnf(c_0_94,plain,
( ~ ssItem(X1)
| app(cons(X1,nil),nil) = cons(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_37])]) ).
cnf(c_0_95,negated_conjecture,
neq(sk3,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_74])]) ).
cnf(c_0_96,negated_conjecture,
( sk3 = nil
| app(nil,sk3) = sk4 ),
inference(spm,[status(thm)],[c_0_93,c_0_85]) ).
cnf(c_0_97,negated_conjecture,
( sk3 = nil
| app(sk3,nil) = sk3 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_89]),c_0_62]) ).
cnf(c_0_98,plain,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause79]) ).
cnf(c_0_99,negated_conjecture,
( ~ segmentP(sk4,sk3)
| ~ segmentP(sk3,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_95]),c_0_34])]) ).
cnf(c_0_100,negated_conjecture,
( sk4 = sk3
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_96]),c_0_34])]) ).
cnf(c_0_101,negated_conjecture,
( segmentP(sk3,sk3)
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_97]),c_0_37]),c_0_34])]) ).
cnf(c_0_102,plain,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
c_0_98 ).
cnf(c_0_103,negated_conjecture,
sk3 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_101]) ).
cnf(c_0_104,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_102]),c_0_37])]) ).
cnf(c_0_105,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
inference(fof_simplification,[status(thm)],[clause56]) ).
cnf(c_0_106,negated_conjecture,
~ segmentP(sk4,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_103]),c_0_103]),c_0_104]),c_0_103])]) ).
cnf(c_0_107,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
c_0_105 ).
cnf(c_0_108,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_107]),c_0_55])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC073-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.09/0.36 % Computer : n009.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 07:53:28 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.45 Running first-order theorem proving
% 0.14/0.45 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
% 186.15/32.58 % Version: 3.5.1
% 186.15/32.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 186.15/32.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 186.15/32.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 186.15/32.58 % Starting new_bool_3 with 300s (1) cores
% 186.15/32.58 % Starting new_bool_1 with 300s (1) cores
% 186.15/32.58 % Starting sh5l with 300s (1) cores
% 186.15/32.58 % new_bool_3 with pid 1250030 completed with status 0
% 186.15/32.58 % Result found by new_bool_3
% 186.15/32.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 186.15/32.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 186.15/32.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 186.15/32.58 % Starting new_bool_3 with 300s (1) cores
% 186.15/32.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 186.15/32.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 186.15/32.58 % Search class: FGHSF-FFMM21-MFFFFFNN
% 186.15/32.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 186.15/32.58 % Starting SubtermCWHack with 31s (1) cores
% 186.15/32.58 % SubtermCWHack with pid 1250033 completed with status 8
% 186.15/32.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 186.15/32.58 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1250042 completed with status 0
% 186.15/32.58 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 186.15/32.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 186.15/32.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 186.15/32.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 186.15/32.58 % Starting new_bool_3 with 300s (1) cores
% 186.15/32.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 186.15/32.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 186.15/32.58 % Search class: FGHSF-FFMM21-MFFFFFNN
% 186.15/32.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 186.15/32.58 % Starting SubtermCWHack with 31s (1) cores
% 186.15/32.58 % SubtermCWHack with pid 1250033 completed with status 8
% 186.15/32.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 186.15/32.58 % Preprocessing time : 0.004 s
% 186.15/32.58 % Presaturation interreduction done
% 186.15/32.58
% 186.15/32.58 % Proof found!
% 186.15/32.58 % SZS status Unsatisfiable
% 186.15/32.58 % SZS output start CNFRefutation
% See solution above
% 186.15/32.58 % Parsed axioms : 196
% 186.15/32.58 % Removed by relevancy pruning/SinE : 121
% 186.15/32.58 % Initial clauses : 75
% 186.15/32.58 % Removed in clause preprocessing : 0
% 186.15/32.58 % Initial clauses in saturation : 75
% 186.15/32.58 % Processed clauses : 1034
% 186.15/32.58 % ...of these trivial : 11
% 186.15/32.58 % ...subsumed : 382
% 186.15/32.58 % ...remaining for further processing : 641
% 186.15/32.58 % Other redundant clauses eliminated : 30
% 186.15/32.58 % Clauses deleted for lack of memory : 0
% 186.15/32.58 % Backward-subsumed : 67
% 186.15/32.58 % Backward-rewritten : 222
% 186.15/32.58 % Generated clauses : 4545
% 186.15/32.58 % ...of the previous two non-redundant : 4363
% 186.15/32.58 % ...aggressively subsumed : 0
% 186.15/32.58 % Contextual simplify-reflections : 126
% 186.15/32.58 % Paramodulations : 4504
% 186.15/32.58 % Factorizations : 0
% 186.15/32.58 % NegExts : 0
% 186.15/32.58 % Equation resolutions : 45
% 186.15/32.58 % Disequality decompositions : 0
% 186.15/32.58 % Total rewrite steps : 1753
% 186.15/32.58 % ...of those cached : 1732
% 186.15/32.58 % Propositional unsat checks : 0
% 186.15/32.58 % Propositional check models : 0
% 186.15/32.58 % Propositional check unsatisfiable : 0
% 186.15/32.58 % Propositional clauses : 0
% 186.15/32.58 % Propositional clauses after purity: 0
% 186.15/32.58 % Propositional unsat core size : 0
% 186.15/32.58 % Propositional preprocessing time : 0.000
% 186.15/32.58 % Propositional encoding time : 0.000
% 186.15/32.58 % Propositional solver time : 0.000
% 186.15/32.58 % Success case prop preproc time : 0.000
% 186.15/32.58 % Success case prop encoding time : 0.000
% 186.15/32.58 % Success case prop solver time : 0.000
% 186.15/32.58 % Current number of processed clauses : 275
% 186.15/32.58 % Positive orientable unit clauses : 20
% 186.15/32.58 % Positive unorientable unit clauses: 0
% 186.15/32.58 % Negative unit clauses : 11
% 186.15/32.58 % Non-unit-clauses : 244
% 186.15/32.58 % Current number of unprocessed clauses: 3469
% 186.15/32.58 % ...number of literals in the above : 17166
% 186.15/32.58 % Current number of archived formulas : 0
% 186.15/32.58 % Current number of archived clauses : 355
% 186.15/32.58 % Clause-clause subsumption calls (NU) : 36784
% 186.15/32.58 % Rec. Clause-clause subsumption calls : 13864
% 186.15/32.58 % Non-unit clause-clause subsumptions : 525
% 186.15/32.58 % Unit Clause-clause subsumption calls : 622
% 186.15/32.58 % Rewrite failures with RHS unbound : 0
% 186.15/32.58 % BW rewrite match attempts : 3
% 186.15/32.58 % BW rewrite match successes : 3
% 186.15/32.58 % Condensation attempts : 0
% 186.15/32.58 % Condensation successes : 0
% 186.15/32.58 % Termbank termtop insertions : 94042
% 186.15/32.58 % Search garbage collected termcells : 867
% 186.15/32.58
% 186.15/32.58 % -------------------------------------------------
% 186.15/32.58 % User time : 30.326 s
% 186.15/32.58 % System time : 1.070 s
% 186.15/32.58 % Total time : 31.396 s
% 186.15/32.58 % Maximum resident set size: 4068 pages
% 186.15/32.58
% 186.15/32.58 % -------------------------------------------------
% 186.15/32.58 % User time : 30.335 s
% 186.15/32.58 % System time : 1.079 s
% 186.15/32.58 % Total time : 31.413 s
% 186.15/32.58 % Maximum resident set size: 4864 pages
% 186.15/32.58 % E exiting
%------------------------------------------------------------------------------