%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SWV150+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:19:41 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(18,axiom,
    ! [X1] : leq(X1,X1),
    file('/tmp/tmp2Tb2Z-/sel_SWV150+1.p_1',reflexivity_leq) ).

fof(54,conjecture,
    ( ~ leq(tptp_float_0_001,tptp_float_0_001)
   => leq(s_worst7,n3) ),
    file('/tmp/tmp2Tb2Z-/sel_SWV150+1.p_1',gauss_array_0020) ).

fof(57,negated_conjecture,
    ~ ( ~ leq(tptp_float_0_001,tptp_float_0_001)
     => leq(s_worst7,n3) ),
    inference(assume_negation,[status(cth)],[54]) ).

fof(59,negated_conjecture,
    ~ ( ~ leq(tptp_float_0_001,tptp_float_0_001)
     => leq(s_worst7,n3) ),
    inference(fof_simplification,[status(thm)],[57,theory(equality)]) ).

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

cnf(100,plain,
    leq(X1,X1),
    inference(split_conjunct,[status(thm)],[99]) ).

fof(157,negated_conjecture,
    ( ~ leq(tptp_float_0_001,tptp_float_0_001)
    & ~ leq(s_worst7,n3) ),
    inference(fof_nnf,[status(thm)],[59]) ).

cnf(159,negated_conjecture,
    ~ leq(tptp_float_0_001,tptp_float_0_001),
    inference(split_conjunct,[status(thm)],[157]) ).

cnf(184,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[159,100,theory(equality)]) ).

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

cnf(186,negated_conjecture,
    $false,
    185,
    [proof] ).

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