TSTP Solution File: NUM473+1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : NUM473+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n002.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 : 300s
% WCLimit  : 300s
% DateTime : Tue May 21 01:14:09 EDT 2024

% Result   : Theorem 4.31s 1.00s
% Output   : CNFRefutation 4.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   65 (  28 unt;   0 def)
%            Number of atoms       :  250 (  85 equ)
%            Maximal formula atoms :   28 (   3 avg)
%            Number of connectives :  298 ( 113   ~; 121   |;  40   &)
%                                         (   2 <=>;  22  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :   73 (   0 sgn  45   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(mDefQuot,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => ( ( X1 != sz00
          & doDivides0(X1,X2) )
       => ! [X3] :
            ( X3 = sdtsldt0(X2,X1)
          <=> ( aNaturalNumber0(X3)
              & X2 = sdtasdt0(X1,X3) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefQuot) ).

fof(m__1347,hypothesis,
    xl != sz00,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1347) ).

fof(mLETotal,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => ( sdtlseqdt0(X1,X2)
        | ( X2 != X1
          & sdtlseqdt0(X2,X1) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLETotal) ).

fof(m__1324_04,hypothesis,
    ( doDivides0(xl,xm)
    & doDivides0(xl,sdtpldt0(xm,xn)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1324_04) ).

fof(m__1360,hypothesis,
    xp = sdtsldt0(xm,xl),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1360) ).

fof(m__1324,hypothesis,
    ( aNaturalNumber0(xl)
    & aNaturalNumber0(xm)
    & aNaturalNumber0(xn) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1324) ).

fof(m__1379,hypothesis,
    xq = sdtsldt0(sdtpldt0(xm,xn),xl),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1379) ).

fof(mSortsB,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => aNaturalNumber0(sdtpldt0(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB) ).

fof(m__,conjecture,
    sdtlseqdt0(xp,xq),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(mMonMul,axiom,
    ! [X1,X2,X3] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2)
        & aNaturalNumber0(X3) )
     => ( ( X1 != sz00
          & X2 != X3
          & sdtlseqdt0(X2,X3) )
       => ( sdtasdt0(X1,X2) != sdtasdt0(X1,X3)
          & sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
          & sdtasdt0(X2,X1) != sdtasdt0(X3,X1)
          & sdtlseqdt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1)) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMonMul) ).

fof(mMulCanc,axiom,
    ! [X1] :
      ( aNaturalNumber0(X1)
     => ( X1 != sz00
       => ! [X2,X3] :
            ( ( aNaturalNumber0(X2)
              & aNaturalNumber0(X3) )
           => ( ( sdtasdt0(X1,X2) = sdtasdt0(X1,X3)
                | sdtasdt0(X2,X1) = sdtasdt0(X3,X1) )
             => X2 = X3 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulCanc) ).

fof(mSortsB_02,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => aNaturalNumber0(sdtasdt0(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB_02) ).

fof(mLEAsym,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => ( ( sdtlseqdt0(X1,X2)
          & sdtlseqdt0(X2,X1) )
       => X1 = X2 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLEAsym) ).

fof(m__1409,hypothesis,
    sdtlseqdt0(xm,sdtpldt0(xm,xn)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1409) ).

fof(c_0_14,plain,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => ( ( X1 != sz00
          & doDivides0(X1,X2) )
       => ! [X3] :
            ( X3 = sdtsldt0(X2,X1)
          <=> ( aNaturalNumber0(X3)
              & X2 = sdtasdt0(X1,X3) ) ) ) ),
    inference(fof_simplification,[status(thm)],[mDefQuot]) ).

fof(c_0_15,plain,
    ! [X67,X68,X69] :
      ( ( aNaturalNumber0(X69)
        | X69 != sdtsldt0(X68,X67)
        | X67 = sz00
        | ~ doDivides0(X67,X68)
        | ~ aNaturalNumber0(X67)
        | ~ aNaturalNumber0(X68) )
      & ( X68 = sdtasdt0(X67,X69)
        | X69 != sdtsldt0(X68,X67)
        | X67 = sz00
        | ~ doDivides0(X67,X68)
        | ~ aNaturalNumber0(X67)
        | ~ aNaturalNumber0(X68) )
      & ( ~ aNaturalNumber0(X69)
        | X68 != sdtasdt0(X67,X69)
        | X69 = sdtsldt0(X68,X67)
        | X67 = sz00
        | ~ doDivides0(X67,X68)
        | ~ aNaturalNumber0(X67)
        | ~ aNaturalNumber0(X68) ) ),
    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_14])])])])]) ).

