%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM471+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.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 01:49:12 PM UTC 2026
% Result : Theorem 6.75s 1.38s
% Output : CNFRefutation 6.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 65 ( 26 unt; 0 def)
% Number of atoms : 269 ( 90 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 333 ( 129 ~; 136 |; 43 &)
% ( 3 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 80 ( 0 sgn 46 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefQuot,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( doDivides0(X1,X2)
& X1 != sz00 )
=> ! [X3] :
( X3 = sdtsldt0(X2,X1)
<=> ( X2 = sdtasdt0(X1,X3)
& aNaturalNumber0(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefQuot) ).
fof(m__1347,hypothesis,
xl != sz00,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1347) ).
fof(mLETotal,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtlseqdt0(X2,X1)
& X2 != X1 )
| sdtlseqdt0(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLETotal) ).
fof(m__,conjecture,
sdtlseqdt0(xp,xq),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__1324_04,hypothesis,
( doDivides0(xl,sdtpldt0(xm,xn))
& doDivides0(xl,xm) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1324_04) ).
fof(m__1360,hypothesis,
xp = sdtsldt0(xm,xl),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1360) ).
fof(m__1324,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xl) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1324) ).
fof(m__1379,hypothesis,
xq = sdtsldt0(sdtpldt0(xm,xn),xl),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1379) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB) ).
fof(mMonMul,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtlseqdt0(X2,X3)
& X2 != X3
& X1 != sz00 )
=> ( sdtlseqdt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1))
& sdtasdt0(X2,X1) != sdtasdt0(X3,X1)
& sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
& sdtasdt0(X1,X2) != sdtasdt0(X1,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMonMul) ).
fof(mMulCanc,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 != sz00
=> ! [X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2) )
=> ( ( sdtasdt0(X2,X1) = sdtasdt0(X3,X1)
| sdtasdt0(X1,X2) = sdtasdt0(X1,X3) )
=> X2 = X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulCanc) ).
fof(mDefLE,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( sdtlseqdt0(X1,X2)
<=> ? [X3] :
( sdtpldt0(X1,X3) = X2
& aNaturalNumber0(X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefLE) ).
fof(mLEAsym,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtlseqdt0(X2,X1)
& sdtlseqdt0(X1,X2) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLEAsym) ).
fof(c_0_13,plain,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( doDivides0(X1,X2)
& X1 != sz00 )
=> ! [X3] :
( X3 = sdtsldt0(X2,X1)
<=> ( X2 = sdtasdt0(X1,X3)
& aNaturalNumber0(X3) ) ) ) ),
inference(fof_simplification,[status(thm)],[mDefQuot]) ).
fof(c_0_14,plain,
! [X67,X68,X69] :
( ( ~ aNaturalNumber0(X68)
| ~ aNaturalNumber0(X67)
| ~ doDivides0(X67,X68)
| X67 = sz00
| X69 = sdtsldt0(X68,X67)
| X68 != sdtasdt0(X67,X69)
| ~ aNaturalNumber0(X69) )
& ( ~ aNaturalNumber0(X68)
| ~ aNaturalNumber0(X67)
| ~ doDivides0(X67,X68)
| X67 = sz00
| X69 != sdtsldt0(X68,X67)
| X68 = sdtasdt0(X67,X69) )
& ( ~ aNaturalNumber0(X68)
| ~ aNaturalNumber0(X67)
| ~ doDivides0(X67,X68)
| X67 = sz00
| X69 != sdtsldt0(X68,X67)
| aNaturalNumber0(X69) ) ),
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_13])])])])]) ).
fof(c_0_15,hypothesis,
xl != sz00,
inference(fof_simplification,[status(thm)],[m__1347]) ).
fof(c_0_16,plain,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtlseqdt0(X2,X1)
& X2 != X1 )
| sdtlseqdt0(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[mLETotal]) ).
cnf(c_0_17,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ doDivides0(X3,X2)
| X1 != sdtsldt0(X2,X3)
| X3 = sz00
| aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_18,hypothesis,
xl != sz00,
inference(fof_nnf,[status(thm)],[c_0_15]) ).
fof(c_0_19,negated_conjecture,
~ sdtlseqdt0(xp,xq),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_20,plain,
! [X48,X49] :
( ( ~ aNaturalNumber0(X49)
| ~ aNaturalNumber0(X48)
| sdtlseqdt0(X48,X49)
| sdtlseqdt0(X49,X48) )
& ( ~ aNaturalNumber0(X49)
| ~ aNaturalNumber0(X48)
| sdtlseqdt0(X48,X49)
| X49 != X48 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
cnf(c_0_21,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X2)
| aNaturalNumber0(sdtsldt0(X2,X1))
| X1 = sz00 ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_22,hypothesis,
doDivides0(xl,xm),
inference(split_conjunct,[status(thm)],[m__1324_04]) ).
cnf(c_0_23,hypothesis,
xp = sdtsldt0(xm,xl),
inference(split_conjunct,[status(thm)],[m__1360]) ).
cnf(c_0_24,hypothesis,
aNaturalNumber0(xl),
inference(split_conjunct,[status(thm)],[m__1324]) ).
cnf(c_0_25,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1324]) ).
cnf(c_0_26,hypothesis,
xl != sz00,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,hypothesis,
doDivides0(xl,sdtpldt0(xm,xn)),
inference(split_conjunct,[status(thm)],[m__1324_04]) ).
cnf(c_0_28,hypothesis,
xq = sdtsldt0(sdtpldt0(xm,xn),xl),
inference(split_conjunct,[status(thm)],[m__1379]) ).
fof(c_0_29,plain,
! [X5,X6] :
( aNaturalNumber0(sdtpldt0(X5,X6))
| ~ aNaturalNumber0(X6)
| ~ aNaturalNumber0(X5) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])])]) ).
fof(c_0_30,negated_conjecture,
~ sdtlseqdt0(xp,xq),
inference(fof_simplification,[status(thm)],[c_0_19]) ).
fof(c_0_31,plain,
! [X1,X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtlseqdt0(X2,X3)
& X2 != X3
& X1 != sz00 )
=> ( sdtlseqdt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1))
& sdtasdt0(X2,X1) != sdtasdt0(X3,X1)
& sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
& sdtasdt0(X1,X2) != sdtasdt0(X1,X3) ) ) ),
inference(fof_simplification,[status(thm)],[mMonMul]) ).
cnf(c_0_32,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| sdtlseqdt0(X2,X1)
| sdtlseqdt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_33,hypothesis,
aNaturalNumber0(xp),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24]),c_0_25])]),c_0_26]) ).
cnf(c_0_34,hypothesis,
( ~ aNaturalNumber0(sdtpldt0(xm,xn))
| aNaturalNumber0(xq) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_27]),c_0_28]),c_0_24])]),c_0_26]) ).
cnf(c_0_35,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtpldt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1324]) ).
fof(c_0_37,negated_conjecture,
~ sdtlseqdt0(xp,xq),
inference(fof_nnf,[status(thm)],[c_0_30]) ).
cnf(c_0_38,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,X1)
| X3 != sdtsldt0(X1,X2)
| X2 = sz00
| X1 = sdtasdt0(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_39,plain,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 != sz00
=> ! [X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2) )
=> ( ( sdtasdt0(X2,X1) = sdtasdt0(X3,X1)
| sdtasdt0(X1,X2) = sdtasdt0(X1,X3) )
=> X2 = X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[mMulCanc]) ).
fof(c_0_40,plain,
! [X35,X36,X38] :
( ( ~ aNaturalNumber0(X36)
| ~ aNaturalNumber0(X35)
| sdtlseqdt0(X35,X36)
| sdtpldt0(X35,X38) != X36
| ~ aNaturalNumber0(X38) )
& ( ~ aNaturalNumber0(X36)
| ~ aNaturalNumber0(X35)
| ~ sdtlseqdt0(X35,X36)
| sdtpldt0(X35,esk1_2(X35,X36)) = X36 )
& ( ~ aNaturalNumber0(X36)
| ~ aNaturalNumber0(X35)
| ~ sdtlseqdt0(X35,X36)
| aNaturalNumber0(esk1_2(X35,X36)) ) ),
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)],[mDefLE])])])])])]) ).
fof(c_0_41,plain,
! [X53,X54,X55] :
( ( ~ aNaturalNumber0(X55)
| ~ aNaturalNumber0(X54)
| ~ aNaturalNumber0(X53)
| ~ sdtlseqdt0(X54,X55)
| X54 = X55
| X53 = sz00
| sdtlseqdt0(sdtasdt0(X54,X53),sdtasdt0(X55,X53)) )
& ( ~ aNaturalNumber0(X55)
| ~ aNaturalNumber0(X54)
| ~ aNaturalNumber0(X53)
| ~ sdtlseqdt0(X54,X55)
| X54 = X55
| X53 = sz00
| sdtasdt0(X54,X53) != sdtasdt0(X55,X53) )
& ( ~ aNaturalNumber0(X55)
| ~ aNaturalNumber0(X54)
| ~ aNaturalNumber0(X53)
| ~ sdtlseqdt0(X54,X55)
| X54 = X55
| X53 = sz00
| sdtlseqdt0(sdtasdt0(X53,X54),sdtasdt0(X53,X55)) )
& ( ~ aNaturalNumber0(X55)
| ~ aNaturalNumber0(X54)
| ~ aNaturalNumber0(X53)
| ~ sdtlseqdt0(X54,X55)
| X54 = X55
| X53 = sz00
| sdtasdt0(X53,X54) != sdtasdt0(X53,X55) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])])])]) ).
cnf(c_0_42,hypothesis,
( ~ aNaturalNumber0(X1)
| sdtlseqdt0(xp,X1)
| sdtlseqdt0(X1,xp) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_43,hypothesis,
aNaturalNumber0(xq),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_25])]) ).
cnf(c_0_44,negated_conjecture,
~ sdtlseqdt0(xp,xq),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_45,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X2)
| X1 = sz00
| sdtasdt0(X1,sdtsldt0(X2,X1)) = X2 ),
inference(er,[status(thm)],[c_0_38]) ).
fof(c_0_46,plain,
! [X28,X29,X30] :
( ( ~ aNaturalNumber0(X28)
| X28 = sz00
| ~ aNaturalNumber0(X30)
| ~ aNaturalNumber0(X29)
| X29 = X30
| sdtasdt0(X29,X28) != sdtasdt0(X30,X28) )
& ( ~ aNaturalNumber0(X28)
| X28 = sz00
| ~ aNaturalNumber0(X30)
| ~ aNaturalNumber0(X29)
| X29 = X30
| sdtasdt0(X28,X29) != sdtasdt0(X28,X30) ) ),
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_39])])])])]) ).
fof(c_0_47,plain,
! [X43,X44] :
( X43 = X44
| ~ sdtlseqdt0(X44,X43)
| ~ sdtlseqdt0(X43,X44)
| ~ aNaturalNumber0(X44)
| ~ aNaturalNumber0(X43) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLEAsym])])]) ).
cnf(c_0_48,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| sdtpldt0(X2,X1) != X3
| ~ aNaturalNumber0(X1)
| sdtlseqdt0(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_49,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(X2,X3)
| X2 = X3
| X1 = sz00
| sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_50,hypothesis,
sdtlseqdt0(xq,xp),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_51,hypothesis,
( ~ aNaturalNumber0(sdtpldt0(xm,xn))
| sdtasdt0(xl,xq) = sdtpldt0(xm,xn) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_27]),c_0_28]),c_0_24])]),c_0_26]) ).
cnf(c_0_52,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| sdtasdt0(X1,X2) != sdtasdt0(X1,X3)
| X1 = sz00
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_53,plain,
( ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_54,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtlseqdt0(X1,sdtpldt0(X1,X2)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_48]),c_0_35]) ).
cnf(c_0_55,hypothesis,
( ~ aNaturalNumber0(X1)
| sdtlseqdt0(sdtasdt0(X1,xq),sdtasdt0(X1,xp))
| X1 = sz00
| xq = xp ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_33]),c_0_43])]) ).
cnf(c_0_56,hypothesis,
sdtasdt0(xl,xq) = sdtpldt0(xm,xn),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_35]),c_0_36]),c_0_25])]) ).
cnf(c_0_57,hypothesis,
sdtasdt0(xl,xp) = xm,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_22]),c_0_23]),c_0_24]),c_0_25])]),c_0_26]) ).
cnf(c_0_58,hypothesis,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtasdt0(X2,X1) != sdtasdt0(X2,xp)
| X2 = sz00
| X1 = xp ),
inference(spm,[status(thm)],[c_0_52,c_0_33]) ).
cnf(c_0_59,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(sdtpldt0(X1,X2),X1)
| sdtpldt0(X1,X2) = X1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_35]) ).
cnf(c_0_60,hypothesis,
( sdtlseqdt0(sdtpldt0(xm,xn),xm)
| xq = xp ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_24]),c_0_56]),c_0_57]),c_0_26]) ).
cnf(c_0_61,hypothesis,
( sdtpldt0(xm,xn) != xm
| xq = xp ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_56]),c_0_57]),c_0_43]),c_0_24])]),c_0_26]) ).
cnf(c_0_62,hypothesis,
xq = xp,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_25]),c_0_36])]),c_0_61]) ).
cnf(c_0_63,hypothesis,
sdtlseqdt0(xp,xp),
inference(spm,[status(thm)],[c_0_42,c_0_33]) ).
cnf(c_0_64,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_62]),c_0_63])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM471+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.36 % Computer : n018.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 21 02:34:43 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/0.43 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
% 6.75/1.38 % Version: 3.5.1
% 6.75/1.38 % Preprocessing class: FSLSSMSSSSSNFFN.
% 6.75/1.38 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.75/1.38 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 6.75/1.38 % Starting new_bool_3 with 300s (1) cores
% 6.75/1.38 % Starting new_bool_1 with 300s (1) cores
% 6.75/1.38 % Starting sh5l with 300s (1) cores
% 6.75/1.38 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 778700 completed with status 0
% 6.75/1.38 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 6.75/1.38 % Preprocessing class: FSLSSMSSSSSNFFN.
% 6.75/1.38 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.75/1.38 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 6.75/1.38 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.75/1.38 % No SInE strategy applied
% 6.75/1.38 % Search class: FGUSF-FFMM22-SFFFFFNN
% 6.75/1.38 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 6.75/1.38 % Starting SubtermCWHack with 136s (1) cores
% 6.75/1.38 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 6.75/1.38 % Starting G-E--_107_B42_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 6.75/1.38 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 6.75/1.38 % Starting new_bool_3 with 136s (1) cores
% 6.75/1.38 % G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 778708 completed with status 0
% 6.75/1.38 % Result found by G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 6.75/1.38 % Preprocessing class: FSLSSMSSSSSNFFN.
% 6.75/1.38 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.75/1.38 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 6.75/1.38 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.75/1.38 % No SInE strategy applied
% 6.75/1.38 % Search class: FGUSF-FFMM22-SFFFFFNN
% 6.75/1.38 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 6.75/1.38 % Starting SubtermCWHack with 136s (1) cores
% 6.75/1.38 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 6.75/1.38 % Starting G-E--_107_B42_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 6.75/1.38 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 6.75/1.38 % Preprocessing time : 0.003 s
% 6.75/1.38 % Presaturation interreduction done
% 6.75/1.38
% 6.75/1.38 % Proof found!
% 6.75/1.38 % SZS status Theorem
% 6.75/1.38 % SZS output start CNFRefutation
% See solution above
% 6.75/1.38 % Parsed axioms : 39
% 6.75/1.38 % Removed by relevancy pruning/SinE : 0
% 6.75/1.38 % Initial clauses : 66
% 6.75/1.38 % Removed in clause preprocessing : 3
% 6.75/1.38 % Initial clauses in saturation : 63
% 6.75/1.38 % Processed clauses : 4875
% 6.75/1.38 % ...of these trivial : 245
% 6.75/1.38 % ...subsumed : 2634
% 6.75/1.38 % ...remaining for further processing : 1996
% 6.75/1.38 % Other redundant clauses eliminated : 298
% 6.75/1.38 % Clauses deleted for lack of memory : 0
% 6.75/1.38 % Backward-subsumed : 250
% 6.75/1.38 % Backward-rewritten : 693
% 6.75/1.38 % Generated clauses : 36606
% 6.75/1.38 % ...of the previous two non-redundant : 33714
% 6.75/1.38 % ...aggressively subsumed : 0
% 6.75/1.38 % Contextual simplify-reflections : 93
% 6.75/1.38 % Paramodulations : 36240
% 6.75/1.38 % Factorizations : 0
% 6.75/1.38 % NegExts : 0
% 6.75/1.38 % Equation resolutions : 329
% 6.75/1.38 % Disequality decompositions : 0
% 6.75/1.38 % Total rewrite steps : 38410
% 6.75/1.38 % ...of those cached : 38154
% 6.75/1.38 % Propositional unsat checks : 0
% 6.75/1.38 % Propositional check models : 0
% 6.75/1.38 % Propositional check unsatisfiable : 0
% 6.75/1.38 % Propositional clauses : 0
% 6.75/1.38 % Propositional clauses after purity: 0
% 6.75/1.38 % Propositional unsat core size : 0
% 6.75/1.38 % Propositional preprocessing time : 0.000
% 6.75/1.38 % Propositional encoding time : 0.000
% 6.75/1.38 % Propositional solver time : 0.000
% 6.75/1.38 % Success case prop preproc time : 0.000
% 6.75/1.38 % Success case prop encoding time : 0.000
% 6.75/1.38 % Success case prop solver time : 0.000
% 6.75/1.38 % Current number of processed clauses : 949
% 6.75/1.38 % Positive orientable unit clauses : 226
% 6.75/1.38 % Positive unorientable unit clauses: 0
% 6.75/1.38 % Negative unit clauses : 78
% 6.75/1.38 % Non-unit-clauses : 645
% 6.75/1.38 % Current number of unprocessed clauses: 28253
% 6.75/1.38 % ...number of literals in the above : 120311
% 6.75/1.38 % Current number of archived formulas : 0
% 6.75/1.38 % Current number of archived clauses : 1038
% 6.75/1.38 % Clause-clause subsumption calls (NU) : 179718
% 6.75/1.38 % Rec. Clause-clause subsumption calls : 80457
% 6.75/1.38 % Non-unit clause-clause subsumptions : 2210
% 6.75/1.38 % Unit Clause-clause subsumption calls : 21286
% 6.75/1.38 % Rewrite failures with RHS unbound : 0
% 6.75/1.38 % BW rewrite match attempts : 102
% 6.75/1.38 % BW rewrite match successes : 82
% 6.75/1.38 % Condensation attempts : 0
% 6.75/1.38 % Condensation successes : 0
% 6.75/1.38 % Termbank termtop insertions : 676912
% 6.75/1.38 % Search garbage collected termcells : 1039
% 6.75/1.38
% 6.75/1.38 % -------------------------------------------------
% 6.75/1.38 % User time : 0.842 s
% 6.75/1.38 % System time : 0.045 s
% 6.75/1.38 % Total time : 0.886 s
% 6.75/1.38 % Maximum resident set size: 3928 pages
% 6.75/1.38
% 6.75/1.38 % -------------------------------------------------
% 6.75/1.38 % User time : 4.313 s
% 6.75/1.38 % System time : 0.194 s
% 6.75/1.38 % Total time : 4.507 s
% 6.75/1.38 % Maximum resident set size: 4864 pages
% 6.75/1.38 % E exiting
%------------------------------------------------------------------------------