%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC078-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 : n010.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:49 PM UTC 2026
% Result : Unsatisfiable 151.26s 22.83s
% Output : CNFRefutation 151.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 30
% Syntax : Number of clauses : 109 ( 26 unt; 19 nHn; 95 RR)
% Number of literals : 322 ( 72 equ; 212 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 : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 166 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_11,negated_conjecture,
( nil = sk4
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_9,negated_conjecture,
( nil = sk4
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
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_13,negated_conjecture,
( nil = sk3
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_10,negated_conjecture,
( nil = sk3
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
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/sandbox/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/sandbox/benchmark/Axioms/SWC001-0.ax',clause169) ).
cnf(clause138,axiom,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause138) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(clause72,axiom,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(co1_7,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(clause102,axiom,
( ~ ssItem(X2)
| ~ ssItem(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause102) ).
cnf(clause173,axiom,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
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(clause178,axiom,
( ~ ssItem(X3)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X2)
| X3 != X4
| ~ frontsegP(X1,X2)
| frontsegP(cons(X3,X1),cons(X4,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause178) ).
cnf(clause132,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause132) ).
cnf(clause60,axiom,
( ~ ssList(X1)
| frontsegP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause60) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(co1_14,negated_conjecture,
( nil = sk3
| memberP(sk4,sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(c_0_30,negated_conjecture,
( nil != sk1
| nil != sk2 ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_31,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_32,negated_conjecture,
( nil != sk1
| nil != sk2 ),
c_0_30 ).
cnf(c_0_33,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_34,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_35,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_31 ).
cnf(c_0_36,negated_conjecture,
( nil = sk4
| cons(sk5,nil) = sk3 ),
co1_11 ).
cnf(c_0_37,axiom,
ssList(nil),
clause8 ).
cnf(c_0_38,negated_conjecture,
( nil = sk4
| ssItem(sk5) ),
co1_9 ).
cnf(c_0_39,negated_conjecture,
( sk4 != nil
| sk3 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_40,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_41,negated_conjecture,
( nil = sk3
| cons(sk5,nil) = sk3 ),
co1_13 ).
cnf(c_0_42,negated_conjecture,
sk3 != nil,
inference(csr,[status(thm)],[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]),c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( nil = sk3
| ssItem(sk5) ),
co1_10 ).
cnf(c_0_44,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_45,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_46,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
inference(fof_simplification,[status(thm)],[clause138]) ).
cnf(c_0_47,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_48,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_40 ).
cnf(c_0_49,negated_conjecture,
cons(sk5,nil) = sk3,
inference(sr,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_50,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[c_0_43,c_0_42]) ).
cnf(c_0_51,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_52,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_44 ).
cnf(c_0_53,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
c_0_45 ).
cnf(c_0_54,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_55,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_56,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
c_0_46 ).
cnf(c_0_57,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_58,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_47 ).
cnf(c_0_59,negated_conjecture,
( ~ ssList(X1)
| app(sk3,X1) = cons(sk5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]) ).
cnf(c_0_60,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_51,c_0_33]) ).
cnf(c_0_61,plain,
( ~ duplicatefreeP(X4)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(X1,cons(X2,X3)) != X4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_55])]) ).
cnf(c_0_62,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| memberP(cons(X1,X2),X1) ),
inference(er,[status(thm)],[c_0_56]) ).
cnf(c_0_63,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
c_0_57 ).
cnf(c_0_64,negated_conjecture,
( ~ ssList(X1)
| ssList(cons(sk5,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60])]) ).
cnf(c_0_65,negated_conjecture,
( ~ duplicatefreeP(X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ memberP(X1,sk5)
| app(X1,sk3) != X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_49]),c_0_50]),c_0_37])]) ).
cnf(c_0_66,negated_conjecture,
memberP(sk3,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_49]),c_0_50]),c_0_37])]) ).
cnf(c_0_67,negated_conjecture,
( ~ ssList(X2)
| duplicatefreeP(cons(sk5,X2))
| ssItem(X1) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_68,negated_conjecture,
( ~ duplicatefreeP(X1)
| ~ ssList(X1)
| cons(sk5,sk3) != X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_59]),c_0_66]),c_0_60])]) ).
cnf(c_0_69,negated_conjecture,
( duplicatefreeP(cons(sk5,sk3))
| ssItem(X1) ),
inference(spm,[status(thm)],[c_0_67,c_0_60]) ).
cnf(c_0_70,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_71,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_72,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause102]) ).
cnf(c_0_73,negated_conjecture,
( ~ ssList(cons(sk5,sk3))
| ssItem(X1) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_74,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_70 ).
cnf(c_0_75,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_76,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_77,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_78,plain,
( ~ ssItem(X3)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X2)
| X3 != X4
| ~ frontsegP(X1,X2)
| frontsegP(cons(X3,X1),cons(X4,X2)) ),
inference(fof_simplification,[status(thm)],[clause178]) ).
cnf(c_0_79,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
c_0_71 ).
cnf(c_0_80,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_72 ).
cnf(c_0_81,negated_conjecture,
ssItem(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_50]),c_0_60])]) ).
cnf(c_0_82,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
c_0_75 ).
cnf(c_0_83,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_76 ).
cnf(c_0_84,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_85,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_77 ).
cnf(c_0_86,plain,
( ~ ssItem(X3)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X2)
| X3 != X4
| ~ frontsegP(X1,X2)
| frontsegP(cons(X3,X1),cons(X4,X2)) ),
c_0_78 ).
cnf(c_0_87,plain,
( ~ ssList(X1)
| frontsegP(X1,nil) ),
inference(fof_simplification,[status(thm)],[clause60]) ).
cnf(c_0_88,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk4,X1)
| ~ segmentP(sk3,X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_33]),c_0_34]) ).
cnf(c_0_89,plain,
( neq(X2,X1)
| X1 = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_81]),c_0_81])]) ).
cnf(c_0_90,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| app(X2,X3) != X1
| segmentP(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_37])]) ).
cnf(c_0_91,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
c_0_84 ).
cnf(c_0_92,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_93,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X1)
| app(X3,app(X2,X4)) != X1
| segmentP(X1,X2) ),
inference(spm,[status(thm)],[c_0_82,c_0_85]) ).
cnf(c_0_94,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1)
| ~ frontsegP(X2,X3)
| frontsegP(cons(X1,X2),cons(X1,X3)) ),
inference(er,[status(thm)],[c_0_86]) ).
cnf(c_0_95,plain,
( ~ ssList(X1)
| frontsegP(X1,nil) ),
c_0_87 ).
cnf(c_0_96,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk4,X1)
| ~ segmentP(sk3,X1)
| nil = X1 ),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_97,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X1,X2)
| segmentP(X1,X2) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_92])])]) ).
cnf(c_0_98,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| app(X2,cons(sk5,X3)) != X1
| segmentP(X1,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_59]),c_0_60])]) ).
cnf(c_0_99,plain,
( ~ ssList(X1)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_81])]) ).
cnf(c_0_100,negated_conjecture,
( ~ ssList(X1)
| frontsegP(cons(sk5,X1),sk3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_49]),c_0_50]),c_0_37])]),c_0_95]) ).
cnf(c_0_101,negated_conjecture,
( nil = sk3
| memberP(sk4,sk5) ),
co1_14 ).
cnf(c_0_102,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_103,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk4,X1)
| ~ frontsegP(sk3,X1)
| nil = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_60])]) ).
cnf(c_0_104,negated_conjecture,
( ~ ssList(X1)
| ~ memberP(X1,sk5)
| segmentP(X1,sk3) ),
inference(er,[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_54]),c_0_55])])]) ).
cnf(c_0_105,negated_conjecture,
frontsegP(sk3,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_49]),c_0_37])]) ).
cnf(c_0_106,negated_conjecture,
memberP(sk4,sk5),
inference(sr,[status(thm)],[c_0_101,c_0_42]) ).
cnf(c_0_107,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_102,c_0_34]) ).
cnf(c_0_108,negated_conjecture,
$false,
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(spm,[status(thm)],[c_0_103,c_0_104]),c_0_105]),c_0_60]),c_0_106]),c_0_107])]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC078-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.47 % Computer : n010.cluster.edu
% 0.19/0.47 % Model : x86_64 x86_64
% 0.19/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.47 % Memory : 8046.5625MB
% 0.19/0.47 % OS : Linux 6.8.0-71-generic
% 0.19/0.47 % CPULimit : 300
% 0.19/0.47 % WCLimit : 300
% 0.19/0.47 % DateTime : Mon Sep 21 07:54:09 UTC 2026
% 0.19/0.47 % CPUTime :
% 0.19/0.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.55 Running first-order theorem proving
% 0.24/0.55 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
% 151.26/22.83 % Version: 3.5.1
% 151.26/22.83 % Preprocessing class: FSLSSMSMSSSNFFN.
% 151.26/22.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 151.26/22.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 151.26/22.83 % Starting new_bool_3 with 300s (1) cores
% 151.26/22.83 % Starting new_bool_1 with 300s (1) cores
% 151.26/22.83 % Starting sh5l with 300s (1) cores
% 151.26/22.83 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 412182 completed with status 0
% 151.26/22.83 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 151.26/22.83 % Preprocessing class: FSLSSMSMSSSNFFN.
% 151.26/22.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 151.26/22.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 151.26/22.83 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 151.26/22.83 % No SInE strategy applied
% 151.26/22.83 % Search class: FGHSM-FSLM21-MFFFFFNN
% 151.26/22.83 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 151.26/22.83 % Starting SubtermCWHack with 136s (1) cores
% 151.26/22.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 151.26/22.83 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 151.26/22.83 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 151.26/22.83 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 151.26/22.83 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 412190 completed with status 0
% 151.26/22.83 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN
% 151.26/22.83 % Preprocessing class: FSLSSMSMSSSNFFN.
% 151.26/22.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 151.26/22.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 151.26/22.83 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 151.26/22.83 % No SInE strategy applied
% 151.26/22.83 % Search class: FGHSM-FSLM21-MFFFFFNN
% 151.26/22.83 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 151.26/22.83 % Starting SubtermCWHack with 136s (1) cores
% 151.26/22.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 151.26/22.83 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 151.26/22.83 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 151.26/22.83 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 151.26/22.83 % Preprocessing time : 0.007 s
% 151.26/22.83
% 151.26/22.83 % Proof found!
% 151.26/22.83 % SZS status Unsatisfiable
% 151.26/22.83 % SZS output start CNFRefutation
% See solution above
% 151.26/22.84 % Parsed axioms : 199
% 151.26/22.84 % Removed by relevancy pruning/SinE : 0
% 151.26/22.84 % Initial clauses : 199
% 151.26/22.84 % Removed in clause preprocessing : 0
% 151.26/22.84 % Initial clauses in saturation : 199
% 151.26/22.84 % Processed clauses : 16485
% 151.26/22.84 % ...of these trivial : 353
% 151.26/22.84 % ...subsumed : 10155
% 151.26/22.84 % ...remaining for further processing : 5977
% 151.26/22.84 % Other redundant clauses eliminated : 383
% 151.26/22.84 % Clauses deleted for lack of memory : 0
% 151.26/22.84 % Backward-subsumed : 550
% 151.26/22.84 % Backward-rewritten : 272
% 151.26/22.84 % Generated clauses : 366329
% 151.26/22.84 % ...of the previous two non-redundant : 351761
% 151.26/22.84 % ...aggressively subsumed : 0
% 151.26/22.84 % Contextual simplify-reflections : 843
% 151.26/22.84 % Paramodulations : 364940
% 151.26/22.84 % Factorizations : 484
% 151.26/22.84 % NegExts : 0
% 151.26/22.84 % Equation resolutions : 865
% 151.26/22.84 % Disequality decompositions : 0
% 151.26/22.84 % Total rewrite steps : 154700
% 151.26/22.84 % ...of those cached : 151213
% 151.26/22.84 % Propositional unsat checks : 1
% 151.26/22.84 % Propositional check models : 0
% 151.26/22.84 % Propositional check unsatisfiable : 0
% 151.26/22.84 % Propositional clauses : 0
% 151.26/22.84 % Propositional clauses after purity: 0
% 151.26/22.84 % Propositional unsat core size : 0
% 151.26/22.84 % Propositional preprocessing time : 0.000
% 151.26/22.84 % Propositional encoding time : 1.868
% 151.26/22.84 % Propositional solver time : 1.058
% 151.26/22.84 % Success case prop preproc time : 0.000
% 151.26/22.84 % Success case prop encoding time : 0.000
% 151.26/22.84 % Success case prop solver time : 0.000
% 151.26/22.84 % Current number of processed clauses : 5110
% 151.26/22.84 % Positive orientable unit clauses : 234
% 151.26/22.84 % Positive unorientable unit clauses: 0
% 151.26/22.84 % Negative unit clauses : 117
% 151.26/22.84 % Non-unit-clauses : 4759
% 151.26/22.84 % Current number of unprocessed clauses: 324828
% 151.26/22.84 % ...number of literals in the above : 1864279
% 151.26/22.84 % Current number of archived formulas : 0
% 151.26/22.84 % Current number of archived clauses : 862
% 151.26/22.84 % Clause-clause subsumption calls (NU) : 3223641
% 151.26/22.84 % Rec. Clause-clause subsumption calls : 900285
% 151.26/22.84 % Non-unit clause-clause subsumptions : 6258
% 151.26/22.84 % Unit Clause-clause subsumption calls : 43373
% 151.26/22.84 % Rewrite failures with RHS unbound : 0
% 151.26/22.84 % BW rewrite match attempts : 119
% 151.26/22.84 % BW rewrite match successes : 91
% 151.26/22.84 % Condensation attempts : 0
% 151.26/22.84 % Condensation successes : 0
% 151.26/22.84 % Termbank termtop insertions : 16061412
% 151.26/22.84 % Search garbage collected termcells : 541
% 151.26/22.84
% 151.26/22.84 % -------------------------------------------------
% 151.26/22.84 % User time : 20.991 s
% 151.26/22.84 % System time : 0.656 s
% 151.26/22.84 % Total time : 21.647 s
% 151.26/22.84 % Maximum resident set size: 3812 pages
% 151.26/22.84
% 151.26/22.84 % -------------------------------------------------
% 151.26/22.84 % User time : 103.633 s
% 151.26/22.84 % System time : 3.172 s
% 151.26/22.84 % Total time : 106.805 s
% 151.26/22.84 % Maximum resident set size: 4864 pages
% 151.26/22.84 % E exiting
%------------------------------------------------------------------------------