TSTP Solution File: NUM432+3 by SInE---0.4

View Problem - Process Solution

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

% Computer : n132.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:19 EST 2018

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

% Comments : 
%------------------------------------------------------------------------------
fof(5,axiom,
    ! [X1,X2] :
      ( ( aInteger0(X1)
        & aInteger0(X2) )
     => aInteger0(sdtpldt0(X1,X2)) ),
    file('/export/starexec/sandbox/tmp/tmpzPB910/sel_theBenchmark.p_1',mIntPlus) ).

fof(9,axiom,
    ( aInteger0(xm)
    & equal(sdtasdt0(xq,xm),sdtpldt0(xb,smndt0(xc))) ),
    file('/export/starexec/sandbox/tmp/tmpzPB910/sel_theBenchmark.p_1',m__899) ).

fof(11,axiom,
    ( aInteger0(xn)
    & equal(sdtasdt0(xq,xn),sdtpldt0(xa,smndt0(xb))) ),
    file('/export/starexec/sandbox/tmp/tmpzPB910/sel_theBenchmark.p_1',m__876) ).

fof(13,axiom,
    equal(sdtasdt0(xq,sdtpldt0(xn,xm)),sdtpldt0(xa,smndt0(xc))),
    file('/export/starexec/sandbox/tmp/tmpzPB910/sel_theBenchmark.p_1',m__924) ).

fof(15,conjecture,
    ( ? [X1] :
        ( aInteger0(X1)
        & equal(sdtasdt0(xq,X1),sdtpldt0(xa,smndt0(xc))) )
    | aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
    | sdteqdtlpzmzozddtrp0(xa,xc,xq) ),
    file('/export/starexec/sandbox/tmp/tmpzPB910/sel_theBenchmark.p_1',m__) ).

fof(28,negated_conjecture,
    ~ ( ? [X1] :
          ( aInteger0(X1)
          & equal(sdtasdt0(xq,X1),sdtpldt0(xa,smndt0(xc))) )
      | aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
      | sdteqdtlpzmzozddtrp0(xa,xc,xq) ),
    inference(assume_negation,[status(cth)],[15]) ).

fof(47,plain,
    ! [X1,X2] :
      ( ~ aInteger0(X1)
      | ~ aInteger0(X2)
      | aInteger0(sdtpldt0(X1,X2)) ),
    inference(fof_nnf,[status(thm)],[5]) ).

fof(48,plain,
    ! [X3,X4] :
      ( ~ aInteger0(X3)
      | ~ aInteger0(X4)
      | aInteger0(sdtpldt0(X3,X4)) ),
    inference(variable_rename,[status(thm)],[47]) ).

cnf(49,plain,
    ( aInteger0(sdtpldt0(X1,X2))
    | ~ aInteger0(X2)
    | ~ aInteger0(X1) ),
    inference(split_conjunct,[status(thm)],[48]) ).

cnf(67,plain,
    aInteger0(xm),
    inference(split_conjunct,[status(thm)],[9]) ).

cnf(74,plain,
    aInteger0(xn),
    inference(split_conjunct,[status(thm)],[11]) ).

cnf(76,plain,
    sdtasdt0(xq,sdtpldt0(xn,xm)) = sdtpldt0(xa,smndt0(xc)),
    inference(split_conjunct,[status(thm)],[13]) ).

fof(82,negated_conjecture,
    ( ! [X1] :
        ( ~ aInteger0(X1)
        | ~ equal(sdtasdt0(xq,X1),sdtpldt0(xa,smndt0(xc))) )
    & ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
    & ~ sdteqdtlpzmzozddtrp0(xa,xc,xq) ),
    inference(fof_nnf,[status(thm)],[28]) ).

fof(83,negated_conjecture,
    ( ! [X2] :
        ( ~ aInteger0(X2)
        | ~ equal(sdtasdt0(xq,X2),sdtpldt0(xa,smndt0(xc))) )
    & ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
    & ~ sdteqdtlpzmzozddtrp0(xa,xc,xq) ),
    inference(variable_rename,[status(thm)],[82]) ).

fof(84,negated_conjecture,
    ! [X2] :
      ( ( ~ aInteger0(X2)
        | ~ equal(sdtasdt0(xq,X2),sdtpldt0(xa,smndt0(xc))) )
      & ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xc)))
      & ~ sdteqdtlpzmzozddtrp0(xa,xc,xq) ),
    inference(shift_quantors,[status(thm)],[83]) ).

cnf(87,negated_conjecture,
    ( sdtasdt0(xq,X1) != sdtpldt0(xa,smndt0(xc))
    | ~ aInteger0(X1) ),
    inference(split_conjunct,[status(thm)],[84]) ).

cnf(250,negated_conjecture,
    ( sdtasdt0(xq,sdtpldt0(xn,xm)) != sdtasdt0(xq,X1)
    | ~ aInteger0(X1) ),
    inference(rw,[status(thm)],[87,76,theory(equality)]) ).

cnf(541,negated_conjecture,
    ~ aInteger0(sdtpldt0(xn,xm)),
    inference(er,[status(thm)],[250,theory(equality)]) ).

cnf(560,negated_conjecture,
    ( ~ aInteger0(xm)
    | ~ aInteger0(xn) ),
    inference(spm,[status(thm)],[541,49,theory(equality)]) ).

cnf(563,negated_conjecture,
    ( $false
    | ~ aInteger0(xn) ),
    inference(rw,[status(thm)],[560,67,theory(equality)]) ).

cnf(564,negated_conjecture,
    ( $false
    | $false ),
    inference(rw,[status(thm)],[563,74,theory(equality)]) ).

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

cnf(566,negated_conjecture,
    $false,
    565,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.04  % Problem  : NUM432+3 : TPTP v7.0.0. Released v4.0.0.
% 0.01/0.04  % Command  : Source/sine.py -e eprover -t %d %s
% 0.02/0.23  % Computer : n132.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 03:25:45 CST 2018
% 0.02/0.23  % 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.36  -running prover on /export/starexec/sandbox/tmp/tmpzPB910/sel_theBenchmark.p_1 with time limit 29
% 0.07/0.36  -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/tmpzPB910/sel_theBenchmark.p_1']
% 0.07/0.36  -prover status Theorem
% 0.07/0.36  Problem theBenchmark.p solved in phase 0.
% 0.07/0.36  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.36  % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.37  Solved 1 out of 1.
% 0.07/0.37  # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.37  # SZS status Theorem
% 0.07/0.37  # SZS output start CNFRefutation.
% See solution above
% 0.07/0.37  # SZS output end CNFRefutation
%------------------------------------------------------------------------------