TSTP Solution File: SWC111+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC111+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 04:27:41 EDT 2024
% Result : Theorem 19.88s 3.00s
% Output : CNFRefutation 19.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 16
% Syntax : Number of formulae : 91 ( 17 unt; 0 def)
% Number of atoms : 335 ( 87 equ)
% Maximal formula atoms : 23 ( 3 avg)
% Number of connectives : 407 ( 163 ~; 167 |; 38 &)
% ( 5 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 116 ( 0 sgn 59 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
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(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ~ totalorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& segmentP(X4,X5)
& segmentP(X5,X3)
& totalorderedP(X5) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ( neq(X1,nil)
& segmentP(X2,X1) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax58,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax58) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
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(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax66,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax66) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
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(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(ax65,axiom,
! [X1] :
( ssItem(X1)
=> totalorderedP(cons(X1,nil)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax65) ).
fof(c_0_16,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
fof(c_0_17,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ~ totalorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& segmentP(X4,X5)
& segmentP(X5,X3)
& totalorderedP(X5) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ( neq(X1,nil)
& segmentP(X2,X1) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_18,plain,
! [X32,X33] :
( ( ~ neq(X32,X33)
| X32 != X33
| ~ ssList(X33)
| ~ ssList(X32) )
& ( X32 = X33
| neq(X32,X33)
| ~ ssList(X33)
| ~ ssList(X32) ) ),
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_16])])])])]) ).
fof(c_0_19,negated_conjecture,
! [X11] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& segmentP(esk4_0,esk3_0)
& totalorderedP(esk3_0)
& ( ~ ssList(X11)
| ~ neq(esk3_0,X11)
| ~ segmentP(esk4_0,X11)
| ~ segmentP(X11,esk3_0)
| ~ totalorderedP(X11) )
& ( neq(esk2_0,nil)
| nil = esk2_0 )
& ( ~ neq(esk1_0,nil)
| ~ segmentP(esk2_0,esk1_0)
| nil = esk2_0 )
& ( neq(esk2_0,nil)
| nil != esk1_0 )
& ( ~ neq(esk1_0,nil)
| ~ segmentP(esk2_0,esk1_0)
| nil != esk1_0 ) ),
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)],[c_0_17])])])])])]) ).
cnf(c_0_20,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_22,negated_conjecture,
segmentP(esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_26,negated_conjecture,
( ~ ssList(X1)
| ~ neq(esk3_0,X1)
| ~ segmentP(esk4_0,X1)
| ~ segmentP(X1,esk3_0)
| ~ totalorderedP(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,negated_conjecture,
( X1 = esk2_0
| neq(X1,esk2_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,negated_conjecture,
( nil = esk2_0
| ~ neq(esk1_0,nil)
| ~ segmentP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_30,negated_conjecture,
segmentP(esk2_0,esk1_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_31,plain,
( X1 = nil
| neq(X1,nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_25]) ).
fof(c_0_32,plain,
! [X29] :
( ( ~ segmentP(nil,X29)
| nil = X29
| ~ ssList(X29) )
& ( nil != X29
| segmentP(nil,X29)
| ~ ssList(X29) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])])]) ).
fof(c_0_33,plain,
! [X70,X71] :
( ( nil = X71
| nil != app(X70,X71)
| ~ ssList(X71)
| ~ ssList(X70) )
& ( nil = X70
| nil != app(X70,X71)
| ~ ssList(X71)
| ~ ssList(X70) )
& ( nil != X71
| nil != X70
| nil = app(X70,X71)
| ~ ssList(X71)
| ~ ssList(X70) ) ),
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_34,negated_conjecture,
( ~ totalorderedP(X1)
| ~ segmentP(X1,esk1_0)
| ~ segmentP(esk2_0,X1)
| ~ ssList(X1)
| ~ neq(esk1_0,X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_24]),c_0_24]),c_0_23]) ).
cnf(c_0_35,negated_conjecture,
( esk2_0 = esk1_0
| neq(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_36,negated_conjecture,
( esk2_0 = nil
| ~ neq(esk1_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_37,negated_conjecture,
( esk1_0 = nil
| neq(esk1_0,nil) ),
inference(spm,[status(thm)],[c_0_31,c_0_28]) ).
cnf(c_0_38,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_39,plain,
! [X75,X76] :
( ~ ssList(X75)
| ~ ssItem(X76)
| ssList(cons(X76,X75)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
fof(c_0_40,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[ax21]) ).
fof(c_0_41,plain,
! [X12,X13,X16,X17] :
( ( ssList(esk5_2(X12,X13))
| ~ segmentP(X12,X13)
| ~ ssList(X13)
| ~ ssList(X12) )
& ( ssList(esk6_2(X12,X13))
| ~ segmentP(X12,X13)
| ~ ssList(X13)
| ~ ssList(X12) )
& ( app(app(esk5_2(X12,X13),X13),esk6_2(X12,X13)) = X12
| ~ segmentP(X12,X13)
| ~ ssList(X13)
| ~ ssList(X12) )
& ( ~ ssList(X16)
| ~ ssList(X17)
| app(app(X16,X13),X17) != X12
| segmentP(X12,X13)
| ~ ssList(X13)
| ~ ssList(X12) ) ),
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)],[ax7])])])])])]) ).
fof(c_0_42,plain,
! [X55,X56,X57] :
( ~ ssList(X55)
| ~ ssList(X56)
| ~ ssItem(X57)
| cons(X57,app(X56,X55)) = app(cons(X57,X56),X55) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])]) ).
fof(c_0_43,plain,
! [X53,X54] :
( ~ ssList(X53)
| ~ ssList(X54)
| ssList(app(X53,X54)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_44,plain,
( nil = app(X2,X1)
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_45,negated_conjecture,
( esk2_0 = esk1_0
| ~ totalorderedP(esk2_0)
| ~ segmentP(esk2_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_30]),c_0_21])]) ).
cnf(c_0_46,negated_conjecture,
( esk1_0 = nil
| esk2_0 = nil ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_47,plain,
totalorderedP(nil),
inference(split_conjunct,[status(thm)],[ax66]) ).
cnf(c_0_48,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_38]),c_0_25])]) ).
fof(c_0_49,plain,
! [X28] :
( ~ ssList(X28)
| segmentP(X28,nil) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])])]) ).
cnf(c_0_50,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
fof(c_0_51,plain,
! [X37,X38] :
( ~ ssList(X37)
| ~ ssItem(X38)
| nil != cons(X38,X37) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_40])])])]) ).
cnf(c_0_52,plain,
( segmentP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,X3),X2) != X4
| ~ ssList(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
fof(c_0_53,plain,
! [X58] :
( ~ ssList(X58)
| app(nil,X58) = X58 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_54,plain,
( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_55,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_56,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_44])]),c_0_25])]) ).
cnf(c_0_57,negated_conjecture,
esk1_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_48])]) ).
cnf(c_0_58,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_59,plain,
( X1 = cons(X2,X3)
| neq(X1,cons(X2,X3))
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_50]) ).
cnf(c_0_60,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| nil != cons(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_61,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_52]) ).
cnf(c_0_62,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
fof(c_0_63,plain,
! [X65,X66] :
( ~ ssList(X65)
| ~ ssItem(X66)
| cons(X66,X65) = app(cons(X66,nil),X65) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_64,plain,
( ssList(app(cons(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_54]),c_0_55]) ).
cnf(c_0_65,plain,
( app(cons(X1,nil),nil) = cons(X1,nil)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_56]),c_0_25])]) ).
fof(c_0_66,plain,
! [X34] :
( ( ssList(esk7_1(X34))
| nil = X34
| ~ ssList(X34) )
& ( ssItem(esk8_1(X34))
| nil = X34
| ~ ssList(X34) )
& ( cons(esk8_1(X34),esk7_1(X34)) = X34
| nil = X34
| ~ ssList(X34) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])])]) ).
cnf(c_0_67,negated_conjecture,
( ~ totalorderedP(X1)
| ~ segmentP(esk2_0,X1)
| ~ ssList(X1)
| ~ neq(nil,X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_57]),c_0_57]),c_0_58]) ).
cnf(c_0_68,plain,
( neq(nil,cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_25]),c_0_60]) ).
fof(c_0_69,plain,
! [X50] :
( ~ ssItem(X50)
| totalorderedP(cons(X50,nil)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax65])])]) ).
cnf(c_0_70,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_25])]),c_0_55]) ).
cnf(c_0_71,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_72,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_25])]) ).
cnf(c_0_73,plain,
( cons(esk8_1(X1),esk7_1(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_74,plain,
( ssItem(esk8_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_75,plain,
( ssList(esk7_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_76,negated_conjecture,
( ~ totalorderedP(cons(X1,X2))
| ~ segmentP(esk2_0,cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_50]) ).
cnf(c_0_77,plain,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_78,plain,
( segmentP(cons(X1,X2),cons(X1,nil))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72]) ).
cnf(c_0_79,negated_conjecture,
( cons(esk8_1(esk2_0),esk7_1(esk2_0)) = esk2_0
| esk2_0 = nil ),
inference(spm,[status(thm)],[c_0_73,c_0_21]) ).
cnf(c_0_80,negated_conjecture,
( esk2_0 = nil
| ssItem(esk8_1(esk2_0)) ),
inference(spm,[status(thm)],[c_0_74,c_0_21]) ).
cnf(c_0_81,negated_conjecture,
( esk2_0 = nil
| ssList(esk7_1(esk2_0)) ),
inference(spm,[status(thm)],[c_0_75,c_0_21]) ).
cnf(c_0_82,negated_conjecture,
( ~ neq(esk1_0,nil)
| ~ segmentP(esk2_0,esk1_0)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_83,negated_conjecture,
( neq(esk2_0,nil)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_84,negated_conjecture,
( ~ segmentP(esk2_0,cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_25])]) ).
cnf(c_0_85,negated_conjecture,
( esk2_0 = nil
| segmentP(esk2_0,cons(esk8_1(esk2_0),nil)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80]),c_0_81]) ).
cnf(c_0_86,negated_conjecture,
( esk1_0 != nil
| ~ neq(esk1_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_30])]) ).
cnf(c_0_87,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_57])]) ).
cnf(c_0_88,negated_conjecture,
esk2_0 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_80]) ).
cnf(c_0_89,negated_conjecture,
~ neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_57]),c_0_57])]) ).
cnf(c_0_90,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_88]),c_0_89]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC111+1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 03:23:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.47 Running first-order model finding
% 0.21/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 19.88/3.00 # Version: 3.1.0
% 19.88/3.00 # Preprocessing class: FSLSSMSSSSSNFFN.
% 19.88/3.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.88/3.00 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 19.88/3.00 # Starting new_bool_3 with 300s (1) cores
% 19.88/3.00 # Starting new_bool_1 with 300s (1) cores
% 19.88/3.00 # Starting sh5l with 300s (1) cores
% 19.88/3.00 # new_bool_1 with pid 1441 completed with status 0
% 19.88/3.00 # Result found by new_bool_1
% 19.88/3.00 # Preprocessing class: FSLSSMSSSSSNFFN.
% 19.88/3.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.88/3.00 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 19.88/3.00 # Starting new_bool_3 with 300s (1) cores
% 19.88/3.00 # Starting new_bool_1 with 300s (1) cores
% 19.88/3.00 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 19.88/3.00 # Search class: FGHSF-FFMM21-MFFFFFNN
% 19.88/3.00 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 19.88/3.00 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 19.88/3.00 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1444 completed with status 0
% 19.88/3.00 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 19.88/3.00 # Preprocessing class: FSLSSMSSSSSNFFN.
% 19.88/3.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.88/3.00 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 19.88/3.00 # Starting new_bool_3 with 300s (1) cores
% 19.88/3.00 # Starting new_bool_1 with 300s (1) cores
% 19.88/3.00 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 19.88/3.00 # Search class: FGHSF-FFMM21-MFFFFFNN
% 19.88/3.00 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 19.88/3.00 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 19.88/3.00 # Preprocessing time : 0.002 s
% 19.88/3.00 # Presaturation interreduction done
% 19.88/3.00
% 19.88/3.00 # Proof found!
% 19.88/3.00 # SZS status Theorem
% 19.88/3.00 # SZS output start CNFRefutation
% See solution above
% 19.88/3.00 # Parsed axioms : 96
% 19.88/3.00 # Removed by relevancy pruning/SinE : 47
% 19.88/3.00 # Initial clauses : 89
% 19.88/3.00 # Removed in clause preprocessing : 1
% 19.88/3.00 # Initial clauses in saturation : 88
% 19.88/3.00 # Processed clauses : 12668
% 19.88/3.00 # ...of these trivial : 244
% 19.88/3.00 # ...subsumed : 9168
% 19.88/3.00 # ...remaining for further processing : 3256
% 19.88/3.00 # Other redundant clauses eliminated : 247
% 19.88/3.00 # Clauses deleted for lack of memory : 0
% 19.88/3.00 # Backward-subsumed : 123
% 19.88/3.00 # Backward-rewritten : 2372
% 19.88/3.00 # Generated clauses : 199373
% 19.88/3.00 # ...of the previous two non-redundant : 194083
% 19.88/3.00 # ...aggressively subsumed : 0
% 19.88/3.00 # Contextual simplify-reflections : 441
% 19.88/3.00 # Paramodulations : 199053
% 19.88/3.00 # Factorizations : 0
% 19.88/3.00 # NegExts : 0
% 19.88/3.00 # Equation resolutions : 321
% 19.88/3.00 # Disequality decompositions : 0
% 19.88/3.00 # Total rewrite steps : 43883
% 19.88/3.00 # ...of those cached : 43855
% 19.88/3.00 # Propositional unsat checks : 0
% 19.88/3.00 # Propositional check models : 0
% 19.88/3.00 # Propositional check unsatisfiable : 0
% 19.88/3.00 # Propositional clauses : 0
% 19.88/3.00 # Propositional clauses after purity: 0
% 19.88/3.00 # Propositional unsat core size : 0
% 19.88/3.00 # Propositional preprocessing time : 0.000
% 19.88/3.00 # Propositional encoding time : 0.000
% 19.88/3.00 # Propositional solver time : 0.000
% 19.88/3.00 # Success case prop preproc time : 0.000
% 19.88/3.00 # Success case prop encoding time : 0.000
% 19.88/3.00 # Success case prop solver time : 0.000
% 19.88/3.01 # Current number of processed clauses : 670
% 19.88/3.01 # Positive orientable unit clauses : 19
% 19.88/3.01 # Positive unorientable unit clauses: 0
% 19.88/3.01 # Negative unit clauses : 2
% 19.88/3.01 # Non-unit-clauses : 649
% 19.88/3.01 # Current number of unprocessed clauses: 180891
% 19.88/3.01 # ...number of literals in the above : 957403
% 19.88/3.01 # Current number of archived formulas : 0
% 19.88/3.01 # Current number of archived clauses : 2578
% 19.88/3.01 # Clause-clause subsumption calls (NU) : 954402
% 19.88/3.01 # Rec. Clause-clause subsumption calls : 201492
% 19.88/3.01 # Non-unit clause-clause subsumptions : 9719
% 19.88/3.01 # Unit Clause-clause subsumption calls : 1432
% 19.88/3.01 # Rewrite failures with RHS unbound : 0
% 19.88/3.01 # BW rewrite match attempts : 15
% 19.88/3.01 # BW rewrite match successes : 14
% 19.88/3.01 # Condensation attempts : 0
% 19.88/3.01 # Condensation successes : 0
% 19.88/3.01 # Termbank termtop insertions : 4624879
% 19.88/3.01 # Search garbage collected termcells : 2211
% 19.88/3.01
% 19.88/3.01 # -------------------------------------------------
% 19.88/3.01 # User time : 2.345 s
% 19.88/3.01 # System time : 0.096 s
% 19.88/3.01 # Total time : 2.440 s
% 19.88/3.01 # Maximum resident set size: 2068 pages
% 19.88/3.01
% 19.88/3.01 # -------------------------------------------------
% 19.88/3.01 # User time : 2.348 s
% 19.88/3.01 # System time : 0.098 s
% 19.88/3.01 # Total time : 2.446 s
% 19.88/3.01 # Maximum resident set size: 1824 pages
% 19.88/3.01 % E---3.1 exiting
%------------------------------------------------------------------------------