TSTP Solution File: SWC152+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC152+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:46 EDT 2023
% Result : Theorem 0.59s 0.62s
% Output : CNFRefutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 12
% Syntax : Number of formulae : 64 ( 24 unt; 0 def)
% Number of atoms : 313 ( 61 equ)
% Maximal formula atoms : 42 ( 4 avg)
% Number of connectives : 389 ( 140 ~; 157 |; 51 &)
% ( 2 <=>; 39 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 5 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 24 ( 24 usr; 12 con; 0-2 aty)
% Number of variables : 104 ( 0 sgn; 69 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ~ ssList(X9)
| app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9) != X1
| ~ leq(X6,X5)
| ( ! [X10] :
( ~ ssItem(X10)
| ~ memberP(X8,X10)
| ( leq(X5,X10)
& leq(X10,X6) ) )
& leq(X5,X6) ) ) ) ) ) )
| ( ! [X11] :
( ~ ssItem(X11)
| cons(X11,nil) != X3
| ~ memberP(X4,X11)
| ? [X12] :
( ssItem(X12)
& X11 != X12
& memberP(X4,X12)
& leq(X11,X12) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0fYGYE4xnC/E---3.1_3036.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/tmp/tmp.0fYGYE4xnC/E---3.1_3036.p',ax82) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0fYGYE4xnC/E---3.1_3036.p',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.0fYGYE4xnC/E---3.1_3036.p',ax17) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0fYGYE4xnC/E---3.1_3036.p',ax81) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0fYGYE4xnC/E---3.1_3036.p',ax26) ).
fof(ax11,axiom,
! [X1] :
( ssList(X1)
=> ( totalorderedP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> leq(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0fYGYE4xnC/E---3.1_3036.p',ax11) ).
fof(ax8,axiom,
! [X1] :
( ssList(X1)
=> ( cyclefreeP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> ~ ( leq(X2,X3)
& leq(X3,X2) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0fYGYE4xnC/E---3.1_3036.p',ax8) ).
fof(ax65,axiom,
! [X1] :
( ssItem(X1)
=> totalorderedP(cons(X1,nil)) ),
file('/export/starexec/sandbox2/tmp/tmp.0fYGYE4xnC/E---3.1_3036.p',ax65) ).
fof(ax59,axiom,
! [X1] :
( ssItem(X1)
=> cyclefreeP(cons(X1,nil)) ),
file('/export/starexec/sandbox2/tmp/tmp.0fYGYE4xnC/E---3.1_3036.p',ax59) ).
fof(ax60,axiom,
cyclefreeP(nil),
file('/export/starexec/sandbox2/tmp/tmp.0fYGYE4xnC/E---3.1_3036.p',ax60) ).
fof(ax66,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox2/tmp/tmp.0fYGYE4xnC/E---3.1_3036.p',ax66) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ~ ssList(X9)
| app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9) != X1
| ~ leq(X6,X5)
| ( ! [X10] :
( ~ ssItem(X10)
| ~ memberP(X8,X10)
| ( leq(X5,X10)
& leq(X10,X6) ) )
& leq(X5,X6) ) ) ) ) ) )
| ( ! [X11] :
( ~ ssItem(X11)
| cons(X11,nil) != X3
| ~ memberP(X4,X11)
| ? [X12] :
( ssItem(X12)
& X11 != X12
& memberP(X4,X12)
& leq(X11,X12) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_13,negated_conjecture,
! [X268] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ssItem(esk52_0)
& ssItem(esk53_0)
& ssList(esk54_0)
& ssList(esk55_0)
& ssList(esk56_0)
& app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0) = esk48_0
& leq(esk53_0,esk52_0)
& ( ssItem(esk57_0)
| ~ leq(esk52_0,esk53_0) )
& ( memberP(esk55_0,esk57_0)
| ~ leq(esk52_0,esk53_0) )
& ( ~ leq(esk52_0,esk57_0)
| ~ leq(esk57_0,esk53_0)
| ~ leq(esk52_0,esk53_0) )
& ( nil = esk51_0
| ssItem(esk58_0) )
& ( nil = esk50_0
| ssItem(esk58_0) )
& ( nil = esk51_0
| cons(esk58_0,nil) = esk50_0 )
& ( nil = esk50_0
| cons(esk58_0,nil) = esk50_0 )
& ( nil = esk51_0
| memberP(esk51_0,esk58_0) )
& ( nil = esk50_0
| memberP(esk51_0,esk58_0) )
& ( nil = esk51_0
| ~ ssItem(X268)
| esk58_0 = X268
| ~ memberP(esk51_0,X268)
| ~ leq(esk58_0,X268) )
& ( nil = esk50_0
| ~ ssItem(X268)
| esk58_0 = X268
| ~ memberP(esk51_0,X268)
| ~ leq(esk58_0,X268) ) ),
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_12])])])])]) ).
cnf(c_0_14,negated_conjecture,
app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0) = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_15,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X228,X229,X230] :
( ~ ssList(X228)
| ~ ssList(X229)
| ~ ssList(X230)
| app(app(X228,X229),X230) = app(X228,app(X229,X230)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])]) ).
cnf(c_0_17,negated_conjecture,
app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0) = esk50_0,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
ssList(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
ssList(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_21,plain,
! [X117,X118] :
( ~ ssList(X117)
| ~ ssItem(X118)
| ssList(cons(X118,X117)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_22,negated_conjecture,
( app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0) = esk50_0
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]) ).
cnf(c_0_23,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_24,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_25,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_26,plain,
! [X226,X227] :
( ~ ssList(X226)
| ~ ssItem(X227)
| cons(X227,X226) = app(cons(X227,nil),X226) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_27,negated_conjecture,
app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_28,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_29,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,nil)),esk56_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_19]),c_0_25])]) ).
cnf(c_0_30,negated_conjecture,
ssList(esk56_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_31,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0)) = esk50_0
| ~ ssList(app(esk54_0,cons(esk52_0,esk55_0)))
| ~ ssList(cons(esk53_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_29]),c_0_30])]) ).
cnf(c_0_32,negated_conjecture,
ssItem(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_33,plain,
! [X136,X137] :
( ~ ssList(X136)
| ~ ssList(X137)
| ssList(app(X136,X137)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
cnf(c_0_34,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0)) = esk50_0
| ~ ssList(app(esk54_0,cons(esk52_0,esk55_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_23]),c_0_24]),c_0_32])]) ).
cnf(c_0_35,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_36,plain,
! [X73,X74,X75,X76,X77,X78] :
( ( ~ totalorderedP(X73)
| ~ ssItem(X74)
| ~ ssItem(X75)
| ~ ssList(X76)
| ~ ssList(X77)
| ~ ssList(X78)
| app(app(X76,cons(X74,X77)),cons(X75,X78)) != X73
| leq(X74,X75)
| ~ ssList(X73) )
& ( ssItem(esk25_1(X73))
| totalorderedP(X73)
| ~ ssList(X73) )
& ( ssItem(esk26_1(X73))
| totalorderedP(X73)
| ~ ssList(X73) )
& ( ssList(esk27_1(X73))
| totalorderedP(X73)
| ~ ssList(X73) )
& ( ssList(esk28_1(X73))
| totalorderedP(X73)
| ~ ssList(X73) )
& ( ssList(esk29_1(X73))
| totalorderedP(X73)
| ~ ssList(X73) )
& ( app(app(esk27_1(X73),cons(esk25_1(X73),esk28_1(X73))),cons(esk26_1(X73),esk29_1(X73))) = X73
| totalorderedP(X73)
| ~ ssList(X73) )
& ( ~ leq(esk25_1(X73),esk26_1(X73))
| totalorderedP(X73)
| ~ ssList(X73) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax11])])])])]) ).
cnf(c_0_37,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0)) = esk50_0
| ~ ssList(cons(esk52_0,esk55_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_20])]) ).
fof(c_0_38,plain,
! [X40,X41,X42,X43,X44,X45] :
( ( ~ cyclefreeP(X40)
| ~ ssItem(X41)
| ~ ssItem(X42)
| ~ ssList(X43)
| ~ ssList(X44)
| ~ ssList(X45)
| app(app(X43,cons(X41,X44)),cons(X42,X45)) != X40
| ~ leq(X41,X42)
| ~ leq(X42,X41)
| ~ ssList(X40) )
& ( ssItem(esk10_1(X40))
| cyclefreeP(X40)
| ~ ssList(X40) )
& ( ssItem(esk11_1(X40))
| cyclefreeP(X40)
| ~ ssList(X40) )
& ( ssList(esk12_1(X40))
| cyclefreeP(X40)
| ~ ssList(X40) )
& ( ssList(esk13_1(X40))
| cyclefreeP(X40)
| ~ ssList(X40) )
& ( ssList(esk14_1(X40))
| cyclefreeP(X40)
| ~ ssList(X40) )
& ( app(app(esk12_1(X40),cons(esk10_1(X40),esk13_1(X40))),cons(esk11_1(X40),esk14_1(X40))) = X40
| cyclefreeP(X40)
| ~ ssList(X40) )
& ( leq(esk10_1(X40),esk11_1(X40))
| cyclefreeP(X40)
| ~ ssList(X40) )
& ( leq(esk11_1(X40),esk10_1(X40))
| cyclefreeP(X40)
| ~ 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)],[ax8])])])])]) ).
cnf(c_0_39,plain,
( leq(X2,X3)
| ~ totalorderedP(X1)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_40,negated_conjecture,
app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_23]),c_0_19]),c_0_25])]) ).
cnf(c_0_41,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_42,plain,
! [X205] :
( ~ ssItem(X205)
| totalorderedP(cons(X205,nil)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax65])]) ).
cnf(c_0_43,plain,
( ~ cyclefreeP(X1)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| ~ leq(X2,X3)
| ~ leq(X3,X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_44,plain,
( leq(X1,X2)
| ~ totalorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_39]) ).
cnf(c_0_45,negated_conjecture,
app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,esk56_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_28]),c_0_30]),c_0_32])]) ).
cnf(c_0_46,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_41,c_0_15]) ).
cnf(c_0_47,plain,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_48,negated_conjecture,
( nil = esk50_0
| cons(esk58_0,nil) = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_49,negated_conjecture,
( nil = esk50_0
| ssItem(esk58_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_50,plain,
! [X202] :
( ~ ssItem(X202)
| cyclefreeP(cons(X202,nil)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax59])]) ).
cnf(c_0_51,plain,
( ~ leq(X1,X2)
| ~ leq(X2,X1)
| ~ cyclefreeP(app(app(X3,cons(X2,X4)),cons(X1,X5)))
| ~ ssList(app(app(X3,cons(X2,X4)),cons(X1,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X1)
| ~ ssItem(X2) ),
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_52,negated_conjecture,
leq(esk53_0,esk52_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_53,negated_conjecture,
( leq(esk52_0,esk53_0)
| ~ totalorderedP(esk50_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_30]),c_0_19]),c_0_20]),c_0_32]),c_0_25])]) ).
cnf(c_0_54,negated_conjecture,
( esk50_0 = nil
| totalorderedP(esk50_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_55,plain,
( cyclefreeP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_56,negated_conjecture,
( ~ leq(esk52_0,esk53_0)
| ~ cyclefreeP(esk50_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_45]),c_0_52]),c_0_46]),c_0_30]),c_0_19]),c_0_20]),c_0_32]),c_0_25])]) ).
cnf(c_0_57,negated_conjecture,
( esk50_0 = nil
| leq(esk52_0,esk53_0) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_58,negated_conjecture,
( esk50_0 = nil
| cyclefreeP(esk50_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_48]),c_0_49]) ).
cnf(c_0_59,negated_conjecture,
esk50_0 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]) ).
cnf(c_0_60,plain,
cyclefreeP(nil),
inference(split_conjunct,[status(thm)],[ax60]) ).
cnf(c_0_61,plain,
totalorderedP(nil),
inference(split_conjunct,[status(thm)],[ax66]) ).
cnf(c_0_62,negated_conjecture,
~ leq(esk52_0,esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_59]),c_0_60])]) ).
cnf(c_0_63,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_59]),c_0_61])]),c_0_62]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC152+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Oct 3 02:05:38 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.50 Running first-order model finding
% 0.20/0.50 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/tmp/tmp.0fYGYE4xnC/E---3.1_3036.p
% 0.59/0.62 # Version: 3.1pre001
% 0.59/0.62 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.59/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.59/0.62 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.59/0.62 # Starting new_bool_3 with 300s (1) cores
% 0.59/0.62 # Starting new_bool_1 with 300s (1) cores
% 0.59/0.62 # Starting sh5l with 300s (1) cores
% 0.59/0.62 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3191 completed with status 0
% 0.59/0.62 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.59/0.62 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.59/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.59/0.62 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.59/0.62 # No SInE strategy applied
% 0.59/0.62 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.59/0.62 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.59/0.62 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.59/0.62 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.59/0.62 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.59/0.62 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.59/0.62 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.59/0.62 # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 3206 completed with status 0
% 0.59/0.62 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 0.59/0.62 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.59/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.59/0.62 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.59/0.62 # No SInE strategy applied
% 0.59/0.62 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.59/0.62 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.59/0.62 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.59/0.62 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.59/0.62 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.59/0.62 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.59/0.62 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.59/0.62 # Preprocessing time : 0.004 s
% 0.59/0.62 # Presaturation interreduction done
% 0.59/0.62
% 0.59/0.62 # Proof found!
% 0.59/0.62 # SZS status Theorem
% 0.59/0.62 # SZS output start CNFRefutation
% See solution above
% 0.59/0.62 # Parsed axioms : 96
% 0.59/0.62 # Removed by relevancy pruning/SinE : 0
% 0.59/0.62 # Initial clauses : 214
% 0.59/0.62 # Removed in clause preprocessing : 2
% 0.59/0.62 # Initial clauses in saturation : 212
% 0.59/0.62 # Processed clauses : 729
% 0.59/0.62 # ...of these trivial : 4
% 0.59/0.62 # ...subsumed : 119
% 0.59/0.62 # ...remaining for further processing : 605
% 0.59/0.62 # Other redundant clauses eliminated : 65
% 0.59/0.62 # Clauses deleted for lack of memory : 0
% 0.59/0.62 # Backward-subsumed : 12
% 0.59/0.62 # Backward-rewritten : 124
% 0.59/0.62 # Generated clauses : 1642
% 0.59/0.62 # ...of the previous two non-redundant : 1522
% 0.59/0.62 # ...aggressively subsumed : 0
% 0.59/0.62 # Contextual simplify-reflections : 47
% 0.59/0.62 # Paramodulations : 1574
% 0.59/0.62 # Factorizations : 0
% 0.59/0.62 # NegExts : 0
% 0.59/0.62 # Equation resolutions : 70
% 0.59/0.62 # Total rewrite steps : 1139
% 0.59/0.62 # Propositional unsat checks : 0
% 0.59/0.62 # Propositional check models : 0
% 0.59/0.62 # Propositional check unsatisfiable : 0
% 0.59/0.62 # Propositional clauses : 0
% 0.59/0.62 # Propositional clauses after purity: 0
% 0.59/0.62 # Propositional unsat core size : 0
% 0.59/0.62 # Propositional preprocessing time : 0.000
% 0.59/0.62 # Propositional encoding time : 0.000
% 0.59/0.62 # Propositional solver time : 0.000
% 0.59/0.62 # Success case prop preproc time : 0.000
% 0.59/0.62 # Success case prop encoding time : 0.000
% 0.59/0.62 # Success case prop solver time : 0.000
% 0.59/0.62 # Current number of processed clauses : 240
% 0.59/0.62 # Positive orientable unit clauses : 26
% 0.59/0.62 # Positive unorientable unit clauses: 0
% 0.59/0.62 # Negative unit clauses : 3
% 0.59/0.62 # Non-unit-clauses : 211
% 0.59/0.62 # Current number of unprocessed clauses: 1209
% 0.59/0.62 # ...number of literals in the above : 7042
% 0.59/0.62 # Current number of archived formulas : 0
% 0.59/0.62 # Current number of archived clauses : 342
% 0.59/0.62 # Clause-clause subsumption calls (NU) : 26476
% 0.59/0.62 # Rec. Clause-clause subsumption calls : 7833
% 0.59/0.62 # Non-unit clause-clause subsumptions : 172
% 0.59/0.62 # Unit Clause-clause subsumption calls : 192
% 0.59/0.62 # Rewrite failures with RHS unbound : 0
% 0.59/0.62 # BW rewrite match attempts : 35
% 0.59/0.62 # BW rewrite match successes : 16
% 0.59/0.62 # Condensation attempts : 0
% 0.59/0.62 # Condensation successes : 0
% 0.59/0.62 # Termbank termtop insertions : 49870
% 0.59/0.62
% 0.59/0.62 # -------------------------------------------------
% 0.59/0.62 # User time : 0.097 s
% 0.59/0.62 # System time : 0.006 s
% 0.59/0.62 # Total time : 0.103 s
% 0.59/0.62 # Maximum resident set size: 2548 pages
% 0.59/0.62
% 0.59/0.62 # -------------------------------------------------
% 0.59/0.62 # User time : 0.419 s
% 0.59/0.62 # System time : 0.023 s
% 0.59/0.62 # Total time : 0.442 s
% 0.59/0.62 # Maximum resident set size: 1808 pages
% 0.59/0.62 % E---3.1 exiting
%------------------------------------------------------------------------------