%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM524+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 : n016.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:55:21 PM UTC 2026
% Result : Theorem 0.54s 0.71s
% Output : CNFRefutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 11
% Syntax : Number of formulae : 69 ( 30 unt; 0 def)
% Number of atoms : 229 ( 93 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 272 ( 112 ~; 106 |; 35 &)
% ( 3 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 79 ( 0 sgn 37 !; 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__2987,hypothesis,
( xp != sz00
& xm != sz00
& xn != sz00
& aNaturalNumber0(xp)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2987) ).
fof(mMulAsso,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulAsso) ).
fof(m__3046,hypothesis,
( doDivides0(xp,xn)
& doDivides0(xp,sdtasdt0(xn,xn)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3046) ).
fof(m__3059,hypothesis,
xq = sdtsldt0(xn,xp),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3059) ).
fof(mDefDiv,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( X2 = sdtasdt0(X1,X3)
& aNaturalNumber0(X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefDiv) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB_02) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulComm) ).
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(m__,conjecture,
sdtasdt0(xm,xm) = sdtasdt0(xp,sdtasdt0(xq,xq)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__3014,hypothesis,
sdtasdt0(xp,sdtasdt0(xm,xm)) = sdtasdt0(xn,xn),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3014) ).
fof(c_0_11,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_12,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_11])])])])]) ).
fof(c_0_13,hypothesis,
( xp != sz00
& xm != sz00
& xn != sz00
& aNaturalNumber0(xp)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
inference(fof_simplification,[status(thm)],[m__2987]) ).
cnf(c_0_14,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_12]) ).
fof(c_0_15,hypothesis,
( xp != sz00
& xm != sz00
& xn != sz00
& aNaturalNumber0(xp)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
inference(fof_nnf,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ doDivides0(X3,X2)
| X1 != sdtsldt0(X2,X3)
| X3 = sz00
| aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X17,X18,X19] :
( sdtasdt0(sdtasdt0(X17,X18),X19) = sdtasdt0(X17,sdtasdt0(X18,X19))
| ~ aNaturalNumber0(X19)
| ~ aNaturalNumber0(X18)
| ~ aNaturalNumber0(X17) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulAsso])])]) ).
cnf(c_0_18,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X2)
| X1 = sz00
| sdtasdt0(X1,sdtsldt0(X2,X1)) = X2 ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_19,hypothesis,
doDivides0(xp,xn),
inference(split_conjunct,[status(thm)],[m__3046]) ).
cnf(c_0_20,hypothesis,
xq = sdtsldt0(xn,xp),
inference(split_conjunct,[status(thm)],[m__3059]) ).
cnf(c_0_21,hypothesis,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,hypothesis,
xp != sz00,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X2)
| aNaturalNumber0(sdtsldt0(X2,X1))
| X1 = sz00 ),
inference(er,[status(thm)],[c_0_16]) ).
fof(c_0_25,plain,
! [X63,X64,X66] :
( ( ~ aNaturalNumber0(X64)
| ~ aNaturalNumber0(X63)
| doDivides0(X63,X64)
| X64 != sdtasdt0(X63,X66)
| ~ aNaturalNumber0(X66) )
& ( ~ aNaturalNumber0(X64)
| ~ aNaturalNumber0(X63)
| ~ doDivides0(X63,X64)
| X64 = sdtasdt0(X63,esk2_2(X63,X64)) )
& ( ~ aNaturalNumber0(X64)
| ~ aNaturalNumber0(X63)
| ~ doDivides0(X63,X64)
| aNaturalNumber0(esk2_2(X63,X64)) ) ),
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)],[mDefDiv])])])])])]) ).
fof(c_0_26,plain,
! [X7,X8] :
( aNaturalNumber0(sdtasdt0(X7,X8))
| ~ aNaturalNumber0(X8)
| ~ aNaturalNumber0(X7) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
cnf(c_0_27,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_28,hypothesis,
sdtasdt0(xp,xq) = xn,
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_18,c_0_19]),c_0_20]),c_0_21]),c_0_22])]),c_0_23]) ).
cnf(c_0_29,hypothesis,
aNaturalNumber0(xq),
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_24,c_0_19]),c_0_20]),c_0_21]),c_0_22])]),c_0_23]) ).
fof(c_0_30,plain,
! [X15,X16] :
( sdtasdt0(X15,X16) = sdtasdt0(X16,X15)
| ~ aNaturalNumber0(X16)
| ~ aNaturalNumber0(X15) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])])]) ).
cnf(c_0_31,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| X2 != sdtasdt0(X3,X1)
| ~ aNaturalNumber0(X1)
| doDivides0(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_33,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]) ).
cnf(c_0_34,hypothesis,
( ~ aNaturalNumber0(X1)
| sdtasdt0(xp,sdtasdt0(xq,X1)) = sdtasdt0(xn,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_21])]),c_0_29])]) ).
cnf(c_0_35,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| doDivides0(X1,sdtasdt0(X1,X2)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_31]),c_0_32]) ).
fof(c_0_37,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_33])])])])]) ).
cnf(c_0_38,hypothesis,
( ~ aNaturalNumber0(X1)
| sdtasdt0(xp,sdtasdt0(X1,xq)) = sdtasdt0(xn,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_29])]) ).
cnf(c_0_39,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| doDivides0(X1,sdtasdt0(X2,X1)) ),
inference(spm,[status(thm)],[c_0_36,c_0_35]) ).
cnf(c_0_40,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| sdtasdt0(X1,X2) != sdtasdt0(X3,X2)
| X2 = sz00
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_41,hypothesis,
sdtasdt0(xp,xn) = sdtasdt0(xn,xp),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_28]),c_0_21])]) ).
cnf(c_0_42,hypothesis,
xn != sz00,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_43,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,X1)
| X1 = sdtasdt0(X2,esk2_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_44,hypothesis,
doDivides0(xq,xn),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_28]),c_0_29]),c_0_21])]) ).
cnf(c_0_45,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X2)
| aNaturalNumber0(esk2_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_46,hypothesis,
( ~ aNaturalNumber0(X1)
| sdtasdt0(xn,xp) != sdtasdt0(X1,xn)
| xp = X1 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_22]),c_0_21])]),c_0_42]) ).
cnf(c_0_47,hypothesis,
sdtasdt0(xq,esk2_2(xq,xn)) = xn,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_29]),c_0_22])]) ).
cnf(c_0_48,hypothesis,
aNaturalNumber0(esk2_2(xq,xn)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_44]),c_0_22]),c_0_29])]) ).
cnf(c_0_49,hypothesis,
( ~ aNaturalNumber0(X1)
| sdtasdt0(xn,xp) != sdtasdt0(xn,X1)
| xp = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_35]),c_0_22])]) ).
cnf(c_0_50,hypothesis,
sdtasdt0(xn,esk2_2(xq,xn)) = sdtasdt0(xn,xp),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_47]),c_0_41]),c_0_48])]) ).
cnf(c_0_51,hypothesis,
esk2_2(xq,xn) = xp,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_48])]) ).
fof(c_0_52,negated_conjecture,
sdtasdt0(xm,xm) != sdtasdt0(xp,sdtasdt0(xq,xq)),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_53,hypothesis,
sdtasdt0(xq,xp) = xn,
inference(rw,[status(thm)],[c_0_47,c_0_51]) ).
cnf(c_0_54,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ doDivides0(X3,X2)
| X2 != sdtasdt0(X3,X1)
| ~ aNaturalNumber0(X1)
| X3 = sz00
| X1 = sdtsldt0(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_55,negated_conjecture,
sdtasdt0(xm,xm) != sdtasdt0(xp,sdtasdt0(xq,xq)),
inference(fof_simplification,[status(thm)],[c_0_52]) ).
cnf(c_0_56,hypothesis,
( ~ aNaturalNumber0(X1)
| sdtasdt0(xq,sdtasdt0(xp,X1)) = sdtasdt0(xn,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_53]),c_0_21]),c_0_29])]) ).
cnf(c_0_57,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| X1 = sz00
| sdtsldt0(sdtasdt0(X1,X2),X1) = X2 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_54]),c_0_32]),c_0_36]) ).
cnf(c_0_58,hypothesis,
sdtasdt0(xp,sdtasdt0(xm,xm)) = sdtasdt0(xn,xn),
inference(split_conjunct,[status(thm)],[m__3014]) ).
fof(c_0_59,negated_conjecture,
sdtasdt0(xm,xm) != sdtasdt0(xp,sdtasdt0(xq,xq)),
inference(fof_nnf,[status(thm)],[c_0_55]) ).
cnf(c_0_60,hypothesis,
sdtasdt0(xq,xn) = sdtasdt0(xn,xq),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_28]),c_0_29])]) ).
cnf(c_0_61,hypothesis,
( ~ aNaturalNumber0(sdtasdt0(xm,xm))
| sdtsldt0(sdtasdt0(xn,xn),xp) = sdtasdt0(xm,xm) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_21])]),c_0_23]) ).
cnf(c_0_62,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_63,negated_conjecture,
sdtasdt0(xm,xm) != sdtasdt0(xp,sdtasdt0(xq,xq)),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_64,hypothesis,
sdtasdt0(xp,sdtasdt0(xn,xq)) = sdtasdt0(xn,xn),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_60]),c_0_22])]) ).
cnf(c_0_65,hypothesis,
sdtsldt0(sdtasdt0(xn,xn),xp) = sdtasdt0(xm,xm),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_32]),c_0_62])]) ).
cnf(c_0_66,hypothesis,
aNaturalNumber0(sdtasdt0(xn,xq)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_60]),c_0_22]),c_0_29])]) ).
cnf(c_0_67,negated_conjecture,
sdtasdt0(xm,xm) != sdtasdt0(xn,xq),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_34]),c_0_29])]) ).
cnf(c_0_68,hypothesis,
$false,
inference(sr,[status(thm)],[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_57,c_0_64]),c_0_65]),c_0_21]),c_0_66])]),c_0_67]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM524+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.46 % Computer : n016.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Mon Sep 21 02:42:23 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.54 Running first-order theorem proving
% 0.24/0.54 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.54/0.71 % Version: 3.5.1
% 0.54/0.71 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.54/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.54/0.71 % Starting new_bool_3 with 300s (1) cores
% 0.54/0.71 % Starting new_bool_1 with 300s (1) cores
% 0.54/0.71 % Starting sh5l with 300s (1) cores
% 0.54/0.71 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1382487 completed with status 0
% 0.54/0.71 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.54/0.71 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.54/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.54/0.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.54/0.71 % No SInE strategy applied
% 0.54/0.71 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.54/0.71 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.54/0.71 % Starting SubtermCWHack with 136s (1) cores
% 0.54/0.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.54/0.71 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m with 136s (1) cores
% 0.54/0.71 % Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 0.54/0.71 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.54/0.71 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1382494 completed with status 0
% 0.54/0.71 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.54/0.71 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.54/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.54/0.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.54/0.71 % No SInE strategy applied
% 0.54/0.71 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.54/0.71 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.54/0.71 % Starting SubtermCWHack with 136s (1) cores
% 0.54/0.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.54/0.71 % Preprocessing time : 0.004 s
% 0.54/0.71 % Presaturation interreduction done
% 0.54/0.71
% 0.54/0.71 % Proof found!
% 0.54/0.71 % SZS status Theorem
% 0.54/0.71 % SZS output start CNFRefutation
% See solution above
% 0.54/0.72 % Parsed axioms : 46
% 0.54/0.72 % Removed by relevancy pruning/SinE : 0
% 0.54/0.72 % Initial clauses : 84
% 0.54/0.72 % Removed in clause preprocessing : 3
% 0.54/0.72 % Initial clauses in saturation : 81
% 0.54/0.72 % Processed clauses : 519
% 0.54/0.72 % ...of these trivial : 30
% 0.54/0.72 % ...subsumed : 143
% 0.54/0.72 % ...remaining for further processing : 346
% 0.54/0.72 % Other redundant clauses eliminated : 19
% 0.54/0.72 % Clauses deleted for lack of memory : 0
% 0.54/0.72 % Backward-subsumed : 5
% 0.54/0.72 % Backward-rewritten : 30
% 0.54/0.72 % Generated clauses : 1452
% 0.54/0.72 % ...of the previous two non-redundant : 1213
% 0.54/0.72 % ...aggressively subsumed : 0
% 0.54/0.72 % Contextual simplify-reflections : 11
% 0.54/0.72 % Paramodulations : 1425
% 0.54/0.72 % Factorizations : 2
% 0.54/0.72 % NegExts : 0
% 0.54/0.72 % Equation resolutions : 25
% 0.54/0.72 % Disequality decompositions : 0
% 0.54/0.72 % Total rewrite steps : 2056
% 0.54/0.72 % ...of those cached : 1972
% 0.54/0.72 % Propositional unsat checks : 0
% 0.54/0.72 % Propositional check models : 0
% 0.54/0.72 % Propositional check unsatisfiable : 0
% 0.54/0.72 % Propositional clauses : 0
% 0.54/0.72 % Propositional clauses after purity: 0
% 0.54/0.72 % Propositional unsat core size : 0
% 0.54/0.72 % Propositional preprocessing time : 0.000
% 0.54/0.72 % Propositional encoding time : 0.000
% 0.54/0.72 % Propositional solver time : 0.000
% 0.54/0.72 % Success case prop preproc time : 0.000
% 0.54/0.72 % Success case prop encoding time : 0.000
% 0.54/0.72 % Success case prop solver time : 0.000
% 0.54/0.72 % Current number of processed clauses : 224
% 0.54/0.72 % Positive orientable unit clauses : 82
% 0.54/0.72 % Positive unorientable unit clauses: 0
% 0.54/0.72 % Negative unit clauses : 10
% 0.54/0.72 % Non-unit-clauses : 132
% 0.54/0.72 % Current number of unprocessed clauses: 826
% 0.54/0.72 % ...number of literals in the above : 3138
% 0.54/0.72 % Current number of archived formulas : 0
% 0.54/0.72 % Current number of archived clauses : 111
% 0.54/0.72 % Clause-clause subsumption calls (NU) : 1928
% 0.54/0.72 % Rec. Clause-clause subsumption calls : 919
% 0.54/0.72 % Non-unit clause-clause subsumptions : 101
% 0.54/0.72 % Unit Clause-clause subsumption calls : 303
% 0.54/0.72 % Rewrite failures with RHS unbound : 0
% 0.54/0.72 % BW rewrite match attempts : 19
% 0.54/0.72 % BW rewrite match successes : 18
% 0.54/0.72 % Condensation attempts : 0
% 0.54/0.72 % Condensation successes : 0
% 0.54/0.72 % Termbank termtop insertions : 31355
% 0.54/0.72 % Search garbage collected termcells : 1401
% 0.54/0.72
% 0.54/0.72 % -------------------------------------------------
% 0.54/0.72 % User time : 0.069 s
% 0.54/0.72 % System time : 0.013 s
% 0.54/0.72 % Total time : 0.082 s
% 0.54/0.72 % Maximum resident set size: 3940 pages
% 0.54/0.72
% 0.54/0.72 % -------------------------------------------------
% 0.54/0.72 % User time : 0.251 s
% 0.54/0.72 % System time : 0.031 s
% 0.54/0.72 % Total time : 0.282 s
% 0.54/0.72 % Maximum resident set size: 4864 pages
% 0.54/0.72 % E exiting
%------------------------------------------------------------------------------