fof(c_0_16,hypothesis,
    xl != sz00,
    inference(fof_simplification,[status(thm)],[m__1347]) ).

fof(c_0_17,plain,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => ( sdtlseqdt0(X1,X2)
        | ( X2 != X1
          & sdtlseqdt0(X2,X1) ) ) ),
    inference(fof_simplification,[status(thm)],[mLETotal]) ).

cnf(c_0_18,plain,
    ( aNaturalNumber0(X1)
    | X3 = sz00
    | X1 != sdtsldt0(X2,X3)
    | ~ doDivides0(X3,X2)
    | ~ aNaturalNumber0(X3)
    | ~ aNaturalNumber0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

fof(c_0_19,hypothesis,
    xl != sz00,
    inference(fof_nnf,[status(thm)],[c_0_16]) ).

fof(c_0_20,plain,
    ! [X48,X49] :
      ( ( X49 != X48
        | sdtlseqdt0(X48,X49)
        | ~ aNaturalNumber0(X48)
        | ~ aNaturalNumber0(X49) )
      & ( sdtlseqdt0(X49,X48)
        | sdtlseqdt0(X48,X49)
        | ~ aNaturalNumber0(X48)
        | ~ aNaturalNumber0(X49) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).

cnf(c_0_21,plain,
    ( X1 = sz00
    | aNaturalNumber0(sdtsldt0(X2,X1))
    | ~ doDivides0(X1,X2)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    inference(er,[status(thm)],[c_0_18]) ).

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_19]) ).

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(X5)
      | ~ aNaturalNumber0(X6)
      | aNaturalNumber0(sdtpldt0(X5,X6)) ),
    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)],[inference(assume_negation,[status(cth)],[m__])]) ).

fof(c_0_31,plain,
    ! [X1,X2,X3] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2)
        & aNaturalNumber0(X3) )
     => ( ( X1 != sz00
          & X2 != X3
          & sdtlseqdt0(X2,X3) )
       => ( sdtasdt0(X1,X2) != sdtasdt0(X1,X3)
          & sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
          & sdtasdt0(X2,X1) != sdtasdt0(X3,X1)
          & sdtlseqdt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1)) ) ) ),
    inference(fof_simplification,[status(thm)],[mMonMul]) ).

cnf(c_0_32,plain,
    ( sdtlseqdt0(X1,X2)
    | sdtlseqdt0(X2,X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    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(xq)
    | ~ aNaturalNumber0(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_21,c_0_27]),c_0_28]),c_0_24])]),c_0_26]) ).

