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

% Computer : art06.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:03:23 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(33,conjecture,
    ( ( leq(n0,pv66)
      & leq(pv66,minus(n5,n1)) )
   => ( leq(n0,pv66)
      & leq(pv66,minus(n5,n1)) ) ),
    file('/tmp/tmpyBe26a/sel_SWV083+1.p_1',cl5_nebula_array_0024) ).

fof(62,negated_conjecture,
    ~ ( ( leq(n0,pv66)
        & leq(pv66,minus(n5,n1)) )
     => ( leq(n0,pv66)
        & leq(pv66,minus(n5,n1)) ) ),
    inference(assume_negation,[status(cth)],[33]) ).

fof(64,negated_conjecture,
    ~ $true,
    inference(fof_simplification,[status(thm)],[62,theory(equality)]) ).

cnf(137,negated_conjecture,
    $false,
    inference(split_conjunct,[status(thm)],[64]) ).

cnf(206,negated_conjecture,
    $false,
    137,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV083+1.p
% --creating new selector for [SWV003+0.ax]
% -running prover on /tmp/tmpyBe26a/sel_SWV083+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV083+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV083+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV083+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
% 
%------------------------------------------------------------------------------