TSTP Solution File: NUM523+1 by SInE---0.4

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : NUM523+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : Source/sine.py -e eprover -t %d %s

% Computer : n104.star.cs.uiowa.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory   : 32218.625MB
% OS       : Linux 3.10.0-693.2.2.el7.x86_64
% CPULimit : 300s
% DateTime : Mon Jan  8 15:21:38 EST 2018

% Result   : Theorem 0.06s
% Output   : CNFRefutation 0.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   54 (  13 unt;   0 def)
%            Number of atoms       :  193 (   5 equ)
%            Maximal formula atoms :   13 (   3 avg)
%            Number of connectives :  246 ( 107   ~; 111   |;  23   &)
%                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   50 (   0 sgn  32   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(7,axiom,
    ! [X1,X2,X3] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2)
        & aNaturalNumber0(X3) )
     => ( ( isPrime0(X3)
          & doDivides0(X3,sdtasdt0(X1,X2)) )
       => ( doDivides0(X3,X1)
          | doDivides0(X3,X2) ) ) ),
    file('/export/starexec/sandbox/tmp/tmpRGUt1c/sel_theBenchmark.p_1',mPDP) ).

fof(9,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => ( doDivides0(X1,X2)
      <=> ? [X3] :
            ( aNaturalNumber0(X3)
            & equal(X2,sdtasdt0(X1,X3)) ) ) ),
    file('/export/starexec/sandbox/tmp/tmpRGUt1c/sel_theBenchmark.p_1',mDefDiv) ).

fof(14,axiom,
    equal(sdtasdt0(xp,sdtasdt0(xm,xm)),sdtasdt0(xn,xn)),
    file('/export/starexec/sandbox/tmp/tmpRGUt1c/sel_theBenchmark.p_1',m__3014) ).

fof(27,conjecture,
    ( doDivides0(xp,sdtasdt0(xn,xn))
    & doDivides0(xp,xn) ),
    file('/export/starexec/sandbox/tmp/tmpRGUt1c/sel_theBenchmark.p_1',m__) ).

fof(32,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => aNaturalNumber0(sdtasdt0(X1,X2)) ),
    file('/export/starexec/sandbox/tmp/tmpRGUt1c/sel_theBenchmark.p_1',mSortsB_02) ).

fof(41,axiom,
    ( aNaturalNumber0(xn)
    & aNaturalNumber0(xm)
    & aNaturalNumber0(xp)
    & ~ equal(xn,sz00)
    & ~ equal(xm,sz00)
    & ~ equal(xp,sz00) ),
    file('/export/starexec/sandbox/tmp/tmpRGUt1c/sel_theBenchmark.p_1',m__2987) ).

fof(44,axiom,
    isPrime0(xp),
    file('/export/starexec/sandbox/tmp/tmpRGUt1c/sel_theBenchmark.p_1',m__3025) ).

fof(45,negated_conjecture,
    ~ ( doDivides0(xp,sdtasdt0(xn,xn))
      & doDivides0(xp,xn) ),
    inference(assume_negation,[status(cth)],[27]) ).

fof(70,plain,
    ! [X1,X2,X3] :
      ( ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X2)
      | ~ aNaturalNumber0(X3)
      | ~ isPrime0(X3)
      | ~ doDivides0(X3,sdtasdt0(X1,X2))
      | doDivides0(X3,X1)
      | doDivides0(X3,X2) ),
    inference(fof_nnf,[status(thm)],[7]) ).

fof(71,plain,
    ! [X4,X5,X6] :
      ( ~ aNaturalNumber0(X4)
      | ~ aNaturalNumber0(X5)
      | ~ aNaturalNumber0(X6)
      | ~ isPrime0(X6)
      | ~ doDivides0(X6,sdtasdt0(X4,X5))
      | doDivides0(X6,X4)
      | doDivides0(X6,X5) ),
    inference(variable_rename,[status(thm)],[70]) ).

