%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC083-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 : n019.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:55 PM UTC 2026
% Result : Unsatisfiable 1.89s 0.70s
% Output : CNFRefutation 1.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 25
% Syntax : Number of clauses : 121 ( 40 unt; 3 nHn; 121 RR)
% Number of literals : 316 ( 99 equ; 198 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 129 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(co1_13,negated_conjecture,
app(sk5,sk7) = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause151,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != app(X3,X2)
| X1 = X3 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause151) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_9,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_11,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(clause119,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(co1_12,negated_conjecture,
app(app(sk5,sk6),sk7) = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
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(clause172,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause172) ).
cnf(co1_10,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_8,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause57,axiom,
( ~ ssList(X1)
| segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(clause150,axiom,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != app(X1,X3)
| X2 = X3 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause150) ).
cnf(clause118,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(clause152,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X2,X3)
| ~ segmentP(X1,X2)
| segmentP(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause152) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
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(c_0_25,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_26,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_27,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_28,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_29,negated_conjecture,
app(sk5,sk7) = sk4,
co1_13 ).
cnf(c_0_30,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_31,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != app(X3,X2)
| X1 = X3 ),
inference(fof_simplification,[status(thm)],[clause151]) ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_25 ).
cnf(c_0_33,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_26 ).
cnf(c_0_34,axiom,
ssList(nil),
clause8 ).
cnf(c_0_35,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_27 ).
cnf(c_0_36,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_28 ).
cnf(c_0_37,negated_conjecture,
app(sk5,sk7) = sk2,
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_38,negated_conjecture,
ssList(sk5),
co1_9 ).
cnf(c_0_39,negated_conjecture,
ssList(sk7),
co1_11 ).
cnf(c_0_40,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != app(X3,X2)
| X1 = X3 ),
c_0_31 ).
cnf(c_0_41,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| app(X1,app(X2,nil)) = app(X1,X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]),c_0_35]) ).
cnf(c_0_42,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| app(nil,app(X1,X2)) = app(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_36]),c_0_34])]) ).
cnf(c_0_43,negated_conjecture,
( ~ ssList(X1)
| app(sk5,app(sk7,X1)) = app(sk2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_37]),c_0_38]),c_0_39])]) ).
cnf(c_0_44,negated_conjecture,
( ~ ssList(X1)
| app(X1,sk7) != sk2
| X1 = sk5 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_37]),c_0_38]),c_0_39])]) ).
cnf(c_0_45,plain,
( ~ ssList(X1)
| app(X1,nil) = app(nil,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_34])]) ).
cnf(c_0_46,negated_conjecture,
app(sk2,nil) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_32]),c_0_37]),c_0_34]),c_0_39])]) ).
cnf(c_0_47,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_48,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| app(X1,app(X2,sk7)) != sk2
| app(X1,X2) = sk5 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_33]),c_0_39])]),c_0_35]) ).
cnf(c_0_49,negated_conjecture,
app(sk5,app(nil,sk7)) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_45]),c_0_46]),c_0_34]),c_0_39])]) ).
cnf(c_0_50,negated_conjecture,
app(app(sk5,sk6),sk7) = sk3,
co1_12 ).
cnf(c_0_51,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_52,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
c_0_47 ).
cnf(c_0_53,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_54,negated_conjecture,
app(sk5,nil) = sk5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_38]),c_0_34])]) ).
cnf(c_0_55,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
inference(fof_simplification,[status(thm)],[clause172]) ).
cnf(c_0_56,negated_conjecture,
app(app(sk5,sk6),sk7) = sk1,
inference(rw,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_57,negated_conjecture,
( sk2 != nil
| sk7 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_37]),c_0_39]),c_0_38])]) ).
cnf(c_0_58,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
c_0_53 ).
cnf(c_0_59,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ssList(app(X1,app(X2,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_33]),c_0_35]) ).
cnf(c_0_60,negated_conjecture,
( ~ ssList(X1)
| app(sk5,app(nil,X1)) = app(sk5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_54]),c_0_38]),c_0_34])]) ).
cnf(c_0_61,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
c_0_55 ).
cnf(c_0_62,negated_conjecture,
( sk2 != nil
| app(app(sk5,sk6),nil) = sk1 ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_63,negated_conjecture,
ssList(sk6),
co1_10 ).
cnf(c_0_64,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_65,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_66,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_58]) ).
cnf(c_0_67,negated_conjecture,
app(nil,sk5) = sk5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_54]),c_0_38]),c_0_34])]) ).
cnf(c_0_68,negated_conjecture,
( ~ ssList(X1)
| ssList(app(sk5,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_38]),c_0_34])]) ).
cnf(c_0_69,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ segmentP(X1,X3)
| segmentP(app(X1,X2),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_36]),c_0_34])]) ).
cnf(c_0_70,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_71,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != app(X1,X3)
| X2 = X3 ),
inference(fof_simplification,[status(thm)],[clause150]) ).
cnf(c_0_72,negated_conjecture,
( sk2 != nil
| app(sk5,app(sk6,nil)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_33]),c_0_38]),c_0_63]),c_0_34])]) ).
cnf(c_0_73,negated_conjecture,
( sk2 != nil
| app(sk5,nil) = sk2 ),
inference(spm,[status(thm)],[c_0_37,c_0_57]) ).
cnf(c_0_74,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_75,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
c_0_64 ).
cnf(c_0_76,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_65 ).
cnf(c_0_77,negated_conjecture,
( ~ ssList(X1)
| segmentP(app(sk5,X1),sk5) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_38]),c_0_34])]),c_0_68]) ).
cnf(c_0_78,negated_conjecture,
app(sk5,app(sk6,sk7)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_33]),c_0_38]),c_0_63]),c_0_39])]) ).
cnf(c_0_79,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk5,X1)
| segmentP(sk2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_37]),c_0_39]),c_0_38])]) ).
cnf(c_0_80,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
c_0_70 ).
cnf(c_0_81,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != app(X1,X3)
| X2 = X3 ),
c_0_71 ).
cnf(c_0_82,negated_conjecture,
( sk2 != nil
| app(sk5,sk6) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_32]),c_0_63])]) ).
cnf(c_0_83,negated_conjecture,
( sk2 != nil
| sk5 = sk2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_73]),c_0_38])]) ).
cnf(c_0_84,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
c_0_74 ).
cnf(c_0_85,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1)
| nil = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_34])]) ).
cnf(c_0_86,negated_conjecture,
( ~ ssList(app(sk6,sk7))
| segmentP(sk1,sk5) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_87,negated_conjecture,
segmentP(sk2,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_38])]) ).
cnf(c_0_88,negated_conjecture,
( ~ ssList(X1)
| app(sk5,X1) != sk2
| X1 = sk7 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_37]),c_0_39]),c_0_38])]) ).
cnf(c_0_89,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(sk7,X2)
| segmentP(app(sk2,X1),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_37]),c_0_38]),c_0_39])]) ).
cnf(c_0_90,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_91,negated_conjecture,
( sk2 != nil
| app(sk2,sk6) = sk1 ),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_92,negated_conjecture,
( sk2 != nil
| sk5 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_37]),c_0_39]),c_0_38])]) ).
cnf(c_0_93,negated_conjecture,
( ~ ssList(app(sk6,sk7))
| sk5 = nil ),
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_38])]) ).
cnf(c_0_94,negated_conjecture,
( ~ ssList(app(nil,sk7))
| app(nil,sk7) = sk7 ),
inference(spm,[status(thm)],[c_0_88,c_0_49]) ).
cnf(c_0_95,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_96,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk7,X1)
| segmentP(sk2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_32]),c_0_34]),c_0_90])]) ).
cnf(c_0_97,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk7,X1)
| sk2 != nil
| segmentP(sk1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_91]),c_0_63])]) ).
cnf(c_0_98,negated_conjecture,
( sk2 != nil
| app(nil,sk7) = sk2 ),
inference(spm,[status(thm)],[c_0_37,c_0_92]) ).
cnf(c_0_99,negated_conjecture,
sk5 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_35]),c_0_63]),c_0_39])]) ).
cnf(c_0_100,negated_conjecture,
app(nil,sk7) = sk7,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_35]),c_0_34]),c_0_39])]) ).
cnf(c_0_101,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X2,X3)
| ~ segmentP(X1,X2)
| segmentP(X1,X3) ),
c_0_95 ).
cnf(c_0_102,negated_conjecture,
segmentP(sk2,sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_80]),c_0_39])]) ).
cnf(c_0_103,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_104,negated_conjecture,
( sk2 != nil
| segmentP(sk1,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_80]),c_0_39])]) ).
cnf(c_0_105,negated_conjecture,
( sk2 != nil
| sk7 = sk2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_98]),c_0_39])]) ).
cnf(c_0_106,negated_conjecture,
sk7 = sk2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_99]),c_0_100]) ).
cnf(c_0_107,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(X1,sk2)
| segmentP(X1,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_39]),c_0_90])]) ).
cnf(c_0_108,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_109,negated_conjecture,
( ~ segmentP(sk2,sk2)
| ~ segmentP(sk1,sk2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_103]),c_0_90])]) ).
cnf(c_0_110,negated_conjecture,
( sk2 != nil
| segmentP(sk1,sk2) ),
inference(spm,[status(thm)],[c_0_104,c_0_105]) ).
cnf(c_0_111,negated_conjecture,
( sk2 != nil
| segmentP(sk2,sk2) ),
inference(spm,[status(thm)],[c_0_102,c_0_105]) ).
cnf(c_0_112,negated_conjecture,
app(nil,app(sk6,sk2)) = sk1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_99]),c_0_106]) ).
cnf(c_0_113,negated_conjecture,
( ~ segmentP(sk1,sk2)
| sk7 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_107]),c_0_102]),c_0_39]),c_0_108])]) ).
cnf(c_0_114,negated_conjecture,
sk2 != nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_111]) ).
cnf(c_0_115,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ segmentP(X2,X3)
| segmentP(app(X1,X2),X3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_32]),c_0_34])]),c_0_35]) ).
cnf(c_0_116,negated_conjecture,
app(sk6,sk2) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_112]),c_0_63]),c_0_90])]) ).
cnf(c_0_117,negated_conjecture,
~ segmentP(sk1,sk2),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_113,c_0_106]),c_0_114]) ).
cnf(c_0_118,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk2,X1)
| segmentP(sk1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_116]),c_0_63]),c_0_90])]) ).
cnf(c_0_119,negated_conjecture,
segmentP(sk2,sk2),
inference(rw,[status(thm)],[c_0_102,c_0_106]) ).
cnf(c_0_120,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_119]),c_0_90])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC083-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.12/0.38 % Computer : n019.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 07:54:20 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/0.43 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
% 1.89/0.70 % Version: 3.5.1
% 1.89/0.70 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.89/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.89/0.70 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.89/0.70 % Starting new_bool_3 with 300s (1) cores
% 1.89/0.70 % Starting new_bool_1 with 300s (1) cores
% 1.89/0.70 % Starting sh5l with 300s (1) cores
% 1.89/0.70 % new_bool_3 with pid 2076244 completed with status 0
% 1.89/0.70 % Result found by new_bool_3
% 1.89/0.70 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.89/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.89/0.70 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.89/0.70 % Starting new_bool_3 with 300s (1) cores
% 1.89/0.70 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.89/0.70 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.89/0.70 % Search class: FGHSF-FFMM22-SFFFFFNN
% 1.89/0.70 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.89/0.70 % Starting SubtermCWHack with 31s (1) cores
% 1.89/0.70 % SubtermCWHack with pid 2076247 completed with status 0
% 1.89/0.70 % Result found by SubtermCWHack
% 1.89/0.70 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.89/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.89/0.70 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.89/0.70 % Starting new_bool_3 with 300s (1) cores
% 1.89/0.70 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.89/0.70 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.89/0.70 % Search class: FGHSF-FFMM22-SFFFFFNN
% 1.89/0.70 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.89/0.70 % Starting SubtermCWHack with 31s (1) cores
% 1.89/0.70 % Preprocessing time : 0.003 s
% 1.89/0.70
% 1.89/0.70 % Proof found!
% 1.89/0.70 % SZS status Unsatisfiable
% 1.89/0.70 % SZS output start CNFRefutation
% See solution above
% 1.89/0.70 % Parsed axioms : 198
% 1.89/0.70 % Removed by relevancy pruning/SinE : 156
% 1.89/0.70 % Initial clauses : 42
% 1.89/0.70 % Removed in clause preprocessing : 0
% 1.89/0.70 % Initial clauses in saturation : 42
% 1.89/0.70 % Processed clauses : 2031
% 1.89/0.70 % ...of these trivial : 124
% 1.89/0.70 % ...subsumed : 1323
% 1.89/0.70 % ...remaining for further processing : 584
% 1.89/0.70 % Other redundant clauses eliminated : 13
% 1.89/0.70 % Clauses deleted for lack of memory : 0
% 1.89/0.70 % Backward-subsumed : 260
% 1.89/0.70 % Backward-rewritten : 149
% 1.89/0.70 % Generated clauses : 9448
% 1.89/0.70 % ...of the previous two non-redundant : 8123
% 1.89/0.70 % ...aggressively subsumed : 0
% 1.89/0.70 % Contextual simplify-reflections : 45
% 1.89/0.70 % Paramodulations : 9432
% 1.89/0.70 % Factorizations : 0
% 1.89/0.70 % NegExts : 0
% 1.89/0.70 % Equation resolutions : 17
% 1.89/0.70 % Disequality decompositions : 0
% 1.89/0.70 % Total rewrite steps : 10857
% 1.89/0.70 % ...of those cached : 10825
% 1.89/0.70 % Propositional unsat checks : 0
% 1.89/0.70 % Propositional check models : 0
% 1.89/0.70 % Propositional check unsatisfiable : 0
% 1.89/0.70 % Propositional clauses : 0
% 1.89/0.70 % Propositional clauses after purity: 0
% 1.89/0.70 % Propositional unsat core size : 0
% 1.89/0.70 % Propositional preprocessing time : 0.000
% 1.89/0.70 % Propositional encoding time : 0.000
% 1.89/0.70 % Propositional solver time : 0.000
% 1.89/0.70 % Success case prop preproc time : 0.000
% 1.89/0.70 % Success case prop encoding time : 0.000
% 1.89/0.70 % Success case prop solver time : 0.000
% 1.89/0.70 % Current number of processed clauses : 170
% 1.89/0.70 % Positive orientable unit clauses : 21
% 1.89/0.70 % Positive unorientable unit clauses: 0
% 1.89/0.70 % Negative unit clauses : 10
% 1.89/0.70 % Non-unit-clauses : 139
% 1.89/0.70 % Current number of unprocessed clauses: 5105
% 1.89/0.70 % ...number of literals in the above : 25801
% 1.89/0.70 % Current number of archived formulas : 0
% 1.89/0.70 % Current number of archived clauses : 409
% 1.89/0.70 % Clause-clause subsumption calls (NU) : 27072
% 1.89/0.70 % Rec. Clause-clause subsumption calls : 16580
% 1.89/0.70 % Non-unit clause-clause subsumptions : 1209
% 1.89/0.70 % Unit Clause-clause subsumption calls : 793
% 1.89/0.70 % Rewrite failures with RHS unbound : 0
% 1.89/0.70 % BW rewrite match attempts : 11
% 1.89/0.70 % BW rewrite match successes : 11
% 1.89/0.70 % Condensation attempts : 0
% 1.89/0.70 % Condensation successes : 0
% 1.89/0.70 % Termbank termtop insertions : 138696
% 1.89/0.70 % Search garbage collected termcells : 911
% 1.89/0.70
% 1.89/0.70 % -------------------------------------------------
% 1.89/0.70 % User time : 0.236 s
% 1.89/0.70 % System time : 0.008 s
% 1.89/0.70 % Total time : 0.245 s
% 1.89/0.70 % Maximum resident set size: 3812 pages
% 1.89/0.70
% 1.89/0.70 % -------------------------------------------------
% 1.89/0.70 % User time : 0.243 s
% 1.89/0.70 % System time : 0.016 s
% 1.89/0.70 % Total time : 0.259 s
% 1.89/0.70 % Maximum resident set size: 5120 pages
% 1.89/0.70 % E exiting
%------------------------------------------------------------------------------