%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM478+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:14 PM UTC 2026
% Result : Theorem 6.05s 1.31s
% Output : CNFRefutation 6.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 71 ( 24 unt; 0 def)
% Number of atoms : 236 ( 90 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 286 ( 121 ~; 117 |; 28 &)
% ( 3 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 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 : 86 ( 0 sgn 39 !; 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/sandbox/benchmark/theBenchmark.p',mDefQuot) ).
fof(mDefDiv,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( X2 = sdtasdt0(X1,X3)
& aNaturalNumber0(X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefDiv) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB_02) ).
fof(m__1524_04,hypothesis,
( doDivides0(xl,xm)
& xl != sz00 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1524_04) ).
fof(m__1524,hypothesis,
( aNaturalNumber0(xm)
& aNaturalNumber0(xl) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1524) ).
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/sandbox/benchmark/theBenchmark.p',mMulCanc) ).
fof(mSortsC_01,axiom,
( sz10 != sz00
& aNaturalNumber0(sz10) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC_01) ).
fof(m__,conjecture,
sdtasdt0(xn,sdtsldt0(xm,xl)) = sdtsldt0(sdtasdt0(xn,xm),xl),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__1553,hypothesis,
aNaturalNumber0(xn),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1553) ).
fof(m_MulUnit,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 = sdtasdt0(sz10,X1)
& sdtasdt0(X1,sz10) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m_MulUnit) ).
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/sandbox/benchmark/theBenchmark.p',mMulAsso) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulComm) ).
fof(c_0_12,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_13,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_14,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])])]) ).
fof(c_0_15,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_12])])])])]) ).
cnf(c_0_16,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| X2 != sdtasdt0(X3,X1)
| ~ aNaturalNumber0(X1)
| doDivides0(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_18,hypothesis,
( doDivides0(xl,xm)
& xl != sz00 ),
inference(fof_simplification,[status(thm)],[m__1524_04]) ).
cnf(c_0_19,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_15]) ).
cnf(c_0_20,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| doDivides0(X1,sdtasdt0(X1,X2)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_16]),c_0_17]) ).
fof(c_0_21,hypothesis,
( doDivides0(xl,xm)
& xl != sz00 ),
inference(fof_nnf,[status(thm)],[c_0_18]) ).
cnf(c_0_22,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_19]),c_0_17]),c_0_20]) ).
cnf(c_0_23,hypothesis,
aNaturalNumber0(xl),
inference(split_conjunct,[status(thm)],[m__1524]) ).
cnf(c_0_24,hypothesis,
xl != sz00,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_25,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_26,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_15]) ).
cnf(c_0_27,hypothesis,
( ~ aNaturalNumber0(X1)
| sdtsldt0(sdtasdt0(xl,X1),xl) = X1 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_28,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,X1)
| X1 = sdtasdt0(X2,esk2_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_29,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ doDivides0(X3,X2)
| X1 != sdtsldt0(X2,X3)
| X3 = sz00
| aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_30,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_25])])])])]) ).
fof(c_0_31,plain,
( sz10 != sz00
& aNaturalNumber0(sz10) ),
inference(fof_simplification,[status(thm)],[mSortsC_01]) ).
fof(c_0_32,negated_conjecture,
sdtasdt0(xn,sdtsldt0(xm,xl)) != sdtsldt0(sdtasdt0(xn,xm),xl),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_33,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X2)
| X1 = sz00
| sdtasdt0(X1,sdtsldt0(X2,X1)) = X2 ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_34,hypothesis,
doDivides0(xl,xm),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_35,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1524]) ).
cnf(c_0_36,hypothesis,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(esk2_2(xl,X1))
| ~ doDivides0(xl,X1)
| sdtsldt0(X1,xl) = esk2_2(xl,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_23])]) ).
cnf(c_0_37,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X2)
| aNaturalNumber0(esk2_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_38,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X2)
| aNaturalNumber0(sdtsldt0(X2,X1))
| X1 = sz00 ),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_39,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| sdtasdt0(X1,X2) != sdtasdt0(X1,X3)
| X1 = sz00
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_40,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1553]) ).
fof(c_0_41,plain,
! [X20] :
( ( ~ aNaturalNumber0(X20)
| X20 = sdtasdt0(sz10,X20) )
& ( ~ aNaturalNumber0(X20)
| sdtasdt0(X20,sz10) = X20 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_MulUnit])])])]) ).
fof(c_0_42,plain,
( sz10 != sz00
& aNaturalNumber0(sz10) ),
inference(fof_nnf,[status(thm)],[c_0_31]) ).
fof(c_0_43,negated_conjecture,
sdtasdt0(xn,sdtsldt0(xm,xl)) != sdtsldt0(sdtasdt0(xn,xm),xl),
inference(fof_simplification,[status(thm)],[c_0_32]) ).
fof(c_0_44,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_45,hypothesis,
sdtasdt0(xl,sdtsldt0(xm,xl)) = xm,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_23]),c_0_35])]),c_0_24]) ).
cnf(c_0_46,hypothesis,
( ~ aNaturalNumber0(X1)
| ~ doDivides0(xl,X1)
| sdtsldt0(X1,xl) = esk2_2(xl,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_23])]) ).
cnf(c_0_47,hypothesis,
aNaturalNumber0(sdtsldt0(xm,xl)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_34]),c_0_23]),c_0_35])]),c_0_24]) ).
cnf(c_0_48,hypothesis,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtasdt0(X2,X1) != sdtasdt0(X2,xn)
| X2 = sz00
| X1 = xn ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_49,plain,
( ~ aNaturalNumber0(X1)
| X1 = sdtasdt0(sz10,X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_50,plain,
aNaturalNumber0(sz10),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_51,plain,
sz10 != sz00,
inference(split_conjunct,[status(thm)],[c_0_42]) ).
fof(c_0_52,negated_conjecture,
sdtasdt0(xn,sdtsldt0(xm,xl)) != sdtsldt0(sdtasdt0(xn,xm),xl),
inference(fof_nnf,[status(thm)],[c_0_43]) ).
fof(c_0_53,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_54,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_55,hypothesis,
sdtasdt0(xl,esk2_2(xl,xm)) = xm,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_34]),c_0_35])]) ).
cnf(c_0_56,hypothesis,
aNaturalNumber0(esk2_2(xl,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_46]),c_0_34]),c_0_35])]) ).
cnf(c_0_57,hypothesis,
( ~ aNaturalNumber0(sdtasdt0(sz10,xn))
| sdtasdt0(sz10,xn) = xn ),
inference(er,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]),c_0_51])]) ).
cnf(c_0_58,negated_conjecture,
sdtasdt0(xn,sdtsldt0(xm,xl)) != sdtsldt0(sdtasdt0(xn,xm),xl),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_59,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_60,hypothesis,
( ~ aNaturalNumber0(X1)
| sdtasdt0(xl,sdtasdt0(sdtsldt0(xm,xl),X1)) = sdtasdt0(xm,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_45]),c_0_47]),c_0_23])]) ).
cnf(c_0_61,hypothesis,
sdtsldt0(xm,xl) = esk2_2(xl,xm),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_55]),c_0_56])]) ).
cnf(c_0_62,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| aNaturalNumber0(sdtasdt0(X1,sdtasdt0(X2,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_54]),c_0_17]) ).
cnf(c_0_63,hypothesis,
sdtasdt0(sz10,xn) = xn,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_17]),c_0_40]),c_0_50])]) ).
cnf(c_0_64,negated_conjecture,
sdtsldt0(sdtasdt0(xm,xn),xl) != sdtasdt0(xn,sdtsldt0(xm,xl)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_40]),c_0_35])]) ).
cnf(c_0_65,hypothesis,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(sdtasdt0(esk2_2(xl,xm),X1))
| sdtsldt0(sdtasdt0(xm,X1),xl) = sdtasdt0(esk2_2(xl,xm),X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_60]),c_0_61]),c_0_61]) ).
cnf(c_0_66,hypothesis,
( ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtasdt0(X1,xn)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_40]),c_0_50])]) ).
cnf(c_0_67,negated_conjecture,
sdtsldt0(sdtasdt0(xm,xn),xl) != sdtasdt0(xn,esk2_2(xl,xm)),
inference(rw,[status(thm)],[c_0_64,c_0_61]) ).
cnf(c_0_68,hypothesis,
sdtsldt0(sdtasdt0(xm,xn),xl) = sdtasdt0(esk2_2(xl,xm),xn),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_40]),c_0_56])]) ).
cnf(c_0_69,negated_conjecture,
sdtasdt0(esk2_2(xl,xm),xn) != sdtasdt0(xn,esk2_2(xl,xm)),
inference(rw,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_70,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_59]),c_0_40]),c_0_56])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM478+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n014.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 02:33:20 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 6.05/1.31 % Version: 3.5.1
% 6.05/1.31 % Preprocessing class: FSLSSMSSSSSNFFN.
% 6.05/1.31 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.05/1.31 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 6.05/1.31 % Starting new_bool_3 with 300s (1) cores
% 6.05/1.31 % Starting new_bool_1 with 300s (1) cores
% 6.05/1.31 % Starting sh5l with 300s (1) cores
% 6.05/1.31 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2954012 completed with status 0
% 6.05/1.31 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 6.05/1.31 % Preprocessing class: FSLSSMSSSSSNFFN.
% 6.05/1.31 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.05/1.31 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 6.05/1.31 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.05/1.31 % No SInE strategy applied
% 6.05/1.31 % Search class: FGUSF-FFMM22-SFFFFFNN
% 6.05/1.31 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 6.05/1.31 % Starting SubtermCWHack with 136s (1) cores
% 6.05/1.31 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 6.05/1.31 % Starting G-E--_107_B42_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 6.05/1.31 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 6.05/1.31 % Starting new_bool_3 with 136s (1) cores
% 6.05/1.31 % G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 2954022 completed with status 0
% 6.05/1.31 % Result found by G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 6.05/1.31 % Preprocessing class: FSLSSMSSSSSNFFN.
% 6.05/1.31 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.05/1.31 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 6.05/1.31 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.05/1.31 % No SInE strategy applied
% 6.05/1.31 % Search class: FGUSF-FFMM22-SFFFFFNN
% 6.05/1.31 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 6.05/1.31 % Starting SubtermCWHack with 136s (1) cores
% 6.05/1.31 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 6.05/1.31 % Starting G-E--_107_B42_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 6.05/1.31 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 6.05/1.31 % Preprocessing time : 0.002 s
% 6.05/1.31 % Presaturation interreduction done
% 6.05/1.31
% 6.05/1.31 % Proof found!
% 6.05/1.31 % SZS status Theorem
% 6.05/1.31 % SZS output start CNFRefutation
% See solution above
% 6.05/1.31 % Parsed axioms : 39
% 6.05/1.31 % Removed by relevancy pruning/SinE : 0
% 6.05/1.31 % Initial clauses : 65
% 6.05/1.31 % Removed in clause preprocessing : 3
% 6.05/1.31 % Initial clauses in saturation : 62
% 6.05/1.31 % Processed clauses : 3841
% 6.05/1.31 % ...of these trivial : 190
% 6.05/1.31 % ...subsumed : 2132
% 6.05/1.31 % ...remaining for further processing : 1519
% 6.05/1.31 % Other redundant clauses eliminated : 253
% 6.05/1.31 % Clauses deleted for lack of memory : 0
% 6.05/1.31 % Backward-subsumed : 129
% 6.05/1.31 % Backward-rewritten : 128
% 6.05/1.31 % Generated clauses : 28668
% 6.05/1.31 % ...of the previous two non-redundant : 25710
% 6.05/1.31 % ...aggressively subsumed : 0
% 6.05/1.31 % Contextual simplify-reflections : 128
% 6.05/1.31 % Paramodulations : 28315
% 6.05/1.31 % Factorizations : 1
% 6.05/1.31 % NegExts : 0
% 6.05/1.31 % Equation resolutions : 278
% 6.05/1.31 % Disequality decompositions : 0
% 6.05/1.31 % Total rewrite steps : 29806
% 6.05/1.31 % ...of those cached : 29566
% 6.05/1.31 % Propositional unsat checks : 0
% 6.05/1.31 % Propositional check models : 0
% 6.05/1.31 % Propositional check unsatisfiable : 0
% 6.05/1.31 % Propositional clauses : 0
% 6.05/1.31 % Propositional clauses after purity: 0
% 6.05/1.31 % Propositional unsat core size : 0
% 6.05/1.31 % Propositional preprocessing time : 0.000
% 6.05/1.31 % Propositional encoding time : 0.000
% 6.05/1.31 % Propositional solver time : 0.000
% 6.05/1.31 % Success case prop preproc time : 0.000
% 6.05/1.31 % Success case prop encoding time : 0.000
% 6.05/1.31 % Success case prop solver time : 0.000
% 6.05/1.31 % Current number of processed clauses : 1122
% 6.05/1.31 % Positive orientable unit clauses : 241
% 6.05/1.31 % Positive unorientable unit clauses: 0
% 6.05/1.31 % Negative unit clauses : 24
% 6.05/1.31 % Non-unit-clauses : 857
% 6.05/1.31 % Current number of unprocessed clauses: 21512
% 6.05/1.31 % ...number of literals in the above : 105528
% 6.05/1.31 % Current number of archived formulas : 0
% 6.05/1.31 % Current number of archived clauses : 388
% 6.05/1.31 % Clause-clause subsumption calls (NU) : 84572
% 6.05/1.31 % Rec. Clause-clause subsumption calls : 49928
% 6.05/1.31 % Non-unit clause-clause subsumptions : 2006
% 6.05/1.31 % Unit Clause-clause subsumption calls : 12475
% 6.05/1.31 % Rewrite failures with RHS unbound : 0
% 6.05/1.31 % BW rewrite match attempts : 238
% 6.05/1.31 % BW rewrite match successes : 45
% 6.05/1.31 % Condensation attempts : 0
% 6.05/1.31 % Condensation successes : 0
% 6.05/1.31 % Termbank termtop insertions : 577132
% 6.05/1.31 % Search garbage collected termcells : 1099
% 6.05/1.31
% 6.05/1.31 % -------------------------------------------------
% 6.05/1.31 % User time : 0.719 s
% 6.05/1.31 % System time : 0.026 s
% 6.05/1.31 % Total time : 0.745 s
% 6.05/1.31 % Maximum resident set size: 3672 pages
% 6.05/1.31
% 6.05/1.31 % -------------------------------------------------
% 6.05/1.31 % User time : 3.986 s
% 6.05/1.31 % System time : 0.196 s
% 6.05/1.31 % Total time : 4.182 s
% 6.05/1.31 % Maximum resident set size: 4864 pages
% 6.05/1.31 % E exiting
%------------------------------------------------------------------------------