cnf(72,plain,
    ( doDivides0(X1,X2)
    | doDivides0(X1,X3)
    | ~ doDivides0(X1,sdtasdt0(X3,X2))
    | ~ isPrime0(X1)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X3) ),
    inference(split_conjunct,[status(thm)],[71]) ).

fof(78,plain,
    ! [X1,X2] :
      ( ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X2)
      | ( ( ~ doDivides0(X1,X2)
          | ? [X3] :
              ( aNaturalNumber0(X3)
              & equal(X2,sdtasdt0(X1,X3)) ) )
        & ( ! [X3] :
              ( ~ aNaturalNumber0(X3)
              | ~ equal(X2,sdtasdt0(X1,X3)) )
          | doDivides0(X1,X2) ) ) ),
    inference(fof_nnf,[status(thm)],[9]) ).

fof(79,plain,
    ! [X4,X5] :
      ( ~ aNaturalNumber0(X4)
      | ~ aNaturalNumber0(X5)
      | ( ( ~ doDivides0(X4,X5)
          | ? [X6] :
              ( aNaturalNumber0(X6)
              & equal(X5,sdtasdt0(X4,X6)) ) )
        & ( ! [X7] :
              ( ~ aNaturalNumber0(X7)
              | ~ equal(X5,sdtasdt0(X4,X7)) )
          | doDivides0(X4,X5) ) ) ),
    inference(variable_rename,[status(thm)],[78]) ).

fof(80,plain,
    ! [X4,X5] :
      ( ~ aNaturalNumber0(X4)
      | ~ aNaturalNumber0(X5)
      | ( ( ~ doDivides0(X4,X5)
          | ( aNaturalNumber0(esk1_2(X4,X5))
            & equal(X5,sdtasdt0(X4,esk1_2(X4,X5))) ) )
        & ( ! [X7] :
              ( ~ aNaturalNumber0(X7)
              | ~ equal(X5,sdtasdt0(X4,X7)) )
          | doDivides0(X4,X5) ) ) ),
    inference(skolemize,[status(esa)],[79]) ).

fof(81,plain,
    ! [X4,X5,X7] :
      ( ( ( ~ aNaturalNumber0(X7)
          | ~ equal(X5,sdtasdt0(X4,X7))
          | doDivides0(X4,X5) )
        & ( ~ doDivides0(X4,X5)
          | ( aNaturalNumber0(esk1_2(X4,X5))
            & equal(X5,sdtasdt0(X4,esk1_2(X4,X5))) ) ) )
      | ~ aNaturalNumber0(X4)
      | ~ aNaturalNumber0(X5) ),
    inference(shift_quantors,[status(thm)],[80]) ).

fof(82,plain,
    ! [X4,X5,X7] :
      ( ( ~ aNaturalNumber0(X7)
        | ~ equal(X5,sdtasdt0(X4,X7))
        | doDivides0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) )
      & ( aNaturalNumber0(esk1_2(X4,X5))
        | ~ doDivides0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) )
      & ( equal(X5,sdtasdt0(X4,esk1_2(X4,X5)))
        | ~ doDivides0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) ) ),
    inference(distribute,[status(thm)],[81]) ).

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

cnf(100,plain,
    sdtasdt0(xp,sdtasdt0(xm,xm)) = sdtasdt0(xn,xn),
    inference(split_conjunct,[status(thm)],[14]) ).

fof(156,negated_conjecture,
    ( ~ doDivides0(xp,sdtasdt0(xn,xn))
    | ~ doDivides0(xp,xn) ),
    inference(fof_nnf,[status(thm)],[45]) ).

cnf(157,negated_conjecture,
    ( ~ doDivides0(xp,xn)
    | ~ doDivides0(xp,sdtasdt0(xn,xn)) ),
    inference(split_conjunct,[status(thm)],[156]) ).

fof(176,plain,
    ! [X1,X2] :
      ( ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X2)
      | aNaturalNumber0(sdtasdt0(X1,X2)) ),
    inference(fof_nnf,[status(thm)],[32]) ).

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

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

cnf(220,plain,
    aNaturalNumber0(xp),
    inference(split_conjunct,[status(thm)],[41]) ).

