TSTP Solution File: SWC057+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC057+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:41:16 EDT 2023
% Result : Theorem 0.17s 0.49s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of formulae : 77 ( 13 unt; 0 def)
% Number of atoms : 318 ( 83 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 408 ( 167 ~; 174 |; 37 &)
% ( 4 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 94 ( 0 sgn; 48 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) ) ) )
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ frontsegP(X4,X3) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.alGW0gBoP4/E---3.1_22856.p',co1) ).
fof(ax40,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( frontsegP(X1,X2)
& frontsegP(X2,X3) )
=> frontsegP(X1,X3) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.alGW0gBoP4/E---3.1_22856.p',ax40) ).
fof(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X2,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.alGW0gBoP4/E---3.1_22856.p',ax5) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.alGW0gBoP4/E---3.1_22856.p',ax26) ).
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/sandbox/tmp/tmp.alGW0gBoP4/E---3.1_22856.p',ax7) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.alGW0gBoP4/E---3.1_22856.p',ax28) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.alGW0gBoP4/E---3.1_22856.p',ax55) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.alGW0gBoP4/E---3.1_22856.p',ax17) ).
fof(ax58,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.alGW0gBoP4/E---3.1_22856.p',ax58) ).
fof(ax41,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( ( frontsegP(X1,X2)
& frontsegP(X2,X1) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.alGW0gBoP4/E---3.1_22856.p',ax41) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.alGW0gBoP4/E---3.1_22856.p',ax83) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox/tmp/tmp.alGW0gBoP4/E---3.1_22856.p',ax57) ).
fof(ax45,axiom,
! [X1] :
( ssList(X1)
=> frontsegP(X1,nil) ),
file('/export/starexec/sandbox/tmp/tmp.alGW0gBoP4/E---3.1_22856.p',ax45) ).
fof(c_0_13,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) ) ) )
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ frontsegP(X4,X3) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_14,negated_conjecture,
! [X11] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( neq(esk2_0,nil)
| nil = esk2_0 )
& ( ~ ssList(X11)
| ~ neq(X11,nil)
| ~ segmentP(esk2_0,X11)
| ~ segmentP(esk1_0,X11)
| nil = esk2_0 )
& ( neq(esk2_0,nil)
| nil != esk1_0 )
& ( ~ ssList(X11)
| ~ neq(X11,nil)
| ~ segmentP(esk2_0,X11)
| ~ segmentP(esk1_0,X11)
| nil != esk1_0 )
& ( neq(esk3_0,nil)
| nil = esk4_0 )
& ( frontsegP(esk4_0,esk3_0)
| nil = esk4_0 )
& ( neq(esk3_0,nil)
| nil = esk3_0 )
& ( frontsegP(esk4_0,esk3_0)
| nil = esk3_0 ) ),
inference(distribute,[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,
! [X16,X17,X18] :
( ~ ssList(X16)
| ~ ssList(X17)
| ~ ssList(X18)
| ~ frontsegP(X16,X17)
| ~ frontsegP(X17,X18)
| frontsegP(X16,X18) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax40])])]) ).
cnf(c_0_16,negated_conjecture,
( frontsegP(esk4_0,esk3_0)
| nil = esk3_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]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,plain,
! [X12,X13,X15] :
( ( ssList(esk5_2(X12,X13))
| ~ frontsegP(X12,X13)
| ~ ssList(X13)
| ~ ssList(X12) )
& ( app(X13,esk5_2(X12,X13)) = X12
| ~ frontsegP(X12,X13)
| ~ ssList(X13)
| ~ ssList(X12) )
& ( ~ ssList(X15)
| app(X13,X15) != X12
| frontsegP(X12,X13)
| ~ ssList(X13)
| ~ ssList(X12) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax5])])])])]) ).
fof(c_0_21,plain,
! [X58,X59] :
( ~ ssList(X58)
| ~ ssList(X59)
| ssList(app(X58,X59)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
fof(c_0_22,plain,
! [X40,X41,X44,X45] :
( ( ssList(esk8_2(X40,X41))
| ~ segmentP(X40,X41)
| ~ ssList(X41)
| ~ ssList(X40) )
& ( ssList(esk9_2(X40,X41))
| ~ segmentP(X40,X41)
| ~ ssList(X41)
| ~ ssList(X40) )
& ( app(app(esk8_2(X40,X41),X41),esk9_2(X40,X41)) = X40
| ~ segmentP(X40,X41)
| ~ ssList(X41)
| ~ ssList(X40) )
& ( ~ ssList(X44)
| ~ ssList(X45)
| app(app(X44,X41),X45) != X40
| segmentP(X40,X41)
| ~ ssList(X41)
| ~ ssList(X40) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax7])])])])]) ).
cnf(c_0_23,plain,
( frontsegP(X1,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X1,X2)
| ~ frontsegP(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,negated_conjecture,
( esk3_0 = nil
| frontsegP(esk2_0,esk3_0) ),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_25,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_27,plain,
( frontsegP(X3,X2)
| ~ ssList(X1)
| app(X2,X1) != X3
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,negated_conjecture,
( nil = esk2_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_30,negated_conjecture,
( neq(esk3_0,nil)
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_31,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_22]) ).
fof(c_0_32,plain,
! [X63] :
( ~ ssList(X63)
| app(nil,X63) = X63 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_33,negated_conjecture,
( esk3_0 = nil
| frontsegP(X1,esk3_0)
| ~ frontsegP(X1,esk2_0)
| ~ ssList(X1) ),
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_34,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_27]),c_0_28]) ).
cnf(c_0_35,negated_conjecture,
( esk2_0 = nil
| ~ segmentP(esk3_0,X1)
| ~ segmentP(esk2_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[c_0_29,c_0_19]) ).
cnf(c_0_36,negated_conjecture,
( esk2_0 = nil
| neq(esk3_0,nil) ),
inference(rw,[status(thm)],[c_0_30,c_0_17]) ).
fof(c_0_37,plain,
! [X51] :
( ~ ssList(X51)
| segmentP(X51,X51) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])]) ).
cnf(c_0_38,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_31]) ).
cnf(c_0_39,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_41,negated_conjecture,
( esk3_0 = nil
| frontsegP(app(esk2_0,X1),esk3_0)
| ~ ssList(app(esk2_0,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_26])]) ).
cnf(c_0_42,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk1_0,X1)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_43,negated_conjecture,
( neq(esk2_0,nil)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_44,negated_conjecture,
( esk2_0 = nil
| ~ segmentP(esk3_0,esk3_0)
| ~ segmentP(esk2_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_25])]) ).
cnf(c_0_45,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_46,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_38,c_0_39]),c_0_40])]),c_0_28]) ).
cnf(c_0_47,plain,
( app(X1,esk5_2(X2,X1)) = X2
| ~ frontsegP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_48,plain,
( ssList(esk5_2(X1,X2))
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_49,negated_conjecture,
( frontsegP(esk4_0,esk3_0)
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_50,plain,
! [X57] :
( ( ~ segmentP(nil,X57)
| nil = X57
| ~ ssList(X57) )
& ( nil != X57
| segmentP(nil,X57)
| ~ ssList(X57) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])]) ).
fof(c_0_51,plain,
! [X19,X20] :
( ~ ssList(X19)
| ~ ssList(X20)
| ~ frontsegP(X19,X20)
| ~ frontsegP(X20,X19)
| X19 = X20 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax41])])]) ).
cnf(c_0_52,negated_conjecture,
( esk3_0 = nil
| frontsegP(app(esk2_0,X1),esk3_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_28]),c_0_26])]) ).
cnf(c_0_53,negated_conjecture,
( esk3_0 != nil
| ~ segmentP(esk3_0,X1)
| ~ segmentP(esk2_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_19]),c_0_19]) ).
cnf(c_0_54,negated_conjecture,
( neq(esk2_0,nil)
| esk3_0 != nil ),
inference(rw,[status(thm)],[c_0_43,c_0_19]) ).
cnf(c_0_55,negated_conjecture,
( esk2_0 = nil
| ~ segmentP(esk2_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_25])]) ).
cnf(c_0_56,plain,
( segmentP(X1,X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_57,negated_conjecture,
( esk2_0 = nil
| frontsegP(esk2_0,esk3_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_17]),c_0_17]) ).
cnf(c_0_58,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_59,plain,
( X1 = X2
| ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| ~ frontsegP(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_60,negated_conjecture,
( esk3_0 = nil
| frontsegP(app(esk2_0,nil),esk3_0) ),
inference(spm,[status(thm)],[c_0_52,c_0_40]) ).
fof(c_0_61,plain,
! [X75,X76] :
( ( nil = X76
| nil != app(X75,X76)
| ~ ssList(X76)
| ~ ssList(X75) )
& ( nil = X75
| nil != app(X75,X76)
| ~ ssList(X76)
| ~ ssList(X75) )
& ( nil != X76
| nil != X75
| nil = app(X75,X76)
| ~ ssList(X76)
| ~ ssList(X75) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])]) ).
cnf(c_0_62,negated_conjecture,
( esk3_0 != nil
| ~ segmentP(esk3_0,esk2_0)
| ~ segmentP(esk2_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_26])]) ).
cnf(c_0_63,negated_conjecture,
esk2_0 = nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_25]),c_0_26])]),c_0_57]) ).
cnf(c_0_64,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_58]),c_0_40])]) ).
fof(c_0_65,plain,
! [X56] :
( ~ ssList(X56)
| segmentP(X56,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])]) ).
cnf(c_0_66,negated_conjecture,
( app(esk2_0,nil) = esk3_0
| esk3_0 = nil
| ~ frontsegP(esk3_0,app(esk2_0,nil))
| ~ ssList(app(esk2_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_25])]) ).
cnf(c_0_67,plain,
( nil = app(X2,X1)
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_68,negated_conjecture,
( esk3_0 != nil
| ~ segmentP(esk3_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_63]),c_0_63]),c_0_63]),c_0_64])]) ).
cnf(c_0_69,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_70,negated_conjecture,
( app(esk2_0,nil) = esk3_0
| esk3_0 = nil
| ~ frontsegP(esk3_0,app(esk2_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_28]),c_0_40]),c_0_26])]) ).
cnf(c_0_71,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_67])]),c_0_40])]) ).
cnf(c_0_72,negated_conjecture,
esk3_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_25])]) ).
fof(c_0_73,plain,
! [X29] :
( ~ ssList(X29)
| frontsegP(X29,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax45])]) ).
cnf(c_0_74,negated_conjecture,
~ frontsegP(esk3_0,nil),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_63]),c_0_71]),c_0_63]),c_0_71])]),c_0_72]) ).
cnf(c_0_75,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_76,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SWC057+1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n021.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 01:57:14 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.45 Running first-order model finding
% 0.17/0.45 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.alGW0gBoP4/E---3.1_22856.p
% 0.17/0.49 # Version: 3.1pre001
% 0.17/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.49 # Starting sh5l with 300s (1) cores
% 0.17/0.49 # new_bool_3 with pid 22934 completed with status 0
% 0.17/0.49 # Result found by new_bool_3
% 0.17/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.49 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.17/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.17/0.49 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 22937 completed with status 0
% 0.17/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.49 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.17/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.17/0.49 # Preprocessing time : 0.002 s
% 0.17/0.49 # Presaturation interreduction done
% 0.17/0.49
% 0.17/0.49 # Proof found!
% 0.17/0.49 # SZS status Theorem
% 0.17/0.49 # SZS output start CNFRefutation
% See solution above
% 0.17/0.49 # Parsed axioms : 96
% 0.17/0.49 # Removed by relevancy pruning/SinE : 62
% 0.17/0.49 # Initial clauses : 65
% 0.17/0.49 # Removed in clause preprocessing : 0
% 0.17/0.49 # Initial clauses in saturation : 65
% 0.17/0.49 # Processed clauses : 321
% 0.17/0.49 # ...of these trivial : 2
% 0.17/0.49 # ...subsumed : 49
% 0.17/0.49 # ...remaining for further processing : 270
% 0.17/0.49 # Other redundant clauses eliminated : 24
% 0.17/0.49 # Clauses deleted for lack of memory : 0
% 0.17/0.49 # Backward-subsumed : 16
% 0.17/0.49 # Backward-rewritten : 55
% 0.17/0.49 # Generated clauses : 826
% 0.17/0.49 # ...of the previous two non-redundant : 773
% 0.17/0.49 # ...aggressively subsumed : 0
% 0.17/0.49 # Contextual simplify-reflections : 39
% 0.17/0.49 # Paramodulations : 779
% 0.17/0.49 # Factorizations : 0
% 0.17/0.49 # NegExts : 0
% 0.17/0.49 # Equation resolutions : 28
% 0.17/0.49 # Total rewrite steps : 356
% 0.17/0.49 # Propositional unsat checks : 0
% 0.17/0.49 # Propositional check models : 0
% 0.17/0.49 # Propositional check unsatisfiable : 0
% 0.17/0.49 # Propositional clauses : 0
% 0.17/0.49 # Propositional clauses after purity: 0
% 0.17/0.49 # Propositional unsat core size : 0
% 0.17/0.49 # Propositional preprocessing time : 0.000
% 0.17/0.49 # Propositional encoding time : 0.000
% 0.17/0.49 # Propositional solver time : 0.000
% 0.17/0.49 # Success case prop preproc time : 0.000
% 0.17/0.49 # Success case prop encoding time : 0.000
% 0.17/0.49 # Success case prop solver time : 0.000
% 0.17/0.49 # Current number of processed clauses : 108
% 0.17/0.49 # Positive orientable unit clauses : 13
% 0.17/0.49 # Positive unorientable unit clauses: 0
% 0.17/0.49 # Negative unit clauses : 3
% 0.17/0.49 # Non-unit-clauses : 92
% 0.17/0.49 # Current number of unprocessed clauses: 579
% 0.17/0.49 # ...number of literals in the above : 2736
% 0.17/0.49 # Current number of archived formulas : 0
% 0.17/0.49 # Current number of archived clauses : 154
% 0.17/0.49 # Clause-clause subsumption calls (NU) : 3648
% 0.17/0.49 # Rec. Clause-clause subsumption calls : 1315
% 0.17/0.49 # Non-unit clause-clause subsumptions : 103
% 0.17/0.49 # Unit Clause-clause subsumption calls : 141
% 0.17/0.49 # Rewrite failures with RHS unbound : 0
% 0.17/0.49 # BW rewrite match attempts : 2
% 0.17/0.49 # BW rewrite match successes : 2
% 0.17/0.49 # Condensation attempts : 0
% 0.17/0.49 # Condensation successes : 0
% 0.17/0.49 # Termbank termtop insertions : 18749
% 0.17/0.49
% 0.17/0.49 # -------------------------------------------------
% 0.17/0.49 # User time : 0.029 s
% 0.17/0.49 # System time : 0.001 s
% 0.17/0.49 # Total time : 0.030 s
% 0.17/0.49 # Maximum resident set size: 2052 pages
% 0.17/0.49
% 0.17/0.49 # -------------------------------------------------
% 0.17/0.49 # User time : 0.031 s
% 0.17/0.49 # System time : 0.004 s
% 0.17/0.49 # Total time : 0.035 s
% 0.17/0.49 # Maximum resident set size: 1800 pages
% 0.17/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------