cnf(c_0_35,plain,
    ( aNaturalNumber0(sdtpldt0(X1,X2))
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(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,
    ( X1 = sdtasdt0(X2,X3)
    | X2 = sz00
    | X3 != sdtsldt0(X1,X2)
    | ~ doDivides0(X2,X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

fof(c_0_39,plain,
    ! [X1] :
      ( aNaturalNumber0(X1)
     => ( X1 != sz00
       => ! [X2,X3] :
            ( ( aNaturalNumber0(X2)
              & aNaturalNumber0(X3) )
           => ( ( sdtasdt0(X1,X2) = sdtasdt0(X1,X3)
                | sdtasdt0(X2,X1) = sdtasdt0(X3,X1) )
             => X2 = X3 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mMulCanc]) ).

fof(c_0_40,plain,
    ! [X53,X54,X55] :
      ( ( sdtasdt0(X53,X54) != sdtasdt0(X53,X55)
        | X53 = sz00
        | X54 = X55
        | ~ sdtlseqdt0(X54,X55)
        | ~ aNaturalNumber0(X53)
        | ~ aNaturalNumber0(X54)
        | ~ aNaturalNumber0(X55) )
      & ( sdtlseqdt0(sdtasdt0(X53,X54),sdtasdt0(X53,X55))
        | X53 = sz00
        | X54 = X55
        | ~ sdtlseqdt0(X54,X55)
        | ~ aNaturalNumber0(X53)
        | ~ aNaturalNumber0(X54)
        | ~ aNaturalNumber0(X55) )
      & ( sdtasdt0(X54,X53) != sdtasdt0(X55,X53)
        | X53 = sz00
        | X54 = X55
        | ~ sdtlseqdt0(X54,X55)
        | ~ aNaturalNumber0(X53)
        | ~ aNaturalNumber0(X54)
        | ~ aNaturalNumber0(X55) )
      & ( sdtlseqdt0(sdtasdt0(X54,X53),sdtasdt0(X55,X53))
        | X53 = sz00
        | X54 = X55
        | ~ sdtlseqdt0(X54,X55)
        | ~ aNaturalNumber0(X53)
        | ~ aNaturalNumber0(X54)
        | ~ aNaturalNumber0(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_41,hypothesis,
    ( sdtlseqdt0(X1,xp)
    | sdtlseqdt0(xp,X1)
    | ~ aNaturalNumber0(X1) ),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_42,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_43,negated_conjecture,
    ~ sdtlseqdt0(xp,xq),
    inference(split_conjunct,[status(thm)],[c_0_37]) ).

cnf(c_0_44,plain,
    ( sdtasdt0(X1,sdtsldt0(X2,X1)) = X2
    | X1 = sz00
    | ~ doDivides0(X1,X2)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    inference(er,[status(thm)],[c_0_38]) ).

fof(c_0_45,plain,
    ! [X28,X29,X30] :
      ( ( sdtasdt0(X28,X29) != sdtasdt0(X28,X30)
        | X29 = X30
        | ~ aNaturalNumber0(X29)
        | ~ aNaturalNumber0(X30)
        | X28 = sz00
        | ~ aNaturalNumber0(X28) )
      & ( sdtasdt0(X29,X28) != sdtasdt0(X30,X28)
        | X29 = X30
        | ~ aNaturalNumber0(X29)
        | ~ aNaturalNumber0(X30)
        | X28 = sz00
        | ~ aNaturalNumber0(X28) ) ),
    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])])])])]) ).

cnf(c_0_46,plain,
    ( sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
    | X1 = sz00
    | X2 = X3
    | ~ sdtlseqdt0(X2,X3)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_40]) ).

cnf(c_0_47,hypothesis,
    sdtlseqdt0(xq,xp),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).

cnf(c_0_48,hypothesis,
    ( sdtasdt0(xl,xq) = sdtpldt0(xm,xn)
    | ~ aNaturalNumber0(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_44,c_0_27]),c_0_28]),c_0_24])]),c_0_26]) ).

fof(c_0_49,plain,
    ! [X7,X8] :
      ( ~ aNaturalNumber0(X7)
      | ~ aNaturalNumber0(X8)
      | aNaturalNumber0(sdtasdt0(X7,X8)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).

cnf(c_0_50,plain,
    ( X2 = X3
    | X1 = sz00
    | sdtasdt0(X1,X2) != sdtasdt0(X1,X3)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X3)
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_45]) ).

fof(c_0_51,plain,
    ! [X43,X44] :
      ( ~ aNaturalNumber0(X43)
      | ~ aNaturalNumber0(X44)
      | ~ sdtlseqdt0(X43,X44)
      | ~ sdtlseqdt0(X44,X43)
      | X43 = X44 ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLEAsym])])]) ).

cnf(c_0_52,hypothesis,
    ( xq = xp
    | X1 = sz00
    | sdtlseqdt0(sdtasdt0(X1,xq),sdtasdt0(X1,xp))
    | ~ aNaturalNumber0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_33]),c_0_42])]) ).

cnf(c_0_53,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_48,c_0_35]),c_0_36]),c_0_25])]) ).

cnf(c_0_54,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_44,c_0_22]),c_0_23]),c_0_24]),c_0_25])]),c_0_26]) ).

