TSTP Solution File: NUM479+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : NUM479+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n018.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  : 600s
% DateTime : Mon Jul 18 09:32:53 EDT 2022

% Result   : Theorem 0.25s 4.44s
% Output   : CNFRefutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   43 (  12 unt;   0 def)
%            Number of atoms       :  158 (  38 equ)
%            Maximal formula atoms :   19 (   3 avg)
%            Number of connectives :  207 (  92   ~;  87   |;  18   &)
%                                         (   2 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   64 (   1 sgn  32   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__,conjecture,
    sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) = sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__) ).

fof(mMulAsso,axiom,
    ! [X1,X2,X3] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2)
        & aNaturalNumber0(X3) )
     => sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mMulAsso) ).

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

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/solver/bin/../tmp/theBenchmark.p',mDefQuot) ).

fof(m__1524,hypothesis,
    ( aNaturalNumber0(xl)
    & aNaturalNumber0(xm) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__1524) ).

fof(m__1553,hypothesis,
    aNaturalNumber0(xn),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__1553) ).

fof(m__1524_04,hypothesis,
    ( xl != sz00
    & doDivides0(xl,xm) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__1524_04) ).

fof(mDefDiv,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => ( doDivides0(X1,X2)
      <=> ? [X3] :
            ( aNaturalNumber0(X3)
            & X2 = sdtasdt0(X1,X3) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mDefDiv) ).

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

fof(mDivTrans,axiom,
    ! [X1,X2,X3] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2)
        & aNaturalNumber0(X3) )
     => ( ( doDivides0(X1,X2)
          & doDivides0(X2,X3) )
       => doDivides0(X1,X3) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mDivTrans) ).

fof(c_0_10,negated_conjecture,
    sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) != sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_11,plain,
    ! [X4,X5,X6] :
      ( ~ aNaturalNumber0(X4)
      | ~ aNaturalNumber0(X5)
      | ~ aNaturalNumber0(X6)
      | sdtasdt0(sdtasdt0(X4,X5),X6) = sdtasdt0(X4,sdtasdt0(X5,X6)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulAsso])]) ).

fof(c_0_12,plain,
    ! [X3,X4] :
      ( ~ aNaturalNumber0(X3)
      | ~ aNaturalNumber0(X4)
      | sdtasdt0(X3,X4) = sdtasdt0(X4,X3) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])]) ).

fof(c_0_13,negated_conjecture,
    sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) != sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)),
    inference(fof_simplification,[status(thm)],[c_0_10]) ).

cnf(c_0_14,plain,
    ( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
    | ~ aNaturalNumber0(X3)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_15,plain,
    ( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

fof(c_0_16,plain,
    ! [X4,X5,X6,X6] :
      ( ( aNaturalNumber0(X6)
        | X6 != sdtsldt0(X5,X4)
        | X4 = sz00
        | ~ doDivides0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) )
      & ( X5 = sdtasdt0(X4,X6)
        | X6 != sdtsldt0(X5,X4)
        | X4 = sz00
        | ~ doDivides0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) )
      & ( ~ aNaturalNumber0(X6)
        | X5 != sdtasdt0(X4,X6)
        | X6 = sdtsldt0(X5,X4)
        | X4 = sz00
        | ~ doDivides0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefQuot])])])])])]) ).

cnf(c_0_17,negated_conjecture,
    sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) != sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_18,plain,
    ( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X2,sdtasdt0(X1,X3))
    | ~ aNaturalNumber0(X3)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_19,hypothesis,
    aNaturalNumber0(xl),
    inference(split_conjunct,[status(thm)],[m__1524]) ).

cnf(c_0_20,hypothesis,
    aNaturalNumber0(xn),
    inference(split_conjunct,[status(thm)],[m__1553]) ).

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

