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

% Computer : art02.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 : Sat Dec 25 17:23:03 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(6,axiom,
    ( aFixedPointOf0(xp,xf)
    & aSupremumOfIn0(xp,xT,xS) ),
    file('/tmp/tmpjqWxmC/sel_LAT388+1.p_1',m__1330) ).

fof(30,conjecture,
    ? [X1] : aSupremumOfIn0(X1,xT,xS),
    file('/tmp/tmpjqWxmC/sel_LAT388+1.p_1',m__) ).

fof(32,negated_conjecture,
    ~ ? [X1] : aSupremumOfIn0(X1,xT,xS),
    inference(assume_negation,[status(cth)],[30]) ).

cnf(57,plain,
    aSupremumOfIn0(xp,xT,xS),
    inference(split_conjunct,[status(thm)],[6]) ).

fof(172,negated_conjecture,
    ! [X1] : ~ aSupremumOfIn0(X1,xT,xS),
    inference(fof_nnf,[status(thm)],[32]) ).

fof(173,negated_conjecture,
    ! [X2] : ~ aSupremumOfIn0(X2,xT,xS),
    inference(variable_rename,[status(thm)],[172]) ).

cnf(174,negated_conjecture,
    ~ aSupremumOfIn0(X1,xT,xS),
    inference(split_conjunct,[status(thm)],[173]) ).

cnf(179,plain,
    $false,
    inference(sr,[status(thm)],[57,174,theory(equality)]) ).

cnf(180,plain,
    $false,
    179,
    [proof] ).

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