TSTP Solution File: NUM479+2 by SInE---0.4

View Problem - Process Solution

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

% Computer : n100.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:29 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    :   49 (  15 unt;   0 def)
%            Number of atoms       :  171 (  31 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  201 (  79   ~;  86   |;  26   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   48 (   0 sgn  30   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(5,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/tmpUNuh9a/sel_theBenchmark.p_1',mMulCanc) ).

fof(12,axiom,
    ( aNaturalNumber0(xl)
    & aNaturalNumber0(xm) ),
    file('/export/starexec/sandbox/tmp/tmpUNuh9a/sel_theBenchmark.p_1',m__1524) ).

fof(14,axiom,
    ( ~ equal(xl,sz00)
    & ? [X1] :
        ( aNaturalNumber0(X1)
        & equal(xm,sdtasdt0(xl,X1)) )
    & doDivides0(xl,xm) ),
    file('/export/starexec/sandbox/tmp/tmpUNuh9a/sel_theBenchmark.p_1',m__1524_04) ).

fof(26,conjecture,
    ( ( aNaturalNumber0(sdtsldt0(xm,xl))
      & equal(xm,sdtasdt0(xl,sdtsldt0(xm,xl))) )
   => ( ( aNaturalNumber0(sdtsldt0(sdtasdt0(xn,xm),xl))
        & equal(sdtasdt0(xn,xm),sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl))) )
     => equal(sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)),sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl))) ) ),
    file('/export/starexec/sandbox/tmp/tmpUNuh9a/sel_theBenchmark.p_1',m__) ).

fof(27,axiom,
    ! [X1,X2,X3] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2)
        & aNaturalNumber0(X3) )
     => equal(sdtasdt0(sdtasdt0(X1,X2),X3),sdtasdt0(X1,sdtasdt0(X2,X3))) ),
    file('/export/starexec/sandbox/tmp/tmpUNuh9a/sel_theBenchmark.p_1',mMulAsso) ).

fof(32,axiom,
    aNaturalNumber0(xn),
    file('/export/starexec/sandbox/tmp/tmpUNuh9a/sel_theBenchmark.p_1',m__1553) ).

fof(37,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => equal(sdtasdt0(X1,X2),sdtasdt0(X2,X1)) ),
    file('/export/starexec/sandbox/tmp/tmpUNuh9a/sel_theBenchmark.p_1',mMulComm) ).

fof(40,negated_conjecture,
    ~ ( ( aNaturalNumber0(sdtsldt0(xm,xl))
        & equal(xm,sdtasdt0(xl,sdtsldt0(xm,xl))) )
     => ( ( aNaturalNumber0(sdtsldt0(sdtasdt0(xn,xm),xl))
          & equal(sdtasdt0(xn,xm),sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl))) )
       => equal(sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)),sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl))) ) ),
    inference(assume_negation,[status(cth)],[26]) ).

fof(55,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)],[5]) ).

fof(56,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)],[55]) ).

fof(57,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)],[56]) ).

fof(58,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)],[57]) ).

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

cnf(89,plain,
    aNaturalNumber0(xl),
    inference(split_conjunct,[status(thm)],[12]) ).

fof(93,plain,
    ( ~ equal(xl,sz00)
    & ? [X2] :
        ( aNaturalNumber0(X2)
        & equal(xm,sdtasdt0(xl,X2)) )
    & doDivides0(xl,xm) ),
    inference(variable_rename,[status(thm)],[14]) ).

fof(94,plain,
    ( ~ equal(xl,sz00)
    & aNaturalNumber0(esk2_0)
    & equal(xm,sdtasdt0(xl,esk2_0))
    & doDivides0(xl,xm) ),
    inference(skolemize,[status(esa)],[93]) ).

cnf(96,plain,
    xm = sdtasdt0(xl,esk2_0),
    inference(split_conjunct,[status(thm)],[94]) ).

cnf(97,plain,
    aNaturalNumber0(esk2_0),
    inference(split_conjunct,[status(thm)],[94]) ).

cnf(98,plain,
    xl != sz00,
    inference(split_conjunct,[status(thm)],[94]) ).

fof(151,negated_conjecture,
    ( aNaturalNumber0(sdtsldt0(xm,xl))
    & equal(xm,sdtasdt0(xl,sdtsldt0(xm,xl)))
    & aNaturalNumber0(sdtsldt0(sdtasdt0(xn,xm),xl))
    & equal(sdtasdt0(xn,xm),sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)))
    & ~ equal(sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)),sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl))) ),
    inference(fof_nnf,[status(thm)],[40]) ).

cnf(152,negated_conjecture,
    sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) != sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)),
    inference(split_conjunct,[status(thm)],[151]) ).

cnf(153,negated_conjecture,
    sdtasdt0(xn,xm) = sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)),
    inference(split_conjunct,[status(thm)],[151]) ).

cnf(155,negated_conjecture,
    xm = sdtasdt0(xl,sdtsldt0(xm,xl)),
    inference(split_conjunct,[status(thm)],[151]) ).

cnf(156,negated_conjecture,
    aNaturalNumber0(sdtsldt0(xm,xl)),
    inference(split_conjunct,[status(thm)],[151]) ).

fof(157,plain,
    ! [X1,X2,X3] :
      ( ~ aNaturalNumber0(X1)
      | ~ aNaturalNumber0(X2)
      | ~ aNaturalNumber0(X3)
      | equal(sdtasdt0(sdtasdt0(X1,X2),X3),sdtasdt0(X1,sdtasdt0(X2,X3))) ),
    inference(fof_nnf,[status(thm)],[27]) ).