cnf(c_0_22,negated_conjecture,
    ( sdtasdt0(xn,sdtasdt0(xl,sdtsldt0(xm,xl))) != sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl))
    | ~ aNaturalNumber0(sdtsldt0(xm,xl)) ),
    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,
    ( sdtasdt0(X1,sdtsldt0(X2,X1)) = X2
    | X1 = sz00
    | ~ doDivides0(X1,X2)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    inference(er,[status(thm)],[c_0_21]) ).

cnf(c_0_24,hypothesis,
    doDivides0(xl,xm),
    inference(split_conjunct,[status(thm)],[m__1524_04]) ).

cnf(c_0_25,hypothesis,
    aNaturalNumber0(xm),
    inference(split_conjunct,[status(thm)],[m__1524]) ).

cnf(c_0_26,hypothesis,
    xl != sz00,
    inference(split_conjunct,[status(thm)],[m__1524_04]) ).

cnf(c_0_27,negated_conjecture,
    ( sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)) != sdtasdt0(xn,xm)
    | ~ aNaturalNumber0(sdtsldt0(xm,xl)) ),
    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_22,c_0_23]),c_0_24]),c_0_19]),c_0_25])]),c_0_26]) ).

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

fof(c_0_29,plain,
    ! [X4,X5,X7] :
      ( ( aNaturalNumber0(esk2_2(X4,X5))
        | ~ doDivides0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) )
      & ( X5 = sdtasdt0(X4,esk2_2(X4,X5))
        | ~ doDivides0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) )
      & ( ~ aNaturalNumber0(X7)
        | X5 != sdtasdt0(X4,X7)
        | doDivides0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDiv])])])])])])]) ).

fof(c_0_30,plain,
    ! [X3,X4] :
      ( ~ aNaturalNumber0(X3)
      | ~ aNaturalNumber0(X4)
      | aNaturalNumber0(sdtasdt0(X3,X4)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).

cnf(c_0_31,negated_conjecture,
    ( ~ doDivides0(xl,sdtasdt0(xn,xm))
    | ~ aNaturalNumber0(sdtsldt0(xm,xl))
    | ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_23]),c_0_19])]),c_0_26]) ).

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

fof(c_0_33,plain,
    ! [X4,X5,X6] :
      ( ~ aNaturalNumber0(X4)
      | ~ aNaturalNumber0(X5)
      | ~ aNaturalNumber0(X6)
      | ~ doDivides0(X4,X5)
      | ~ doDivides0(X5,X6)
      | doDivides0(X4,X6) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDivTrans])]) ).

cnf(c_0_34,plain,
    ( doDivides0(X2,X1)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2)
    | X1 != sdtasdt0(X2,X3)
    | ~ aNaturalNumber0(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

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

cnf(c_0_36,negated_conjecture,
    ( ~ doDivides0(xl,sdtasdt0(xn,xm))
    | ~ aNaturalNumber0(sdtasdt0(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_31,c_0_32]),c_0_24]),c_0_19]),c_0_25])]),c_0_26]) ).

cnf(c_0_37,plain,
    ( doDivides0(X1,X2)
    | ~ doDivides0(X3,X2)
    | ~ doDivides0(X1,X3)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X3)
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_33]) ).

cnf(c_0_38,plain,
    ( doDivides0(X1,sdtasdt0(X1,X2))
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_34]),c_0_35]) ).

cnf(c_0_39,negated_conjecture,
    ( ~ doDivides0(xl,sdtasdt0(xm,xn))
    | ~ aNaturalNumber0(sdtasdt0(xm,xn)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_15]),c_0_25]),c_0_20])]) ).

cnf(c_0_40,plain,
    ( doDivides0(X1,sdtasdt0(X2,X3))
    | ~ doDivides0(X1,X2)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X3) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_35]) ).

cnf(c_0_41,negated_conjecture,
    ~ aNaturalNumber0(sdtasdt0(xm,xn)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_24]),c_0_25]),c_0_19]),c_0_20])]) ).

