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

% Computer : n119.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:28 EST 2018

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

% Comments : 
%------------------------------------------------------------------------------
fof(23,axiom,
    ( aNaturalNumber0(xl)
    & aNaturalNumber0(xm)
    & aNaturalNumber0(xn) ),
    file('/export/starexec/sandbox/tmp/tmpyiGFOL/sel_theBenchmark.p_1',m__1324) ).

fof(26,axiom,
    ( aNaturalNumber0(xq)
    & equal(sdtpldt0(xm,xn),sdtasdt0(xl,xq))
    & equal(xq,sdtsldt0(sdtpldt0(xm,xn),xl)) ),
    file('/export/starexec/sandbox/tmp/tmpyiGFOL/sel_theBenchmark.p_1',m__1379) ).

fof(27,conjecture,
    ( ? [X1] :
        ( aNaturalNumber0(X1)
        & equal(sdtpldt0(xm,X1),sdtpldt0(xm,xn)) )
    | sdtlseqdt0(xm,sdtpldt0(xm,xn)) ),
    file('/export/starexec/sandbox/tmp/tmpyiGFOL/sel_theBenchmark.p_1',m__) ).

fof(40,negated_conjecture,
    ~ ( ? [X1] :
          ( aNaturalNumber0(X1)
          & equal(sdtpldt0(xm,X1),sdtpldt0(xm,xn)) )
      | sdtlseqdt0(xm,sdtpldt0(xm,xn)) ),
    inference(assume_negation,[status(cth)],[27]) ).

cnf(144,plain,
    aNaturalNumber0(xn),
    inference(split_conjunct,[status(thm)],[23]) ).

cnf(153,plain,
    sdtpldt0(xm,xn) = sdtasdt0(xl,xq),
    inference(split_conjunct,[status(thm)],[26]) ).

fof(155,negated_conjecture,
    ( ! [X1] :
        ( ~ aNaturalNumber0(X1)
        | ~ equal(sdtpldt0(xm,X1),sdtpldt0(xm,xn)) )
    & ~ sdtlseqdt0(xm,sdtpldt0(xm,xn)) ),
    inference(fof_nnf,[status(thm)],[40]) ).

fof(156,negated_conjecture,
    ( ! [X2] :
        ( ~ aNaturalNumber0(X2)
        | ~ equal(sdtpldt0(xm,X2),sdtpldt0(xm,xn)) )
    & ~ sdtlseqdt0(xm,sdtpldt0(xm,xn)) ),
    inference(variable_rename,[status(thm)],[155]) ).

fof(157,negated_conjecture,
    ! [X2] :
      ( ( ~ aNaturalNumber0(X2)
        | ~ equal(sdtpldt0(xm,X2),sdtpldt0(xm,xn)) )
      & ~ sdtlseqdt0(xm,sdtpldt0(xm,xn)) ),
    inference(shift_quantors,[status(thm)],[156]) ).

cnf(159,negated_conjecture,
    ( sdtpldt0(xm,X1) != sdtpldt0(xm,xn)
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[157]) ).

cnf(248,negated_conjecture,
    ( sdtasdt0(xl,xq) != sdtpldt0(xm,X1)
    | ~ aNaturalNumber0(X1) ),
    inference(rw,[status(thm)],[159,153,theory(equality)]) ).

cnf(249,plain,
    ~ aNaturalNumber0(xn),
    inference(spm,[status(thm)],[248,153,theory(equality)]) ).

cnf(251,plain,
    $false,
    inference(rw,[status(thm)],[249,144,theory(equality)]) ).

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

cnf(253,plain,
    $false,
    252,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : NUM472+2 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.05  % Command  : Source/sine.py -e eprover -t %d %s
% 0.03/0.24  % Computer : n119.star.cs.uiowa.edu
% 0.03/0.24  % Model    : x86_64 x86_64
% 0.03/0.24  % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.24  % Memory   : 32218.625MB
% 0.03/0.24  % OS       : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.24  % CPULimit : 300
% 0.03/0.24  % DateTime : Fri Jan  5 05:00:15 CST 2018
% 0.03/0.24  % CPUTime  : 
% 0.07/0.28  % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.28  --creating new selector for []
% 0.07/0.35  -running prover on /export/starexec/sandbox/tmp/tmpyiGFOL/sel_theBenchmark.p_1 with time limit 29
% 0.07/0.35  -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/tmpyiGFOL/sel_theBenchmark.p_1']
% 0.07/0.35  -prover status Theorem
% 0.07/0.35  Problem theBenchmark.p solved in phase 0.
% 0.07/0.35  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.35  % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.36  Solved 1 out of 1.
% 0.07/0.36  # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.36  # SZS status Theorem
% 0.07/0.36  # SZS output start CNFRefutation.
% See solution above
% 0.07/0.36  # SZS output end CNFRefutation
%------------------------------------------------------------------------------