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

View Problem - Process Solution

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

% Computer : n118.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:40 EST 2018

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

% Comments : 
%------------------------------------------------------------------------------
fof(12,axiom,
    ~ isPrime0(xp),
    file('/export/starexec/sandbox2/tmp/tmpaxl_OS/sel_theBenchmark.p_1',m__3161) ).

fof(49,axiom,
    isPrime0(xp),
    file('/export/starexec/sandbox2/tmp/tmpaxl_OS/sel_theBenchmark.p_1',m__3025) ).

fof(52,plain,
    ~ isPrime0(xp),
    inference(fof_simplification,[status(thm)],[12,theory(equality)]) ).

cnf(101,plain,
    ~ isPrime0(xp),
    inference(split_conjunct,[status(thm)],[52]) ).

cnf(246,plain,
    isPrime0(xp),
    inference(split_conjunct,[status(thm)],[49]) ).

cnf(247,plain,
    $false,
    inference(rw,[status(thm)],[101,246,theory(equality)]) ).

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

cnf(249,plain,
    $false,
    248,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : NUM530+1 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04  % Command  : Source/sine.py -e eprover -t %d %s
% 0.03/0.23  % Computer : n118.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 07:36:44 CST 2018
% 0.03/0.23  % CPUTime  : 
% 0.06/0.27  % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.27  --creating new selector for []
% 0.06/0.35  -running prover on /export/starexec/sandbox2/tmp/tmpaxl_OS/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.35  -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/tmpaxl_OS/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/sandbox2/benchmark/theBenchmark.p
% 0.06/0.35  % SZS status Ended for /export/starexec/sandbox2/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
%------------------------------------------------------------------------------