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

% Computer : art05.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:17:24 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(3,axiom,
    ! [X1,X2,X3] :
      ( ( leq(X1,X2)
        & leq(X2,X3) )
     => leq(X1,X3) ),
    file('/tmp/tmpwzn6dI/sel_SWV135+1.p_1',transitivity_leq) ).

fof(5,axiom,
    ! [X1,X2] :
      ( gt(X2,X1)
     => leq(X1,X2) ),
    file('/tmp/tmpwzn6dI/sel_SWV135+1.p_1',leq_gt1) ).

fof(38,axiom,
    gt(n2,n0),
    file('/tmp/tmpwzn6dI/sel_SWV135+1.p_1',gt_2_0) ).

fof(54,conjecture,
    ( ( leq(n0,s_best7)
      & leq(n0,s_sworst7)
      & leq(n0,s_worst7)
      & leq(n2,pv1325)
      & leq(s_best7,n3)
      & leq(s_sworst7,n3)
      & leq(s_worst7,n3)
      & leq(pv1325,n3) )
   => leq(n0,pv1325) ),
    file('/tmp/tmpwzn6dI/sel_SWV135+1.p_1',gauss_array_0005) ).

fof(57,negated_conjecture,
    ~ ( ( leq(n0,s_best7)
        & leq(n0,s_sworst7)
        & leq(n0,s_worst7)
        & leq(n2,pv1325)
        & leq(s_best7,n3)
        & leq(s_sworst7,n3)
        & leq(s_worst7,n3)
        & leq(pv1325,n3) )
     => leq(n0,pv1325) ),
    inference(assume_negation,[status(cth)],[54]) ).

fof(64,plain,
    ! [X1,X2,X3] :
      ( ~ leq(X1,X2)
      | ~ leq(X2,X3)
      | leq(X1,X3) ),
    inference(fof_nnf,[status(thm)],[3]) ).

fof(65,plain,
    ! [X4,X5,X6] :
      ( ~ leq(X4,X5)
      | ~ leq(X5,X6)
      | leq(X4,X6) ),
    inference(variable_rename,[status(thm)],[64]) ).

cnf(66,plain,
    ( leq(X1,X2)
    | ~ leq(X3,X2)
    | ~ leq(X1,X3) ),
    inference(split_conjunct,[status(thm)],[65]) ).

fof(70,plain,
    ! [X1,X2] :
      ( ~ gt(X2,X1)
      | leq(X1,X2) ),
    inference(fof_nnf,[status(thm)],[5]) ).

fof(71,plain,
    ! [X3,X4] :
      ( ~ gt(X4,X3)
      | leq(X3,X4) ),
    inference(variable_rename,[status(thm)],[70]) ).

cnf(72,plain,
    ( leq(X1,X2)
    | ~ gt(X2,X1) ),
    inference(split_conjunct,[status(thm)],[71]) ).

cnf(128,plain,
    gt(n2,n0),
    inference(split_conjunct,[status(thm)],[38]) ).

fof(156,negated_conjecture,
    ( leq(n0,s_best7)
    & leq(n0,s_sworst7)
    & leq(n0,s_worst7)
    & leq(n2,pv1325)
    & leq(s_best7,n3)
    & leq(s_sworst7,n3)
    & leq(s_worst7,n3)
    & leq(pv1325,n3)
    & ~ leq(n0,pv1325) ),
    inference(fof_nnf,[status(thm)],[57]) ).

cnf(157,negated_conjecture,
    ~ leq(n0,pv1325),
    inference(split_conjunct,[status(thm)],[156]) ).

cnf(162,negated_conjecture,
    leq(n2,pv1325),
    inference(split_conjunct,[status(thm)],[156]) ).

cnf(200,plain,
    leq(n0,n2),
    inference(spm,[status(thm)],[72,128,theory(equality)]) ).

cnf(223,negated_conjecture,
    ( leq(X1,pv1325)
    | ~ leq(X1,n2) ),
    inference(spm,[status(thm)],[66,162,theory(equality)]) ).

cnf(547,negated_conjecture,
    ~ leq(n0,n2),
    inference(spm,[status(thm)],[157,223,theory(equality)]) ).

cnf(554,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[547,200,theory(equality)]) ).

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

cnf(556,negated_conjecture,
    $false,
    555,
    [proof] ).

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