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

% Computer : n080.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:32 EST 2018

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

% Comments : 
%------------------------------------------------------------------------------
fof(18,axiom,
    ( aNaturalNumber0(xn)
    & aNaturalNumber0(xm)
    & aNaturalNumber0(xp) ),
    file('/export/starexec/sandbox2/tmp/tmpehbsij/sel_theBenchmark.p_1',m__1837) ).

fof(32,conjecture,
    ( ? [X1] :
        ( aNaturalNumber0(X1)
        & equal(sdtasdt0(xp,xm),sdtasdt0(xp,X1)) )
    | doDivides0(xp,sdtasdt0(xp,xm)) ),
    file('/export/starexec/sandbox2/tmp/tmpehbsij/sel_theBenchmark.p_1',m__) ).

fof(49,negated_conjecture,
    ~ ( ? [X1] :
          ( aNaturalNumber0(X1)
          & equal(sdtasdt0(xp,xm),sdtasdt0(xp,X1)) )
      | doDivides0(xp,sdtasdt0(xp,xm)) ),
    inference(assume_negation,[status(cth)],[32]) ).

cnf(254,plain,
    aNaturalNumber0(xm),
    inference(split_conjunct,[status(thm)],[18]) ).

fof(316,negated_conjecture,
    ( ! [X1] :
        ( ~ aNaturalNumber0(X1)
        | ~ equal(sdtasdt0(xp,xm),sdtasdt0(xp,X1)) )
    & ~ doDivides0(xp,sdtasdt0(xp,xm)) ),
    inference(fof_nnf,[status(thm)],[49]) ).

fof(317,negated_conjecture,
    ( ! [X2] :
        ( ~ aNaturalNumber0(X2)
        | ~ equal(sdtasdt0(xp,xm),sdtasdt0(xp,X2)) )
    & ~ doDivides0(xp,sdtasdt0(xp,xm)) ),
    inference(variable_rename,[status(thm)],[316]) ).

fof(318,negated_conjecture,
    ! [X2] :
      ( ( ~ aNaturalNumber0(X2)
        | ~ equal(sdtasdt0(xp,xm),sdtasdt0(xp,X2)) )
      & ~ doDivides0(xp,sdtasdt0(xp,xm)) ),
    inference(shift_quantors,[status(thm)],[317]) ).

cnf(320,negated_conjecture,
    ( sdtasdt0(xp,xm) != sdtasdt0(xp,X1)
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[318]) ).

cnf(438,negated_conjecture,
    ~ aNaturalNumber0(xm),
    inference(er,[status(thm)],[320,theory(equality)]) ).

cnf(439,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[438,254,theory(equality)]) ).

cnf(440,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[439,theory(equality)]) ).

cnf(441,negated_conjecture,
    $false,
    440,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM491+3 : 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 : n080.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 05:43:45 CST 2018
% 0.02/0.23  % CPUTime  : 
% 0.06/0.27  % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.27  --creating new selector for []
% 0.06/0.37  -running prover on /export/starexec/sandbox2/tmp/tmpehbsij/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.37  -running prover with command ['/export/starexec/sandbox2/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox2/tmp/tmpehbsij/sel_theBenchmark.p_1']
% 0.06/0.37  -prover status Theorem
% 0.06/0.37  Problem theBenchmark.p solved in phase 0.
% 0.06/0.37  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.37  % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.37  Solved 1 out of 1.
% 0.06/0.37  # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.37  # SZS status Theorem
% 0.06/0.37  # SZS output start CNFRefutation.
% See solution above
% 0.06/0.37  # SZS output end CNFRefutation
%------------------------------------------------------------------------------