%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC193+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 : n011.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:24 PM UTC 2026
% Result : Theorem 0.15s 0.68s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 13
% Syntax : Number of formulae : 75 ( 27 unt; 0 def)
% Number of atoms : 265 ( 67 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 300 ( 110 ~; 109 |; 27 &)
% ( 4 <=>; 50 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 9 con; 0-2 aty)
% Number of variables : 97 ( 0 sgn 71 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( neq(X4,nil)
& ~ singletonP(X3) )
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ( X5 = X6
| app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8) != X1 ) ) ) ) )
| ~ segmentP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax82,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax27,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax27) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax14,axiom,
! [X1] :
( ssList(X1)
=> ( equalelemsP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X4,cons(X2,cons(X3,X5))) = X1
=> X2 = X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax14) ).
fof(ax73,axiom,
! [X1] :
( ssItem(X1)
=> equalelemsP(cons(X1,nil)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax73) ).
fof(ax4,axiom,
! [X1] :
( ssList(X1)
=> ( singletonP(X1)
<=> ? [X2] :
( cons(X2,nil) = X1
& ssItem(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax4) ).
fof(ax54,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( ( segmentP(X2,X1)
& segmentP(X1,X2) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax54) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(ax74,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax74) ).
fof(c_0_13,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( neq(X4,nil)
& ~ singletonP(X3) )
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ( X5 = X6
| app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8) != X1 ) ) ) ) )
| ~ segmentP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( neq(X4,nil)
& ~ singletonP(X3) )
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ( X5 = X6
| app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8) != X1 ) ) ) ) )
| ~ segmentP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_15,negated_conjecture,
( ( ~ neq(esk51_0,nil)
| singletonP(esk50_0) )
& esk52_0 != esk53_0
& app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk48_0
& ssList(esk55_0)
& ssList(esk54_0)
& ssItem(esk53_0)
& ssItem(esk52_0)
& segmentP(esk51_0,esk50_0)
& esk48_0 = esk50_0
& esk49_0 = esk51_0
& ssList(esk51_0)
& ssList(esk50_0)
& ssList(esk49_0)
& ssList(esk48_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
cnf(c_0_16,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_17,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_18,plain,
! [X224,X225,X226] :
( app(app(X224,X225),X226) = app(X224,app(X225,X226))
| ~ ssList(X226)
| ~ ssList(X225)
| ~ ssList(X224) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
cnf(c_0_19,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk50_0,
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X1,X2),X3) = app(X1,app(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
ssList(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_22,plain,
! [X113,X114] :
( ssList(cons(X114,X113))
| ~ ssItem(X114)
| ~ ssList(X113) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_23,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| ~ ssList(cons(esk53_0,nil))
| app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_24,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_25,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_26,negated_conjecture,
ssItem(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_27,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_28,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_29,plain,
! [X222,X223] :
( cons(X223,X222) = app(cons(X223,nil),X222)
| ~ ssItem(X223)
| ~ ssList(X222) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_30,negated_conjecture,
app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_24]),c_0_25]),c_0_28])]) ).
cnf(c_0_31,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_32,negated_conjecture,
( ~ ssList(cons(esk53_0,nil))
| app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_28])]) ).
cnf(c_0_33,negated_conjecture,
app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_34,negated_conjecture,
ssList(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_35,negated_conjecture,
( ~ ssList(cons(esk52_0,cons(esk53_0,nil)))
| app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0)) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_33]),c_0_34]),c_0_21])]) ).
cnf(c_0_36,negated_conjecture,
( ~ ssList(cons(esk53_0,nil))
| app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0)) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_24]),c_0_28])]) ).
fof(c_0_37,plain,
! [X134,X135,X136] :
( cons(X136,app(X135,X134)) = app(cons(X136,X135),X134)
| ~ ssItem(X136)
| ~ ssList(X135)
| ~ ssList(X134) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])]) ).
cnf(c_0_38,negated_conjecture,
app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_39,plain,
( ~ ssItem(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_40,negated_conjecture,
( ~ ssList(cons(esk53_0,nil))
| app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0))) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_34]),c_0_28])]) ).
fof(c_0_41,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
fof(c_0_42,plain,
! [X102,X103,X104,X105,X106] :
( ( ~ ssList(X102)
| equalelemsP(X102)
| esk40_1(X102) != esk41_1(X102) )
& ( ~ ssList(X102)
| equalelemsP(X102)
| app(esk42_1(X102),cons(esk40_1(X102),cons(esk41_1(X102),esk43_1(X102)))) = X102 )
& ( ~ ssList(X102)
| equalelemsP(X102)
| ssList(esk43_1(X102)) )
& ( ~ ssList(X102)
| equalelemsP(X102)
| ssList(esk42_1(X102)) )
& ( ~ ssList(X102)
| equalelemsP(X102)
| ssItem(esk41_1(X102)) )
& ( ~ ssList(X102)
| equalelemsP(X102)
| ssItem(esk40_1(X102)) )
& ( ~ ssList(X102)
| X103 = X104
| app(X105,cons(X103,cons(X104,X106))) != X102
| ~ ssList(X106)
| ~ ssList(X105)
| ~ ssItem(X104)
| ~ ssItem(X103)
| ~ equalelemsP(X102) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax14])])])])])]) ).
cnf(c_0_43,negated_conjecture,
app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0))) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_24]),c_0_25]),c_0_26])]) ).
fof(c_0_44,plain,
! [X208] :
( equalelemsP(cons(X208,nil))
| ~ ssItem(X208) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax73])])]) ).
fof(c_0_45,plain,
! [X19,X21] :
( ( ~ ssList(X19)
| singletonP(X19)
| cons(X21,nil) != X19
| ~ ssItem(X21) )
& ( ~ ssList(X19)
| ~ singletonP(X19)
| cons(esk5_1(X19),nil) = X19 )
& ( ~ ssList(X19)
| ~ singletonP(X19)
| ssItem(esk5_1(X19)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax4])])])])])]) ).
fof(c_0_46,plain,
! [X111,X112] :
( ( ~ ssList(X111)
| ~ ssList(X112)
| neq(X111,X112)
| X111 = X112 )
& ( ~ ssList(X111)
| ~ ssList(X112)
| X111 != X112
| ~ neq(X111,X112) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_41])])])])]) ).
cnf(c_0_47,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_48,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_49,plain,
( ~ ssList(X1)
| app(X4,cons(X2,cons(X3,X5))) != X1
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssItem(X3)
| ~ ssItem(X2)
| ~ equalelemsP(X1)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_50,negated_conjecture,
app(esk54_0,cons(esk52_0,cons(esk53_0,esk55_0))) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_31]),c_0_34]),c_0_26])]) ).
cnf(c_0_51,negated_conjecture,
esk52_0 != esk53_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_52,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_53,plain,
! [X189,X190] :
( X189 = X190
| ~ segmentP(X190,X189)
| ~ segmentP(X189,X190)
| ~ ssList(X190)
| ~ ssList(X189) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax54])])])]) ).
cnf(c_0_54,plain,
( ~ ssItem(X1)
| equalelemsP(cons(X1,nil)) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_55,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(esk5_1(X1),nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_56,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| ssItem(esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_57,negated_conjecture,
( ~ neq(esk51_0,nil)
| singletonP(esk50_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_58,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_59,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_60,negated_conjecture,
( ~ ssList(X1)
| ~ equalelemsP(X1)
| esk50_0 != X1 ),
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_49,c_0_50]),c_0_34]),c_0_21]),c_0_26]),c_0_28])]),c_0_51]) ).
cnf(c_0_61,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_52,c_0_17]) ).
cnf(c_0_62,plain,
( ~ segmentP(X2,X1)
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_63,negated_conjecture,
segmentP(esk51_0,esk50_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_64,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| equalelemsP(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_65,negated_conjecture,
( singletonP(esk50_0)
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_25]),c_0_59])]) ).
cnf(c_0_66,negated_conjecture,
~ equalelemsP(esk50_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_60]),c_0_61])]) ).
cnf(c_0_67,negated_conjecture,
( ~ segmentP(esk50_0,esk51_0)
| esk50_0 = esk51_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_59]),c_0_61])]) ).
cnf(c_0_68,negated_conjecture,
esk51_0 = nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_61])]),c_0_66]) ).
fof(c_0_69,plain,
! [X196] :
( segmentP(X196,nil)
| ~ ssList(X196) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])])]) ).
cnf(c_0_70,negated_conjecture,
( ~ segmentP(esk50_0,nil)
| esk50_0 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_68]),c_0_68]) ).
cnf(c_0_71,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_72,negated_conjecture,
esk50_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_61])]) ).
cnf(c_0_73,plain,
equalelemsP(nil),
inference(split_conjunct,[status(thm)],[ax74]) ).
cnf(c_0_74,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_72]),c_0_73])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC193+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.57 % Computer : n011.cluster.edu
% 0.10/0.57 % Model : x86_64 x86_64
% 0.10/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.57 % Memory : 8046.5625MB
% 0.10/0.57 % OS : Linux 6.8.0-71-generic
% 0.10/0.57 % CPULimit : 300
% 0.10/0.57 % WCLimit : 300
% 0.10/0.57 % DateTime : Mon Sep 21 08:03:10 UTC 2026
% 0.10/0.57 % CPUTime :
% 0.10/0.57 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.62 Running first-order theorem proving
% 0.10/0.62 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
% 0.15/0.68 % Version: 3.5.1
% 0.15/0.68 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.68 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.68 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.68 % Starting sh5l with 300s (1) cores
% 0.15/0.68 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1413989 completed with status 0
% 0.15/0.68 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.15/0.68 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.68 % No SInE strategy applied
% 0.15/0.68 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.15/0.68 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.68 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/0.68 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.15/0.68 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.15/0.68 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.15/0.68 % G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 1413998 completed with status 0
% 0.15/0.68 % Result found by G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d
% 0.15/0.68 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.68 % No SInE strategy applied
% 0.15/0.68 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.15/0.68 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.68 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/0.68 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.15/0.68 % Preprocessing time : 0.002 s
% 0.15/0.68
% 0.15/0.68 % Proof found!
% 0.15/0.68 % SZS status Theorem
% 0.15/0.68 % SZS output start CNFRefutation
% See solution above
% 0.15/0.68 % Parsed axioms : 96
% 0.15/0.68 % Removed by relevancy pruning/SinE : 0
% 0.15/0.68 % Initial clauses : 204
% 0.15/0.68 % Removed in clause preprocessing : 2
% 0.15/0.68 % Initial clauses in saturation : 202
% 0.15/0.68 % Processed clauses : 367
% 0.15/0.68 % ...of these trivial : 3
% 0.15/0.68 % ...subsumed : 28
% 0.15/0.68 % ...remaining for further processing : 336
% 0.15/0.68 % Other redundant clauses eliminated : 69
% 0.15/0.68 % Clauses deleted for lack of memory : 0
% 0.15/0.68 % Backward-subsumed : 18
% 0.15/0.68 % Backward-rewritten : 98
% 0.15/0.68 % Generated clauses : 1056
% 0.15/0.68 % ...of the previous two non-redundant : 902
% 0.15/0.68 % ...aggressively subsumed : 0
% 0.15/0.68 % Contextual simplify-reflections : 10
% 0.15/0.68 % Paramodulations : 962
% 0.15/0.68 % Factorizations : 0
% 0.15/0.68 % NegExts : 0
% 0.15/0.68 % Equation resolutions : 94
% 0.15/0.68 % Disequality decompositions : 0
% 0.15/0.68 % Total rewrite steps : 796
% 0.15/0.68 % ...of those cached : 759
% 0.15/0.68 % Propositional unsat checks : 0
% 0.15/0.68 % Propositional check models : 0
% 0.15/0.68 % Propositional check unsatisfiable : 0
% 0.15/0.68 % Propositional clauses : 0
% 0.15/0.68 % Propositional clauses after purity: 0
% 0.15/0.68 % Propositional unsat core size : 0
% 0.15/0.68 % Propositional preprocessing time : 0.000
% 0.15/0.68 % Propositional encoding time : 0.000
% 0.15/0.68 % Propositional solver time : 0.000
% 0.15/0.68 % Success case prop preproc time : 0.000
% 0.15/0.68 % Success case prop encoding time : 0.000
% 0.15/0.68 % Success case prop solver time : 0.000
% 0.15/0.68 % Current number of processed clauses : 214
% 0.15/0.68 % Positive orientable unit clauses : 27
% 0.15/0.68 % Positive unorientable unit clauses: 0
% 0.15/0.68 % Negative unit clauses : 3
% 0.15/0.68 % Non-unit-clauses : 184
% 0.15/0.68 % Current number of unprocessed clauses: 728
% 0.15/0.68 % ...number of literals in the above : 4561
% 0.15/0.68 % Current number of archived formulas : 0
% 0.15/0.68 % Current number of archived clauses : 116
% 0.15/0.68 % Clause-clause subsumption calls (NU) : 9620
% 0.15/0.68 % Rec. Clause-clause subsumption calls : 3652
% 0.15/0.68 % Non-unit clause-clause subsumptions : 55
% 0.15/0.68 % Unit Clause-clause subsumption calls : 265
% 0.15/0.68 % Rewrite failures with RHS unbound : 0
% 0.15/0.68 % BW rewrite match attempts : 38
% 0.15/0.68 % BW rewrite match successes : 15
% 0.15/0.68 % Condensation attempts : 0
% 0.15/0.68 % Condensation successes : 0
% 0.15/0.68 % Termbank termtop insertions : 40095
% 0.15/0.68 % Search garbage collected termcells : 4306
% 0.15/0.68
% 0.15/0.68 % -------------------------------------------------
% 0.15/0.68 % User time : 0.039 s
% 0.15/0.68 % System time : 0.005 s
% 0.15/0.68 % Total time : 0.044 s
% 0.15/0.68 % Maximum resident set size: 4220 pages
% 0.15/0.68
% 0.15/0.68 % -------------------------------------------------
% 0.15/0.68 % User time : 0.140 s
% 0.15/0.68 % System time : 0.030 s
% 0.15/0.68 % Total time : 0.170 s
% 0.15/0.68 % Maximum resident set size: 4608 pages
% 0.15/0.68 % E exiting
%------------------------------------------------------------------------------