cnf(c_0_42,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_35]),c_0_20]),c_0_25])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM479+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n018.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Wed Jul  6 11:16:23 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.25/4.44  # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.25/4.44  # Preprocessing time       : 0.018 s
% 0.25/4.44  
% 0.25/4.44  # Proof found!
% 0.25/4.44  # SZS status Theorem
% 0.25/4.44  # SZS output start CNFRefutation
% See solution above
% 0.25/4.44  # Proof object total steps             : 43
% 0.25/4.44  # Proof object clause steps            : 25
% 0.25/4.44  # Proof object formula steps           : 18
% 0.25/4.44  # Proof object conjectures             : 11
% 0.25/4.44  # Proof object clause conjectures      : 8
% 0.25/4.44  # Proof object formula conjectures     : 3
% 0.25/4.44  # Proof object initial clauses used    : 13
% 0.25/4.44  # Proof object initial formulas used   : 10
% 0.25/4.44  # Proof object generating inferences   : 12
% 0.25/4.44  # Proof object simplifying inferences  : 29
% 0.25/4.44  # Training examples: 0 positive, 0 negative
% 0.25/4.44  # Parsed axioms                        : 39
% 0.25/4.44  # Removed by relevancy pruning/SinE    : 0
% 0.25/4.44  # Initial clauses                      : 65
% 0.25/4.44  # Removed in clause preprocessing      : 3
% 0.25/4.44  # Initial clauses in saturation        : 62
% 0.25/4.44  # Processed clauses                    : 4844
% 0.25/4.44  # ...of these trivial                  : 91
% 0.25/4.44  # ...subsumed                          : 3559
% 0.25/4.44  # ...remaining for further processing  : 1194
% 0.25/4.44  # Other redundant clauses eliminated   : 196
% 0.25/4.44  # Clauses deleted for lack of memory   : 133859
% 0.25/4.44  # Backward-subsumed                    : 73
% 0.25/4.44  # Backward-rewritten                   : 56
% 0.25/4.44  # Generated clauses                    : 254024
% 0.25/4.44  # ...of the previous two non-trivial   : 246223
% 0.25/4.44  # Contextual simplify-reflections      : 2973
% 0.25/4.44  # Paramodulations                      : 253747
% 0.25/4.44  # Factorizations                       : 0
% 0.25/4.44  # Equation resolutions                 : 277
% 0.25/4.44  # Current number of processed clauses  : 1064
% 0.25/4.44  #    Positive orientable unit clauses  : 82
% 0.25/4.44  #    Positive unorientable unit clauses: 0
% 0.25/4.44  #    Negative unit clauses             : 12
% 0.25/4.44  #    Non-unit-clauses                  : 970
% 0.25/4.44  # Current number of unprocessed clauses: 99073
% 0.25/4.44  # ...number of literals in the above   : 682508
% 0.25/4.44  # Current number of archived formulas  : 0
% 0.25/4.44  # Current number of archived clauses   : 129
% 0.25/4.44  # Clause-clause subsumption calls (NU) : 410577
% 0.25/4.44  # Rec. Clause-clause subsumption calls : 111496
% 0.25/4.44  # Non-unit clause-clause subsumptions  : 6025
% 0.25/4.44  # Unit Clause-clause subsumption calls : 755
% 0.25/4.44  # Rewrite failures with RHS unbound    : 0
% 0.25/4.44  # BW rewrite match attempts            : 42
% 0.25/4.44  # BW rewrite match successes           : 18
% 0.25/4.44  # Condensation attempts                : 0
% 0.25/4.44  # Condensation successes               : 0
% 0.25/4.44  # Termbank termtop insertions          : 6326113
% 0.25/4.44  
% 0.25/4.44  # -------------------------------------------------
% 0.25/4.44  # User time                : 3.565 s
% 0.25/4.44  # System time              : 0.077 s
% 0.25/4.44  # Total time               : 3.642 s
% 0.25/4.44  # Maximum resident set size: 130952 pages
%------------------------------------------------------------------------------