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

% Computer : n134.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      :   17
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   34 (  16 unt;   0 def)
%            Number of atoms       :   81 (  13 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   78 (  31   ~;  36   |;  10   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   11 (   0 sgn   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(11,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => ( sdtlseqdt0(X1,X2)
        | ( ~ equal(X2,X1)
          & sdtlseqdt0(X2,X1) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmpUK3HBS/sel_theBenchmark.p_1',mLETotal) ).

fof(14,axiom,
    ~ sdtlseqdt0(xp,xn),
    file('/export/starexec/sandbox2/tmp/tmpUK3HBS/sel_theBenchmark.p_1',m__1870) ).

fof(16,axiom,
    ~ ( ~ equal(xn,xp)
      & sdtlseqdt0(xn,xp)
      & ~ equal(xm,xp)
      & sdtlseqdt0(xm,xp) ),
    file('/export/starexec/sandbox2/tmp/tmpUK3HBS/sel_theBenchmark.p_1',m__2287) ).

fof(17,axiom,
    ( aNaturalNumber0(xn)
    & aNaturalNumber0(xm)
    & aNaturalNumber0(xp) ),
    file('/export/starexec/sandbox2/tmp/tmpUK3HBS/sel_theBenchmark.p_1',m__1837) ).

fof(42,axiom,
    ~ sdtlseqdt0(xp,xm),
    file('/export/starexec/sandbox2/tmp/tmpUK3HBS/sel_theBenchmark.p_1',m__2075) ).

fof(47,plain,
    ~ sdtlseqdt0(xp,xn),
    inference(fof_simplification,[status(thm)],[14,theory(equality)]) ).

fof(48,plain,
    ~ sdtlseqdt0(xp,xm),
    inference(fof_simplification,[status(thm)],[42,theory(equality)]) ).

fof(90,plain,
    ! [X1,X2] :
      ( ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X2)
      | sdtlseqdt0(X1,X2)
      | ( ~ equal(X2,X1)
        & sdtlseqdt0(X2,X1) ) ),
    inference(fof_nnf,[status(thm)],[11]) ).

fof(91,plain,
    ! [X3,X4] :
      ( ~ aNaturalNumber0(X3)
      | ~ aNaturalNumber0(X4)
      | sdtlseqdt0(X3,X4)
      | ( ~ equal(X4,X3)
        & sdtlseqdt0(X4,X3) ) ),
    inference(variable_rename,[status(thm)],[90]) ).

fof(92,plain,
    ! [X3,X4] :
      ( ( ~ equal(X4,X3)
        | sdtlseqdt0(X3,X4)
        | ~ aNaturalNumber0(X3)
        | ~ aNaturalNumber0(X4) )
      & ( sdtlseqdt0(X4,X3)
        | sdtlseqdt0(X3,X4)
        | ~ aNaturalNumber0(X3)
        | ~ aNaturalNumber0(X4) ) ),
    inference(distribute,[status(thm)],[91]) ).

cnf(93,plain,
    ( sdtlseqdt0(X2,X1)
    | sdtlseqdt0(X1,X2)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    inference(split_conjunct,[status(thm)],[92]) ).

cnf(101,plain,
    ~ sdtlseqdt0(xp,xn),
    inference(split_conjunct,[status(thm)],[47]) ).

fof(105,plain,
    ( equal(xn,xp)
    | ~ sdtlseqdt0(xn,xp)
    | equal(xm,xp)
    | ~ sdtlseqdt0(xm,xp) ),
    inference(fof_nnf,[status(thm)],[16]) ).

cnf(106,plain,
    ( xm = xp
    | xn = xp
    | ~ sdtlseqdt0(xm,xp)
    | ~ sdtlseqdt0(xn,xp) ),
    inference(split_conjunct,[status(thm)],[105]) ).

cnf(107,plain,
    aNaturalNumber0(xp),
    inference(split_conjunct,[status(thm)],[17]) ).

cnf(108,plain,
    aNaturalNumber0(xm),
    inference(split_conjunct,[status(thm)],[17]) ).

cnf(109,plain,
    aNaturalNumber0(xn),
    inference(split_conjunct,[status(thm)],[17]) ).

cnf(220,plain,
    ~ sdtlseqdt0(xp,xm),
    inference(split_conjunct,[status(thm)],[48]) ).

cnf(314,plain,
    ( sdtlseqdt0(X1,xp)
    | sdtlseqdt0(xp,X1)
    | ~ aNaturalNumber0(X1) ),
    inference(spm,[status(thm)],[93,107,theory(equality)]) ).

cnf(1078,plain,
    sdtlseqdt0(xp,xp),
    inference(spm,[status(thm)],[314,107,theory(equality)]) ).

cnf(1079,plain,
    ( sdtlseqdt0(xp,xn)
    | sdtlseqdt0(xn,xp) ),
    inference(spm,[status(thm)],[314,109,theory(equality)]) ).

cnf(1080,plain,
    ( sdtlseqdt0(xp,xm)
    | sdtlseqdt0(xm,xp) ),
    inference(spm,[status(thm)],[314,108,theory(equality)]) ).

cnf(1089,plain,
    sdtlseqdt0(xn,xp),
    inference(sr,[status(thm)],[1079,101,theory(equality)]) ).

cnf(1090,plain,
    sdtlseqdt0(xm,xp),
    inference(sr,[status(thm)],[1080,220,theory(equality)]) ).

cnf(1093,plain,
    ( xm = xp
    | xn = xp
    | $false
    | ~ sdtlseqdt0(xm,xp) ),
    inference(rw,[status(thm)],[106,1089,theory(equality)]) ).

cnf(1094,plain,
    ( xm = xp
    | xn = xp
    | ~ sdtlseqdt0(xm,xp) ),
    inference(cn,[status(thm)],[1093,theory(equality)]) ).

cnf(1112,plain,
    ( xm = xp
    | xn = xp
    | $false ),
    inference(rw,[status(thm)],[1094,1090,theory(equality)]) ).

cnf(1113,plain,
    ( xm = xp
    | xn = xp ),
    inference(cn,[status(thm)],[1112,theory(equality)]) ).

cnf(1118,plain,
    ( xn = xp
    | ~ sdtlseqdt0(xp,xp) ),
    inference(spm,[status(thm)],[220,1113,theory(equality)]) ).

cnf(1122,plain,
    ( xn = xp
    | $false ),
    inference(rw,[status(thm)],[1118,1078,theory(equality)]) ).

cnf(1123,plain,
    xn = xp,
    inference(cn,[status(thm)],[1122,theory(equality)]) ).

cnf(1129,plain,
    $false,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[101,1123,theory(equality)]),1078,theory(equality)]) ).

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

cnf(1131,plain,
    $false,
    1130,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM521+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 : n134.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 06:56:00 CST 2018
% 0.02/0.23  % CPUTime  : 
% 0.06/0.27  % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.28  --creating new selector for []
% 0.06/0.37  -running prover on /export/starexec/sandbox2/tmp/tmpUK3HBS/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/tmpUK3HBS/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
%------------------------------------------------------------------------------