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

% Computer : art03.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:56 EST 2010

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

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

fof(21,axiom,
    ! [X1] : minus(X1,n1) = pred(X1),
    file('/tmp/tmp6FC57s/sel_SWV069+1.p_1',pred_minus_1) ).

fof(24,axiom,
    ! [X1,X2] :
      ( leq(X1,pred(X2))
    <=> gt(X2,X1) ),
    file('/tmp/tmp6FC57s/sel_SWV069+1.p_1',leq_gt_pred) ).

fof(31,axiom,
    gt(n5,n0),
    file('/tmp/tmp6FC57s/sel_SWV069+1.p_1',gt_5_0) ).

fof(56,conjecture,
    ( ( leq(n0,pv10)
      & leq(pv10,minus(n135300,n1)) )
   => ( leq(n0,n0)
      & leq(n0,pv10)
      & leq(n0,minus(n5,n1))
      & leq(pv10,minus(n135300,n1)) ) ),
    file('/tmp/tmp6FC57s/sel_SWV069+1.p_1',cl5_nebula_array_0010) ).

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

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(117,plain,
    ! [X2] : minus(X2,n1) = pred(X2),
    inference(variable_rename,[status(thm)],[21]) ).

cnf(118,plain,
    minus(X1,n1) = pred(X1),
    inference(split_conjunct,[status(thm)],[117]) ).

fof(125,plain,
    ! [X1,X2] :
      ( ( ~ leq(X1,pred(X2))
        | gt(X2,X1) )
      & ( ~ gt(X2,X1)
        | leq(X1,pred(X2)) ) ),
    inference(fof_nnf,[status(thm)],[24]) ).

fof(126,plain,
    ! [X3,X4] :
      ( ( ~ leq(X3,pred(X4))
        | gt(X4,X3) )
      & ( ~ gt(X4,X3)
        | leq(X3,pred(X4)) ) ),
    inference(variable_rename,[status(thm)],[125]) ).

cnf(127,plain,
    ( leq(X1,pred(X2))
    | ~ gt(X2,X1) ),
    inference(split_conjunct,[status(thm)],[126]) ).

cnf(141,plain,
    gt(n5,n0),
    inference(split_conjunct,[status(thm)],[31]) ).

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

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

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

cnf(179,negated_conjecture,
    leq(n0,pv10),
    inference(split_conjunct,[status(thm)],[176]) ).

cnf(221,plain,
    ( leq(X1,minus(X2,n1))
    | ~ gt(X2,X1) ),
    inference(rw,[status(thm)],[127,118,theory(equality)]),
    [unfolding] ).

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

cnf(351,negated_conjecture,
    ( $false
    | $false
    | ~ leq(n0,minus(n5,n1))
    | ~ leq(pv10,minus(n135300,n1)) ),
    inference(rw,[status(thm)],[350,179,theory(equality)]) ).

cnf(352,negated_conjecture,
    ( $false
    | $false
    | ~ leq(n0,minus(n5,n1))
    | $false ),
    inference(rw,[status(thm)],[351,178,theory(equality)]) ).

cnf(353,negated_conjecture,
    ~ leq(n0,minus(n5,n1)),
    inference(cn,[status(thm)],[352,theory(equality)]) ).

cnf(355,negated_conjecture,
    ~ gt(n5,n0),
    inference(spm,[status(thm)],[353,221,theory(equality)]) ).

cnf(356,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[355,141,theory(equality)]) ).

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

cnf(358,negated_conjecture,
    $false,
    357,
    [proof] ).

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