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

View Problem - Process Solution

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

% Computer : n110.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:24 EST 2018

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,axiom,
    aNaturalNumber0(sz00),
    file('/export/starexec/sandbox/tmp/tmpE0FojV/sel_theBenchmark.p_1',mSortsC) ).

fof(7,axiom,
    ! [X1] :
      ( aNaturalNumber0(X1)
     => ( ~ equal(X1,sz00)
       => ! [X2,X3] :
            ( ( aNaturalNumber0(X2)
              & aNaturalNumber0(X3) )
           => ( ( equal(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
                | equal(sdtasdt0(X2,X1),sdtasdt0(X3,X1)) )
             => equal(X2,X3) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmpE0FojV/sel_theBenchmark.p_1',mMulCanc) ).

fof(10,axiom,
    ( aNaturalNumber0(xm)
    & aNaturalNumber0(xn) ),
    file('/export/starexec/sandbox/tmp/tmpE0FojV/sel_theBenchmark.p_1',m__624) ).

fof(11,conjecture,
    ( equal(sdtasdt0(xm,xn),sz00)
   => ( equal(xm,sz00)
      | equal(xn,sz00) ) ),
    file('/export/starexec/sandbox/tmp/tmpE0FojV/sel_theBenchmark.p_1',m__) ).

fof(18,axiom,
    ! [X1] :
      ( aNaturalNumber0(X1)
     => ( equal(sdtasdt0(X1,sz00),sz00)
        & equal(sz00,sdtasdt0(sz00,X1)) ) ),
    file('/export/starexec/sandbox/tmp/tmpE0FojV/sel_theBenchmark.p_1',m_MulZero) ).

fof(19,negated_conjecture,
    ~ ( equal(sdtasdt0(xm,xn),sz00)
     => ( equal(xm,sz00)
        | equal(xn,sz00) ) ),
    inference(assume_negation,[status(cth)],[11]) ).

cnf(20,plain,
    aNaturalNumber0(sz00),
    inference(split_conjunct,[status(thm)],[1]) ).

fof(38,plain,
    ! [X1] :
      ( ~ aNaturalNumber0(X1)
      | equal(X1,sz00)
      | ! [X2,X3] :
          ( ~ aNaturalNumber0(X2)
          | ~ aNaturalNumber0(X3)
          | ( ~ equal(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
            & ~ equal(sdtasdt0(X2,X1),sdtasdt0(X3,X1)) )
          | equal(X2,X3) ) ),
    inference(fof_nnf,[status(thm)],[7]) ).

fof(39,plain,
    ! [X4] :
      ( ~ aNaturalNumber0(X4)
      | equal(X4,sz00)
      | ! [X5,X6] :
          ( ~ aNaturalNumber0(X5)
          | ~ aNaturalNumber0(X6)
          | ( ~ equal(sdtasdt0(X4,X5),sdtasdt0(X4,X6))
            & ~ equal(sdtasdt0(X5,X4),sdtasdt0(X6,X4)) )
          | equal(X5,X6) ) ),
    inference(variable_rename,[status(thm)],[38]) ).

fof(40,plain,
    ! [X4,X5,X6] :
      ( ~ aNaturalNumber0(X5)
      | ~ aNaturalNumber0(X6)
      | ( ~ equal(sdtasdt0(X4,X5),sdtasdt0(X4,X6))
        & ~ equal(sdtasdt0(X5,X4),sdtasdt0(X6,X4)) )
      | equal(X5,X6)
      | equal(X4,sz00)
      | ~ aNaturalNumber0(X4) ),
    inference(shift_quantors,[status(thm)],[39]) ).

fof(41,plain,
    ! [X4,X5,X6] :
      ( ( ~ equal(sdtasdt0(X4,X5),sdtasdt0(X4,X6))
        | equal(X5,X6)
        | ~ aNaturalNumber0(X5)
        | ~ aNaturalNumber0(X6)
        | equal(X4,sz00)
        | ~ aNaturalNumber0(X4) )
      & ( ~ equal(sdtasdt0(X5,X4),sdtasdt0(X6,X4))
        | equal(X5,X6)
        | ~ aNaturalNumber0(X5)
        | ~ aNaturalNumber0(X6)
        | equal(X4,sz00)
        | ~ aNaturalNumber0(X4) ) ),
    inference(distribute,[status(thm)],[40]) ).

cnf(42,plain,
    ( X1 = sz00
    | X3 = X2
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X3)
    | sdtasdt0(X3,X1) != sdtasdt0(X2,X1) ),
    inference(split_conjunct,[status(thm)],[41]) ).

cnf(49,plain,
    aNaturalNumber0(xn),
    inference(split_conjunct,[status(thm)],[10]) ).

cnf(50,plain,
    aNaturalNumber0(xm),
    inference(split_conjunct,[status(thm)],[10]) ).

fof(51,negated_conjecture,
    ( equal(sdtasdt0(xm,xn),sz00)
    & ~ equal(xm,sz00)
    & ~ equal(xn,sz00) ),
    inference(fof_nnf,[status(thm)],[19]) ).

cnf(52,negated_conjecture,
    xn != sz00,
    inference(split_conjunct,[status(thm)],[51]) ).

cnf(53,negated_conjecture,
    xm != sz00,
    inference(split_conjunct,[status(thm)],[51]) ).

cnf(54,negated_conjecture,
    sdtasdt0(xm,xn) = sz00,
    inference(split_conjunct,[status(thm)],[51]) ).

fof(81,plain,
    ! [X1] :
      ( ~ aNaturalNumber0(X1)
      | ( equal(sdtasdt0(X1,sz00),sz00)
        & equal(sz00,sdtasdt0(sz00,X1)) ) ),
    inference(fof_nnf,[status(thm)],[18]) ).

fof(82,plain,
    ! [X2] :
      ( ~ aNaturalNumber0(X2)
      | ( equal(sdtasdt0(X2,sz00),sz00)
        & equal(sz00,sdtasdt0(sz00,X2)) ) ),
    inference(variable_rename,[status(thm)],[81]) ).

fof(83,plain,
    ! [X2] :
      ( ( equal(sdtasdt0(X2,sz00),sz00)
        | ~ aNaturalNumber0(X2) )
      & ( equal(sz00,sdtasdt0(sz00,X2))
        | ~ aNaturalNumber0(X2) ) ),
    inference(distribute,[status(thm)],[82]) ).

cnf(84,plain,
    ( sz00 = sdtasdt0(sz00,X1)
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[83]) ).

cnf(225,negated_conjecture,
    ( sz00 = xn
    | xm = X1
    | sz00 != sdtasdt0(X1,xn)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(xm)
    | ~ aNaturalNumber0(xn) ),
    inference(spm,[status(thm)],[42,54,theory(equality)]) ).

cnf(239,negated_conjecture,
    ( sz00 = xn
    | xm = X1
    | sz00 != sdtasdt0(X1,xn)
    | ~ aNaturalNumber0(X1)
    | $false
    | ~ aNaturalNumber0(xn) ),
    inference(rw,[status(thm)],[225,50,theory(equality)]) ).

cnf(240,negated_conjecture,
    ( sz00 = xn
    | xm = X1
    | sz00 != sdtasdt0(X1,xn)
    | ~ aNaturalNumber0(X1)
    | $false
    | $false ),
    inference(rw,[status(thm)],[239,49,theory(equality)]) ).

cnf(241,negated_conjecture,
    ( sz00 = xn
    | xm = X1
    | sz00 != sdtasdt0(X1,xn)
    | ~ aNaturalNumber0(X1) ),
    inference(cn,[status(thm)],[240,theory(equality)]) ).

cnf(242,negated_conjecture,
    ( xm = X1
    | sdtasdt0(X1,xn) != sz00
    | ~ aNaturalNumber0(X1) ),
    inference(sr,[status(thm)],[241,52,theory(equality)]) ).

cnf(417,negated_conjecture,
    ( xm = sz00
    | ~ aNaturalNumber0(sz00)
    | ~ aNaturalNumber0(xn) ),
    inference(spm,[status(thm)],[242,84,theory(equality)]) ).

cnf(422,negated_conjecture,
    ( xm = sz00
    | $false
    | ~ aNaturalNumber0(xn) ),
    inference(rw,[status(thm)],[417,20,theory(equality)]) ).

cnf(423,negated_conjecture,
    ( xm = sz00
    | $false
    | $false ),
    inference(rw,[status(thm)],[422,49,theory(equality)]) ).

cnf(424,negated_conjecture,
    xm = sz00,
    inference(cn,[status(thm)],[423,theory(equality)]) ).

cnf(425,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[424,53,theory(equality)]) ).

cnf(426,negated_conjecture,
    $false,
    425,
    [proof] ).

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