cnf(221,plain,
    aNaturalNumber0(xm),
    inference(split_conjunct,[status(thm)],[41]) ).

cnf(222,plain,
    aNaturalNumber0(xn),
    inference(split_conjunct,[status(thm)],[41]) ).

cnf(233,plain,
    isPrime0(xp),
    inference(split_conjunct,[status(thm)],[44]) ).

cnf(240,plain,
    ( aNaturalNumber0(sdtasdt0(xn,xn))
    | ~ aNaturalNumber0(sdtasdt0(xm,xm))
    | ~ aNaturalNumber0(xp) ),
    inference(spm,[status(thm)],[178,100,theory(equality)]) ).

cnf(245,plain,
    ( aNaturalNumber0(sdtasdt0(xn,xn))
    | ~ aNaturalNumber0(sdtasdt0(xm,xm))
    | $false ),
    inference(rw,[status(thm)],[240,220,theory(equality)]) ).

cnf(246,plain,
    ( aNaturalNumber0(sdtasdt0(xn,xn))
    | ~ aNaturalNumber0(sdtasdt0(xm,xm)) ),
    inference(cn,[status(thm)],[245,theory(equality)]) ).

cnf(376,plain,
    ( doDivides0(X1,sdtasdt0(X1,X2))
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(sdtasdt0(X1,X2)) ),
    inference(er,[status(thm)],[85,theory(equality)]) ).

cnf(377,plain,
    ( doDivides0(xp,X1)
    | sdtasdt0(xn,xn) != X1
    | ~ aNaturalNumber0(sdtasdt0(xm,xm))
    | ~ aNaturalNumber0(xp)
    | ~ aNaturalNumber0(X1) ),
    inference(spm,[status(thm)],[85,100,theory(equality)]) ).

cnf(385,plain,
    ( doDivides0(xp,X1)
    | sdtasdt0(xn,xn) != X1
    | ~ aNaturalNumber0(sdtasdt0(xm,xm))
    | $false
    | ~ aNaturalNumber0(X1) ),
    inference(rw,[status(thm)],[377,220,theory(equality)]) ).

cnf(386,plain,
    ( doDivides0(xp,X1)
    | sdtasdt0(xn,xn) != X1
    | ~ aNaturalNumber0(sdtasdt0(xm,xm))
    | ~ aNaturalNumber0(X1) ),
    inference(cn,[status(thm)],[385,theory(equality)]) ).

cnf(1007,plain,
    ( aNaturalNumber0(sdtasdt0(xn,xn))
    | ~ aNaturalNumber0(xm) ),
    inference(spm,[status(thm)],[246,178,theory(equality)]) ).

cnf(1010,plain,
    ( aNaturalNumber0(sdtasdt0(xn,xn))
    | $false ),
    inference(rw,[status(thm)],[1007,221,theory(equality)]) ).

cnf(1011,plain,
    aNaturalNumber0(sdtasdt0(xn,xn)),
    inference(cn,[status(thm)],[1010,theory(equality)]) ).

cnf(2034,plain,
    ( ~ doDivides0(xp,xn)
    | ~ aNaturalNumber0(sdtasdt0(xm,xm))
    | ~ aNaturalNumber0(sdtasdt0(xn,xn)) ),
    inference(spm,[status(thm)],[157,386,theory(equality)]) ).

cnf(2042,plain,
    ( ~ doDivides0(xp,xn)
    | ~ aNaturalNumber0(sdtasdt0(xm,xm))
    | $false ),
    inference(rw,[status(thm)],[2034,1011,theory(equality)]) ).

cnf(2043,plain,
    ( ~ doDivides0(xp,xn)
    | ~ aNaturalNumber0(sdtasdt0(xm,xm)) ),
    inference(cn,[status(thm)],[2042,theory(equality)]) ).