cnf(c_0_55,plain,
    ( aNaturalNumber0(sdtasdt0(X1,X2))
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_49]) ).

cnf(c_0_56,hypothesis,
    ( X1 = xp
    | X2 = sz00
    | sdtasdt0(X2,X1) != sdtasdt0(X2,xp)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    inference(spm,[status(thm)],[c_0_50,c_0_33]) ).

cnf(c_0_57,plain,
    ( X1 = X2
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2)
    | ~ sdtlseqdt0(X1,X2)
    | ~ sdtlseqdt0(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_51]) ).

cnf(c_0_58,hypothesis,
    ( xq = xp
    | sdtlseqdt0(sdtpldt0(xm,xn),xm) ),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_24]),c_0_53]),c_0_54]),c_0_26]) ).

cnf(c_0_59,hypothesis,
    sdtlseqdt0(xm,sdtpldt0(xm,xn)),
    inference(split_conjunct,[status(thm)],[m__1409]) ).

cnf(c_0_60,hypothesis,
    aNaturalNumber0(sdtpldt0(xm,xn)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_53]),c_0_42]),c_0_24])]) ).

cnf(c_0_61,hypothesis,
    ( xq = xp
    | sdtpldt0(xm,xn) != 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_56,c_0_53]),c_0_54]),c_0_42]),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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),c_0_60]),c_0_25])]),c_0_61]) ).

cnf(c_0_63,hypothesis,
    sdtlseqdt0(xp,xp),
    inference(spm,[status(thm)],[c_0_41,c_0_33]) ).

