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

% Computer : n111.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:02:07 EST 2018

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

% Comments : 
%------------------------------------------------------------------------------
fof(5,axiom,
    ! [X1,X2,X3] :
      ( ( rdn_translate(X1,rdn_pos(X3))
        & rdn_translate(X2,rdn_neg(X3)) )
     => sum(X1,X2,n0) ),
    file('/export/starexec/sandbox2/tmp/tmpJrfEkB/sel_theBenchmark.p_1',sum_entry_point_posx_negx) ).

fof(21,axiom,
    rdn_translate(nn5,rdn_neg(rdnn(n5))),
    file('/export/starexec/sandbox2/tmp/tmpJrfEkB/sel_theBenchmark.p_1',rdnn5) ).

fof(45,axiom,
    rdn_translate(n5,rdn_pos(rdnn(n5))),
    file('/export/starexec/sandbox2/tmp/tmpJrfEkB/sel_theBenchmark.p_1',rdn5) ).

fof(66,conjecture,
    sum(n5,nn5,n0),
    file('/export/starexec/sandbox2/tmp/tmpJrfEkB/sel_theBenchmark.p_1',sum_n5_nn5_n0) ).

fof(67,negated_conjecture,
    ~ sum(n5,nn5,n0),
    inference(assume_negation,[status(cth)],[66]) ).

fof(68,negated_conjecture,
    ~ sum(n5,nn5,n0),
    inference(fof_simplification,[status(thm)],[67,theory(equality)]) ).

fof(73,plain,
    ! [X1,X2,X3] :
      ( ~ rdn_translate(X1,rdn_pos(X3))
      | ~ rdn_translate(X2,rdn_neg(X3))
      | sum(X1,X2,n0) ),
    inference(fof_nnf,[status(thm)],[5]) ).

fof(74,plain,
    ! [X4,X5,X6] :
      ( ~ rdn_translate(X4,rdn_pos(X6))
      | ~ rdn_translate(X5,rdn_neg(X6))
      | sum(X4,X5,n0) ),
    inference(variable_rename,[status(thm)],[73]) ).

cnf(75,plain,
    ( sum(X1,X2,n0)
    | ~ rdn_translate(X2,rdn_neg(X3))
    | ~ rdn_translate(X1,rdn_pos(X3)) ),
    inference(split_conjunct,[status(thm)],[74]) ).

cnf(93,plain,
    rdn_translate(nn5,rdn_neg(rdnn(n5))),
    inference(split_conjunct,[status(thm)],[21]) ).

cnf(123,plain,
    rdn_translate(n5,rdn_pos(rdnn(n5))),
    inference(split_conjunct,[status(thm)],[45]) ).

cnf(144,negated_conjecture,
    ~ sum(n5,nn5,n0),
    inference(split_conjunct,[status(thm)],[68]) ).

cnf(145,plain,
    ( sum(X1,nn5,n0)
    | ~ rdn_translate(X1,rdn_pos(rdnn(n5))) ),
    inference(spm,[status(thm)],[75,93,theory(equality)]) ).

cnf(154,plain,
    sum(n5,nn5,n0),
    inference(spm,[status(thm)],[145,123,theory(equality)]) ).

cnf(155,plain,
    $false,
    inference(sr,[status(thm)],[154,144,theory(equality)]) ).

cnf(156,plain,
    $false,
    155,
    [proof] ).

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