cnf(2319,plain,
    ( doDivides0(X1,sdtasdt0(X1,X2))
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    inference(csr,[status(thm)],[376,178]) ).

cnf(2320,plain,
    ( doDivides0(xp,sdtasdt0(xn,xn))
    | ~ aNaturalNumber0(sdtasdt0(xm,xm))
    | ~ aNaturalNumber0(xp) ),
    inference(spm,[status(thm)],[2319,100,theory(equality)]) ).

cnf(2337,plain,
    ( doDivides0(xp,sdtasdt0(xn,xn))
    | ~ aNaturalNumber0(sdtasdt0(xm,xm))
    | $false ),
    inference(rw,[status(thm)],[2320,220,theory(equality)]) ).

cnf(2338,plain,
    ( doDivides0(xp,sdtasdt0(xn,xn))
    | ~ aNaturalNumber0(sdtasdt0(xm,xm)) ),
    inference(cn,[status(thm)],[2337,theory(equality)]) ).

cnf(2430,plain,
    ( doDivides0(xp,xn)
    | ~ isPrime0(xp)
    | ~ aNaturalNumber0(xn)
    | ~ aNaturalNumber0(xp)
    | ~ aNaturalNumber0(sdtasdt0(xm,xm)) ),
    inference(spm,[status(thm)],[72,2338,theory(equality)]) ).

cnf(2447,plain,
    ( doDivides0(xp,xn)
    | $false
    | ~ aNaturalNumber0(xn)
    | ~ aNaturalNumber0(xp)
    | ~ aNaturalNumber0(sdtasdt0(xm,xm)) ),
    inference(rw,[status(thm)],[2430,233,theory(equality)]) ).

cnf(2448,plain,
    ( doDivides0(xp,xn)
    | $false
    | $false
    | ~ aNaturalNumber0(xp)
    | ~ aNaturalNumber0(sdtasdt0(xm,xm)) ),
    inference(rw,[status(thm)],[2447,222,theory(equality)]) ).

cnf(2449,plain,
    ( doDivides0(xp,xn)
    | $false
    | $false
    | $false
    | ~ aNaturalNumber0(sdtasdt0(xm,xm)) ),
    inference(rw,[status(thm)],[2448,220,theory(equality)]) ).

cnf(2450,plain,
    ( doDivides0(xp,xn)
    | ~ aNaturalNumber0(sdtasdt0(xm,xm)) ),
    inference(cn,[status(thm)],[2449,theory(equality)]) ).

cnf(2454,plain,
    ~ aNaturalNumber0(sdtasdt0(xm,xm)),
    inference(csr,[status(thm)],[2450,2043]) ).

cnf(2455,plain,
    ~ aNaturalNumber0(xm),
    inference(spm,[status(thm)],[2454,178,theory(equality)]) ).

cnf(2459,plain,
    $false,
    inference(rw,[status(thm)],[2455,221,theory(equality)]) ).

cnf(2460,plain,
    $false,
    inference(cn,[status(thm)],[2459,theory(equality)]) ).

cnf(2461,plain,
    $false,
    2460,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM523+1 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04  % Command  : Source/sine.py -e eprover -t %d %s
% 0.02/0.23  % Computer : n104.star.cs.uiowa.edu
% 0.02/0.23  % Model    : x86_64 x86_64
% 0.02/0.23  % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23  % Memory   : 32218.625MB
% 0.02/0.23  % OS       : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.23  % CPULimit : 300
% 0.02/0.23  % DateTime : Fri Jan  5 08:30:14 CST 2018
% 0.06/0.23  % CPUTime  : 
% 0.06/0.27  % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.27  --creating new selector for []
% 0.06/0.38  -running prover on /export/starexec/sandbox/tmp/tmpRGUt1c/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.38  -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox/tmp/tmpRGUt1c/sel_theBenchmark.p_1']
% 0.06/0.38  -prover status Theorem
% 0.06/0.38  Problem theBenchmark.p solved in phase 0.
% 0.06/0.38  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.38  % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.38  Solved 1 out of 1.
% 0.06/0.38  # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.38  # SZS status Theorem
% 0.06/0.38  # SZS output start CNFRefutation.
% See solution above
% 0.06/0.38  # SZS output end CNFRefutation
%------------------------------------------------------------------------------