cnf(c_0_64,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_62]),c_0_63])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : NUM473+1 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.13  % Command    : run_E %s %d THM
% 0.14/0.34  % Computer : n002.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Mon May 20 03:38:53 EDT 2024
% 0.14/0.34  % CPUTime    : 
% 0.20/0.48  Running first-order theorem proving
% 0.20/0.48  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
% 4.31/1.00  # Version: 3.1.0
% 4.31/1.00  # Preprocessing class: FSLSSMSSSSSNFFN.
% 4.31/1.00  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.31/1.00  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 4.31/1.00  # Starting new_bool_3 with 300s (1) cores
% 4.31/1.00  # Starting new_bool_1 with 300s (1) cores
% 4.31/1.00  # Starting sh5l with 300s (1) cores
% 4.31/1.00  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 26689 completed with status 0
% 4.31/1.00  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 4.31/1.00  # Preprocessing class: FSLSSMSSSSSNFFN.
% 4.31/1.00  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.31/1.00  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 4.31/1.00  # No SInE strategy applied
% 4.31/1.00  # Search class: FGUSF-FFMM22-SFFFFFNN
% 4.31/1.00  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 4.31/1.00  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 4.31/1.00  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 4.31/1.00  # Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 4.31/1.00  # Starting new_bool_3 with 136s (1) cores
% 4.31/1.00  # Starting new_bool_1 with 136s (1) cores
% 4.31/1.00  # G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 26698 completed with status 0
% 4.31/1.00  # Result found by G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 4.31/1.00  # Preprocessing class: FSLSSMSSSSSNFFN.
% 4.31/1.00  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.31/1.00  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 4.31/1.00  # No SInE strategy applied
% 4.31/1.00  # Search class: FGUSF-FFMM22-SFFFFFNN
% 4.31/1.00  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 4.31/1.00  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 4.31/1.00  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 4.31/1.00  # Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 4.31/1.00  # Preprocessing time       : 0.003 s
% 4.31/1.00  # Presaturation interreduction done
% 4.31/1.00  
% 4.31/1.00  # Proof found!
% 4.31/1.00  # SZS status Theorem
% 4.31/1.00  # SZS output start CNFRefutation
% See solution above
% 4.31/1.00  # Parsed axioms                        : 40
% 4.31/1.00  # Removed by relevancy pruning/SinE    : 0
% 4.31/1.00  # Initial clauses                      : 67
% 4.31/1.00  # Removed in clause preprocessing      : 3
% 4.31/1.00  # Initial clauses in saturation        : 64
% 4.31/1.00  # Processed clauses                    : 4779
% 4.31/1.00  # ...of these trivial                  : 201
% 4.31/1.00  # ...subsumed                          : 2613
% 4.31/1.00  # ...remaining for further processing  : 1965
% 4.31/1.00  # Other redundant clauses eliminated   : 307
% 4.31/1.00  # Clauses deleted for lack of memory   : 0
% 4.31/1.00  # Backward-subsumed                    : 255
% 4.31/1.00  # Backward-rewritten                   : 704
% 4.31/1.00  # Generated clauses                    : 35573
% 4.31/1.00  # ...of the previous two non-redundant : 32823
% 4.31/1.00  # ...aggressively subsumed             : 0
% 4.31/1.00  # Contextual simplify-reflections      : 71
% 4.31/1.00  # Paramodulations                      : 35196
% 4.31/1.00  # Factorizations                       : 0
% 4.31/1.00  # NegExts                              : 0
% 4.31/1.00  # Equation resolutions                 : 338
% 4.31/1.00  # Disequality decompositions           : 0
% 4.31/1.00  # Total rewrite steps                  : 35162
% 4.31/1.00  # ...of those cached                   : 34909
% 4.31/1.00  # Propositional unsat checks           : 0
% 4.31/1.00  #    Propositional check models        : 0
% 4.31/1.00  #    Propositional check unsatisfiable : 0
% 4.31/1.00  #    Propositional clauses             : 0
% 4.31/1.00  #    Propositional clauses after purity: 0
% 4.31/1.00  #    Propositional unsat core size     : 0
% 4.31/1.00  #    Propositional preprocessing time  : 0.000
% 4.31/1.00  #    Propositional encoding time       : 0.000
% 4.31/1.00  #    Propositional solver time         : 0.000
% 4.31/1.00  #    Success case prop preproc time    : 0.000
% 4.31/1.00  #    Success case prop encoding time   : 0.000
% 4.31/1.00  #    Success case prop solver time     : 0.000
% 4.31/1.00  # Current number of processed clauses  : 899
% 4.31/1.00  #    Positive orientable unit clauses  : 215
% 4.31/1.00  #    Positive unorientable unit clauses: 0
% 4.31/1.00  #    Negative unit clauses             : 52
% 4.31/1.00  #    Non-unit-clauses                  : 632
% 4.31/1.00  # Current number of unprocessed clauses: 27466
% 4.31/1.00  # ...number of literals in the above   : 114064
% 4.31/1.00  # Current number of archived formulas  : 0
% 4.31/1.00  # Current number of archived clauses   : 1057
% 4.31/1.00  # Clause-clause subsumption calls (NU) : 153402
% 4.31/1.00  # Rec. Clause-clause subsumption calls : 67781
% 4.31/1.00  # Non-unit clause-clause subsumptions  : 2267
% 4.31/1.00  # Unit Clause-clause subsumption calls : 16982
% 4.31/1.00  # Rewrite failures with RHS unbound    : 0
% 4.31/1.00  # BW rewrite match attempts            : 103
% 4.31/1.00  # BW rewrite match successes           : 92
% 4.31/1.00  # Condensation attempts                : 0
% 4.31/1.00  # Condensation successes               : 0
% 4.31/1.00  # Termbank termtop insertions          : 672280
% 4.31/1.00  # Search garbage collected termcells   : 1041
% 4.31/1.00  
% 4.31/1.00  # -------------------------------------------------
% 4.31/1.00  # User time                : 0.480 s
% 4.31/1.00  # System time              : 0.019 s
% 4.31/1.00  # Total time               : 0.500 s
% 4.31/1.00  # Maximum resident set size: 1892 pages
% 4.31/1.00  
% 4.31/1.00  # -------------------------------------------------
% 4.31/1.00  # User time                : 2.403 s
% 4.31/1.00  # System time              : 0.064 s
% 4.31/1.00  # Total time               : 2.467 s
% 4.31/1.00  # Maximum resident set size: 1752 pages
% 4.31/1.00  % E---3.1 exiting
% 4.31/1.00  % E exiting
%------------------------------------------------------------------------------