%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SWV077+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:02:40 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(25,axiom,
    true,
    file('/tmp/tmp4cpltV/sel_SWV077+1.p_1',ttrue) ).

fof(46,conjecture,
    ( ( leq(n0,pv31)
      & leq(pv31,minus(n5,n1)) )
   => ( leq(n0,pv31)
      & leq(pv31,minus(n5,n1))
      & ( n0 != pv40
       => ( leq(n0,pv31)
          & leq(pv31,minus(n5,n1)) ) )
      & ( n0 = pv40
       => true ) ) ),
    file('/tmp/tmp4cpltV/sel_SWV077+1.p_1',cl5_nebula_array_0018) ).

fof(63,negated_conjecture,
    ~ ( ( leq(n0,pv31)
        & leq(pv31,minus(n5,n1)) )
     => ( leq(n0,pv31)
        & leq(pv31,minus(n5,n1))
        & ( n0 != pv40
         => ( leq(n0,pv31)
            & leq(pv31,minus(n5,n1)) ) )
        & ( n0 = pv40
         => true ) ) ),
    inference(assume_negation,[status(cth)],[46]) ).

cnf(123,plain,
    true,
    inference(split_conjunct,[status(thm)],[25]) ).

fof(152,negated_conjecture,
    ( leq(n0,pv31)
    & leq(pv31,minus(n5,n1))
    & ( ~ leq(n0,pv31)
      | ~ leq(pv31,minus(n5,n1))
      | ( n0 != pv40
        & ( ~ leq(n0,pv31)
          | ~ leq(pv31,minus(n5,n1)) ) )
      | ( n0 = pv40
        & ~ true ) ) ),
    inference(fof_nnf,[status(thm)],[63]) ).

fof(153,negated_conjecture,
    ( leq(n0,pv31)
    & leq(pv31,minus(n5,n1))
    & ( n0 = pv40
      | n0 != pv40
      | ~ leq(n0,pv31)
      | ~ leq(pv31,minus(n5,n1)) )
    & ( ~ true
      | n0 != pv40
      | ~ leq(n0,pv31)
      | ~ leq(pv31,minus(n5,n1)) )
    & ( n0 = pv40
      | ~ leq(n0,pv31)
      | ~ leq(pv31,minus(n5,n1))
      | ~ leq(n0,pv31)
      | ~ leq(pv31,minus(n5,n1)) )
    & ( ~ true
      | ~ leq(n0,pv31)
      | ~ leq(pv31,minus(n5,n1))
      | ~ leq(n0,pv31)
      | ~ leq(pv31,minus(n5,n1)) ) ),
    inference(distribute,[status(thm)],[152]) ).

cnf(154,negated_conjecture,
    ( ~ leq(pv31,minus(n5,n1))
    | ~ leq(n0,pv31)
    | ~ leq(pv31,minus(n5,n1))
    | ~ leq(n0,pv31)
    | ~ true ),
    inference(split_conjunct,[status(thm)],[153]) ).

cnf(158,negated_conjecture,
    leq(pv31,minus(n5,n1)),
    inference(split_conjunct,[status(thm)],[153]) ).

cnf(159,negated_conjecture,
    leq(n0,pv31),
    inference(split_conjunct,[status(thm)],[153]) ).

cnf(257,negated_conjecture,
    ( ~ true
    | $false
    | ~ leq(pv31,minus(n5,n1)) ),
    inference(rw,[status(thm)],[154,159,theory(equality)]) ).

cnf(258,negated_conjecture,
    ( ~ true
    | $false
    | $false ),
    inference(rw,[status(thm)],[257,158,theory(equality)]) ).

cnf(259,negated_conjecture,
    ~ true,
    inference(cn,[status(thm)],[258,theory(equality)]) ).

cnf(260,plain,
    $false,
    inference(sr,[status(thm)],[123,259,theory(equality)]) ).

cnf(261,plain,
    $false,
    260,
    [proof] ).

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