%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SWV065+1 : TPTP v5.0.0. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : Source/sine.py -e eprover -t %d %s

% Computer : art09.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 2018MB
% OS       : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sun Dec 26 12:01:12 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(20,axiom,
    ! [X1] : leq(X1,X1),
    file('/tmp/tmpNC6Y5_/sel_SWV065+1.p_1',reflexivity_leq) ).

fof(39,conjecture,
    ( ( leq(n0,pv10)
      & leq(n0,pv53)
      & leq(pv10,minus(n135300,n1))
      & leq(pv53,minus(n5,n1)) )
   => ( leq(n0,n0)
      & leq(n0,pv10)
      & leq(n0,pv53)
      & leq(pv10,minus(n135300,n1))
      & leq(pv53,minus(n5,n1)) ) ),
    file('/tmp/tmpNC6Y5_/sel_SWV065+1.p_1',cl5_nebula_array_0006) ).

fof(69,negated_conjecture,
    ~ ( ( leq(n0,pv10)
        & leq(n0,pv53)
        & leq(pv10,minus(n135300,n1))
        & leq(pv53,minus(n5,n1)) )
     => ( leq(n0,n0)
        & leq(n0,pv10)
        & leq(n0,pv53)
        & leq(pv10,minus(n135300,n1))
        & leq(pv53,minus(n5,n1)) ) ),
    inference(assume_negation,[status(cth)],[39]) ).

fof(115,plain,
    ! [X2] : leq(X2,X2),
    inference(variable_rename,[status(thm)],[20]) ).

cnf(116,plain,
    leq(X1,X1),
    inference(split_conjunct,[status(thm)],[115]) ).

fof(149,negated_conjecture,
    ( leq(n0,pv10)
    & leq(n0,pv53)
    & leq(pv10,minus(n135300,n1))
    & leq(pv53,minus(n5,n1))
    & ( ~ leq(n0,n0)
      | ~ leq(n0,pv10)
      | ~ leq(n0,pv53)
      | ~ leq(pv10,minus(n135300,n1))
      | ~ leq(pv53,minus(n5,n1)) ) ),
    inference(fof_nnf,[status(thm)],[69]) ).

cnf(150,negated_conjecture,
    ( ~ leq(pv53,minus(n5,n1))
    | ~ leq(pv10,minus(n135300,n1))
    | ~ leq(n0,pv53)
    | ~ leq(n0,pv10)
    | ~ leq(n0,n0) ),
    inference(split_conjunct,[status(thm)],[149]) ).

cnf(151,negated_conjecture,
    leq(pv53,minus(n5,n1)),
    inference(split_conjunct,[status(thm)],[149]) ).

cnf(152,negated_conjecture,
    leq(pv10,minus(n135300,n1)),
    inference(split_conjunct,[status(thm)],[149]) ).

cnf(153,negated_conjecture,
    leq(n0,pv53),
    inference(split_conjunct,[status(thm)],[149]) ).

cnf(154,negated_conjecture,
    leq(n0,pv10),
    inference(split_conjunct,[status(thm)],[149]) ).

cnf(372,negated_conjecture,
    ( $false
    | ~ leq(n0,pv10)
    | ~ leq(n0,pv53)
    | ~ leq(pv10,minus(n135300,n1))
    | ~ leq(pv53,minus(n5,n1)) ),
    inference(rw,[status(thm)],[150,116,theory(equality)]) ).

cnf(373,negated_conjecture,
    ( $false
    | $false
    | ~ leq(n0,pv53)
    | ~ leq(pv10,minus(n135300,n1))
    | ~ leq(pv53,minus(n5,n1)) ),
    inference(rw,[status(thm)],[372,154,theory(equality)]) ).

cnf(374,negated_conjecture,
    ( $false
    | $false
    | $false
    | ~ leq(pv10,minus(n135300,n1))
    | ~ leq(pv53,minus(n5,n1)) ),
    inference(rw,[status(thm)],[373,153,theory(equality)]) ).

cnf(375,negated_conjecture,
    ( $false
    | $false
    | $false
    | $false
    | ~ leq(pv53,minus(n5,n1)) ),
    inference(rw,[status(thm)],[374,152,theory(equality)]) ).

cnf(376,negated_conjecture,
    ( $false
    | $false
    | $false
    | $false
    | $false ),
    inference(rw,[status(thm)],[375,151,theory(equality)]) ).

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

cnf(378,negated_conjecture,
    $false,
    377,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV065+1.p
% --creating new selector for [SWV003+0.ax]
% -running prover on /tmp/tmpNC6Y5_/sel_SWV065+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV065+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV065+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV065+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
% 
%------------------------------------------------------------------------------