fof(158,plain,
    ! [X4,X5,X6] :
      ( ~ aNaturalNumber0(X4)
      | ~ aNaturalNumber0(X5)
      | ~ aNaturalNumber0(X6)
      | equal(sdtasdt0(sdtasdt0(X4,X5),X6),sdtasdt0(X4,sdtasdt0(X5,X6))) ),
    inference(variable_rename,[status(thm)],[157]) ).

cnf(159,plain,
    ( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
    | ~ aNaturalNumber0(X3)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[158]) ).

cnf(178,plain,
    aNaturalNumber0(xn),
    inference(split_conjunct,[status(thm)],[32]) ).

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

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

cnf(193,plain,
    ( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[192]) ).

cnf(425,plain,
    ( sdtasdt0(sdtasdt0(X2,X1),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
    | ~ aNaturalNumber0(X3)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    inference(spm,[status(thm)],[159,193,theory(equality)]) ).

cnf(505,plain,
    ( sz00 = xl
    | esk2_0 = X1
    | xm != sdtasdt0(xl,X1)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(esk2_0)
    | ~ aNaturalNumber0(xl) ),
    inference(spm,[status(thm)],[60,96,theory(equality)]) ).

cnf(523,plain,
    ( sz00 = xl
    | esk2_0 = X1
    | xm != sdtasdt0(xl,X1)
    | ~ aNaturalNumber0(X1)
    | $false
    | ~ aNaturalNumber0(xl) ),
    inference(rw,[status(thm)],[505,97,theory(equality)]) ).

cnf(524,plain,
    ( sz00 = xl
    | esk2_0 = X1
    | xm != sdtasdt0(xl,X1)
    | ~ aNaturalNumber0(X1)
    | $false
    | $false ),
    inference(rw,[status(thm)],[523,89,theory(equality)]) ).

cnf(525,plain,
    ( sz00 = xl
    | esk2_0 = X1
    | xm != sdtasdt0(xl,X1)
    | ~ aNaturalNumber0(X1) ),
    inference(cn,[status(thm)],[524,theory(equality)]) ).

cnf(526,plain,
    ( esk2_0 = X1
    | sdtasdt0(xl,X1) != xm
    | ~ aNaturalNumber0(X1) ),
    inference(sr,[status(thm)],[525,98,theory(equality)]) ).

cnf(579,negated_conjecture,
    sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) != sdtasdt0(xn,xm),
    inference(rw,[status(thm)],[152,153,theory(equality)]) ).

cnf(1306,negated_conjecture,
    ( esk2_0 = sdtsldt0(xm,xl)
    | ~ aNaturalNumber0(sdtsldt0(xm,xl)) ),
    inference(spm,[status(thm)],[526,155,theory(equality)]) ).

cnf(1315,negated_conjecture,
    ( esk2_0 = sdtsldt0(xm,xl)
    | $false ),
    inference(rw,[status(thm)],[1306,156,theory(equality)]) ).

cnf(1316,negated_conjecture,
    esk2_0 = sdtsldt0(xm,xl),
    inference(cn,[status(thm)],[1315,theory(equality)]) ).

cnf(1341,negated_conjecture,
    sdtasdt0(sdtasdt0(xl,xn),esk2_0) != sdtasdt0(xn,xm),
    inference(rw,[status(thm)],[579,1316,theory(equality)]) ).

cnf(7471,negated_conjecture,
    ( sdtasdt0(xn,sdtasdt0(xl,esk2_0)) != sdtasdt0(xn,xm)
    | ~ aNaturalNumber0(esk2_0)
    | ~ aNaturalNumber0(xl)
    | ~ aNaturalNumber0(xn) ),
    inference(spm,[status(thm)],[1341,425,theory(equality)]) ).

cnf(7602,negated_conjecture,
    ( $false
    | ~ aNaturalNumber0(esk2_0)
    | ~ aNaturalNumber0(xl)
    | ~ aNaturalNumber0(xn) ),
    inference(rw,[status(thm)],[7471,96,theory(equality)]) ).

cnf(7603,negated_conjecture,
    ( $false
    | $false
    | ~ aNaturalNumber0(xl)
    | ~ aNaturalNumber0(xn) ),
    inference(rw,[status(thm)],[7602,97,theory(equality)]) ).

cnf(7604,negated_conjecture,
    ( $false
    | $false
    | $false
    | ~ aNaturalNumber0(xn) ),
    inference(rw,[status(thm)],[7603,89,theory(equality)]) ).

cnf(7605,negated_conjecture,
    ( $false
    | $false
    | $false
    | $false ),
    inference(rw,[status(thm)],[7604,178,theory(equality)]) ).

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

cnf(7607,negated_conjecture,
    $false,
    7606,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : NUM479+2 : 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 : n100.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:14:00 CST 2018
% 0.02/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.45  -running prover on /export/starexec/sandbox/tmp/tmpUNuh9a/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.45  -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/tmpUNuh9a/sel_theBenchmark.p_1']
% 0.06/0.45  -prover status Theorem
% 0.06/0.45  Problem theBenchmark.p solved in phase 0.
% 0.06/0.45  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.45  % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.45  Solved 1 out of 1.
% 0.06/0.45  # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.45  # SZS status Theorem
% 0.06/0.45  # SZS output start CNFRefutation.
% See solution above
% 0.06/0.45  # SZS output end CNFRefutation
%------------------------------------------------------------------------------