%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC075+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 : 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:42:53 PM UTC 2026
% Result : Theorem 0.23s 0.67s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 88 ( 27 unt; 0 def)
% Number of atoms : 299 ( 103 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 358 ( 147 ~; 141 |; 28 &)
% ( 3 <=>; 39 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 114 ( 0 sgn 65 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( nil = X1
& nil = X2 )
| ! [X6] :
( ssList(X6)
=> ! [X7] :
( app(X7,X6) != X3
| app(X6,X7) != X4
| ~ ssList(X7) ) )
| ? [X5] :
( segmentP(X1,X5)
& segmentP(X2,X5)
& neq(X5,nil)
& ssList(X5) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax56,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( segmentP(X1,X2)
=> segmentP(app(app(X3,X1),X4),X2) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax56) ).
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(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax79,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X3,X2) = app(X1,X2)
=> X3 = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax79) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X1
& nil = X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax83) ).
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(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax53,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( segmentP(X2,X3)
& segmentP(X1,X2) )
=> segmentP(X1,X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax53) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( nil = X1
& nil = X2 )
| ! [X6] :
( ssList(X6)
=> ! [X7] :
( app(X7,X6) != X3
| app(X6,X7) != X4
| ~ ssList(X7) ) )
| ? [X5] :
( segmentP(X1,X5)
& segmentP(X2,X5)
& neq(X5,nil)
& ssList(X5) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( nil = X1
& nil = X2 )
| ! [X6] :
( ssList(X6)
=> ! [X7] :
( app(X7,X6) != X3
| app(X6,X7) != X4
| ~ ssList(X7) ) )
| ? [X5] :
( segmentP(X1,X5)
& segmentP(X2,X5)
& neq(X5,nil)
& ssList(X5) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_14,negated_conjecture,
! [X12] :
( ( nil != esk1_0
| nil != esk2_0 )
& app(esk6_0,esk5_0) = esk3_0
& app(esk5_0,esk6_0) = esk4_0
& ssList(esk6_0)
& ssList(esk5_0)
& ( ~ segmentP(esk1_0,X12)
| ~ segmentP(esk2_0,X12)
| ~ neq(X12,nil)
| ~ ssList(X12) )
& esk1_0 = esk3_0
& esk2_0 = esk4_0
& ssList(esk4_0)
& ssList(esk3_0)
& ssList(esk2_0)
& ssList(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])]) ).
fof(c_0_15,plain,
! [X52,X53,X54,X55] :
( segmentP(app(app(X54,X52),X55),X53)
| ~ segmentP(X52,X53)
| ~ ssList(X55)
| ~ ssList(X54)
| ~ ssList(X53)
| ~ ssList(X52) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])])]) ).
cnf(c_0_16,negated_conjecture,
app(esk5_0,esk6_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_18,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_19,plain,
( ~ segmentP(X1,X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| segmentP(app(app(X3,X1),X4),X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
app(esk5_0,esk6_0) = esk2_0,
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_23,plain,
! [X39] :
( app(X39,nil) = X39
| ~ ssList(X39) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
fof(c_0_24,plain,
! [X25] :
( app(nil,X25) = X25
| ~ ssList(X25) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_25,negated_conjecture,
app(esk6_0,esk5_0) = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_26,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_27,plain,
! [X26,X27,X28] :
( X28 = X26
| app(X28,X27) != app(X26,X27)
| ~ ssList(X28)
| ~ ssList(X27)
| ~ ssList(X26) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax79])])])]) ).
fof(c_0_28,plain,
! [X60,X61] :
( ( ~ ssList(X60)
| ~ ssList(X61)
| neq(X60,X61)
| X60 = X61 )
& ( ~ ssList(X60)
| ~ ssList(X61)
| X60 != X61
| ~ neq(X60,X61) ) ),
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_18])])])])]) ).
cnf(c_0_29,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(esk6_0,X2)
| segmentP(app(esk2_0,X1),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_30,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_32,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_33,plain,
! [X51] :
( segmentP(X51,X51)
| ~ ssList(X51) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_35,negated_conjecture,
app(esk6_0,esk5_0) = esk1_0,
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
fof(c_0_36,plain,
! [X37,X38] :
( ( ~ ssList(X37)
| ~ ssList(X38)
| nil = app(X37,X38)
| nil != X37
| nil != X38 )
& ( ~ ssList(X37)
| ~ ssList(X38)
| nil != app(X37,X38)
| nil = X37 )
& ( ~ ssList(X37)
| ~ ssList(X38)
| nil != app(X37,X38)
| nil = X38 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])])]) ).
cnf(c_0_37,plain,
( app(X3,X2) != app(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| X3 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_38,plain,
! [X34,X35,X36] :
( app(app(X34,X35),X36) = app(X34,app(X35,X36))
| ~ ssList(X36)
| ~ ssList(X35)
| ~ ssList(X34) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
fof(c_0_39,plain,
! [X20,X21] :
( ssList(app(X20,X21))
| ~ ssList(X21)
| ~ ssList(X20) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_40,negated_conjecture,
( ~ segmentP(esk1_0,X1)
| ~ segmentP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_42,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(esk6_0,X1)
| segmentP(esk2_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32])]) ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_44,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_19,c_0_34]),c_0_31])]) ).
cnf(c_0_45,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(esk5_0,X2)
| segmentP(app(esk1_0,X1),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_35]),c_0_22]),c_0_21])]) ).
cnf(c_0_46,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_47,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != app(X2,X1)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_48,negated_conjecture,
( ~ ssList(X1)
| app(X1,esk6_0) != esk2_0
| X1 = esk5_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_49,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X1,X2),X3) = app(X1,app(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_50,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_51,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk1_0,X1)
| X1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_31])]) ).
cnf(c_0_52,negated_conjecture,
segmentP(esk2_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_22])]) ).
cnf(c_0_53,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(esk6_0,X1)
| segmentP(esk1_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_35]),c_0_21]),c_0_22])]) ).
fof(c_0_54,plain,
! [X46,X47,X48] :
( segmentP(X46,X48)
| ~ segmentP(X47,X48)
| ~ segmentP(X46,X47)
| ~ ssList(X48)
| ~ ssList(X47)
| ~ ssList(X46) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax53])])])]) ).
cnf(c_0_55,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(esk5_0,X1)
| segmentP(esk1_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_30]),c_0_31]),c_0_46])]) ).
cnf(c_0_56,negated_conjecture,
( esk1_0 != nil
| esk5_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_35]),c_0_22]),c_0_21])]) ).
cnf(c_0_57,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_58,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != X2
| nil != X1
| nil = app(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_59,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,app(X2,esk6_0)) != esk2_0
| app(X1,X2) = esk5_0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_22])]),c_0_50]) ).
cnf(c_0_60,negated_conjecture,
( ~ ssList(X1)
| app(esk5_0,app(esk6_0,X1)) = app(esk2_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_20]),c_0_22]),c_0_21])]) ).
cnf(c_0_61,negated_conjecture,
( ~ segmentP(esk1_0,esk6_0)
| esk6_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_22])]) ).
cnf(c_0_62,negated_conjecture,
segmentP(esk1_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_43]),c_0_22])]) ).
cnf(c_0_63,negated_conjecture,
( ~ ssList(X1)
| app(esk6_0,app(esk5_0,X1)) = app(esk1_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_35]),c_0_21]),c_0_22])]) ).
cnf(c_0_64,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(nil,app(X1,X2)) = app(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_34]),c_0_31])]) ).
cnf(c_0_65,plain,
( ~ segmentP(X2,X3)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| segmentP(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_66,negated_conjecture,
segmentP(esk1_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_43]),c_0_21])]) ).
cnf(c_0_67,negated_conjecture,
( esk2_0 != nil
| esk6_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_68,negated_conjecture,
( esk1_0 != nil
| app(nil,esk6_0) = esk2_0 ),
inference(spm,[status(thm)],[c_0_20,c_0_56]) ).
cnf(c_0_69,negated_conjecture,
( esk1_0 != nil
| esk6_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_35]),c_0_21]),c_0_22])]) ).
cnf(c_0_70,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_58])]),c_0_31])]) ).
cnf(c_0_71,negated_conjecture,
( nil != esk1_0
| nil != esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_72,negated_conjecture,
( app(esk2_0,esk6_0) != esk2_0
| esk5_0 = esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_20]),c_0_22]),c_0_21])]) ).
cnf(c_0_73,negated_conjecture,
esk6_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62])]) ).
cnf(c_0_74,negated_conjecture,
app(esk2_0,nil) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_30]),c_0_20]),c_0_31]),c_0_22])]) ).
cnf(c_0_75,negated_conjecture,
app(esk6_0,esk2_0) = app(esk1_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_20]),c_0_22])]) ).
cnf(c_0_76,negated_conjecture,
app(nil,esk2_0) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_20]),c_0_22]),c_0_21])]) ).
cnf(c_0_77,negated_conjecture,
app(esk1_0,nil) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_30]),c_0_35]),c_0_31]),c_0_21])]) ).
cnf(c_0_78,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(X1,esk1_0)
| segmentP(X1,esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_21]),c_0_46])]) ).
cnf(c_0_79,negated_conjecture,
( esk2_0 != nil
| app(nil,esk5_0) = esk1_0 ),
inference(spm,[status(thm)],[c_0_35,c_0_67]) ).
cnf(c_0_80,negated_conjecture,
( esk2_0 != nil
| esk5_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_20]),c_0_22]),c_0_21])]) ).
cnf(c_0_81,negated_conjecture,
esk1_0 != nil,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]),c_0_71]) ).
cnf(c_0_82,negated_conjecture,
esk5_0 = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73]),c_0_74])]) ).
cnf(c_0_83,negated_conjecture,
esk2_0 = esk1_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_73]),c_0_76]),c_0_73]),c_0_77]) ).
cnf(c_0_84,negated_conjecture,
( ~ segmentP(esk2_0,esk1_0)
| esk5_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_78]),c_0_66]),c_0_21]),c_0_32])]) ).
cnf(c_0_85,negated_conjecture,
esk2_0 != nil,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_70]),c_0_81]) ).
cnf(c_0_86,negated_conjecture,
segmentP(esk1_0,esk1_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_82]),c_0_83]) ).
cnf(c_0_87,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_82]),c_0_85]),c_0_83]),c_0_86])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC075+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 % Computer : n010.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Mon Sep 21 07:53:40 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.47 Running first-order theorem proving
% 0.18/0.47 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.23/0.67 % Version: 3.5.1
% 0.23/0.67 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.67 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.67 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.67 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.67 % Starting sh5l with 300s (1) cores
% 0.23/0.67 % new_bool_3 with pid 410962 completed with status 0
% 0.23/0.67 % Result found by new_bool_3
% 0.23/0.67 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.67 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.67 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.67 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.67 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.67 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.23/0.67 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.67 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.67 % SubtermCWHack with pid 410965 completed with status 0
% 0.23/0.67 % Result found by SubtermCWHack
% 0.23/0.67 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.67 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.67 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.67 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.67 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.67 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.23/0.67 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.67 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.67 % Preprocessing time : 0.001 s
% 0.23/0.67
% 0.23/0.67 % Proof found!
% 0.23/0.67 % SZS status Theorem
% 0.23/0.67 % SZS output start CNFRefutation
% See solution above
% 0.23/0.68 % Parsed axioms : 96
% 0.23/0.68 % Removed by relevancy pruning/SinE : 70
% 0.23/0.68 % Initial clauses : 50
% 0.23/0.68 % Removed in clause preprocessing : 0
% 0.23/0.68 % Initial clauses in saturation : 50
% 0.23/0.68 % Processed clauses : 1566
% 0.23/0.68 % ...of these trivial : 63
% 0.23/0.68 % ...subsumed : 1017
% 0.23/0.68 % ...remaining for further processing : 485
% 0.23/0.68 % Other redundant clauses eliminated : 24
% 0.23/0.68 % Clauses deleted for lack of memory : 0
% 0.23/0.68 % Backward-subsumed : 35
% 0.23/0.68 % Backward-rewritten : 289
% 0.23/0.68 % Generated clauses : 6128
% 0.23/0.68 % ...of the previous two non-redundant : 5651
% 0.23/0.68 % ...aggressively subsumed : 0
% 0.23/0.68 % Contextual simplify-reflections : 33
% 0.23/0.68 % Paramodulations : 6101
% 0.23/0.68 % Factorizations : 0
% 0.23/0.68 % NegExts : 0
% 0.23/0.68 % Equation resolutions : 28
% 0.23/0.68 % Disequality decompositions : 0
% 0.23/0.68 % Total rewrite steps : 7692
% 0.23/0.68 % ...of those cached : 7648
% 0.23/0.68 % Propositional unsat checks : 0
% 0.23/0.68 % Propositional check models : 0
% 0.23/0.68 % Propositional check unsatisfiable : 0
% 0.23/0.68 % Propositional clauses : 0
% 0.23/0.68 % Propositional clauses after purity: 0
% 0.23/0.68 % Propositional unsat core size : 0
% 0.23/0.68 % Propositional preprocessing time : 0.000
% 0.23/0.68 % Propositional encoding time : 0.000
% 0.23/0.68 % Propositional solver time : 0.000
% 0.23/0.68 % Success case prop preproc time : 0.000
% 0.23/0.68 % Success case prop encoding time : 0.000
% 0.23/0.68 % Success case prop solver time : 0.000
% 0.23/0.68 % Current number of processed clauses : 156
% 0.23/0.68 % Positive orientable unit clauses : 26
% 0.23/0.68 % Positive unorientable unit clauses: 0
% 0.23/0.68 % Negative unit clauses : 8
% 0.23/0.68 % Non-unit-clauses : 122
% 0.23/0.68 % Current number of unprocessed clauses: 4088
% 0.23/0.68 % ...number of literals in the above : 18649
% 0.23/0.68 % Current number of archived formulas : 0
% 0.23/0.68 % Current number of archived clauses : 324
% 0.23/0.68 % Clause-clause subsumption calls (NU) : 26514
% 0.23/0.68 % Rec. Clause-clause subsumption calls : 17495
% 0.23/0.68 % Non-unit clause-clause subsumptions : 692
% 0.23/0.68 % Unit Clause-clause subsumption calls : 914
% 0.23/0.68 % Rewrite failures with RHS unbound : 0
% 0.23/0.68 % BW rewrite match attempts : 28
% 0.23/0.68 % BW rewrite match successes : 13
% 0.23/0.68 % Condensation attempts : 0
% 0.23/0.68 % Condensation successes : 0
% 0.23/0.68 % Termbank termtop insertions : 98505
% 0.23/0.68 % Search garbage collected termcells : 1534
% 0.23/0.68
% 0.23/0.68 % -------------------------------------------------
% 0.23/0.68 % User time : 0.094 s
% 0.23/0.68 % System time : 0.015 s
% 0.23/0.68 % Total time : 0.108 s
% 0.23/0.68 % Maximum resident set size: 3760 pages
% 0.23/0.68
% 0.23/0.68 % -------------------------------------------------
% 0.23/0.68 % User time : 0.099 s
% 0.23/0.68 % System time : 0.022 s
% 0.23/0.68 % Total time : 0.121 s
% 0.23/0.68 % Maximum resident set size: 4864 pages
% 0.23/0.68 % E exiting
%------------------------------------------------------------------------------