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

% Computer : art11.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory   : 2006MB
% OS       : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 26 13:24:51 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ( ~ ? [X1] : f(X1)
   => ! [X2] :
        ( f(X2)
       => g(X2) ) ),
    file('/tmp/tmpXuhH0P/sel_SYN408+1.p_1',kalish244) ).

fof(2,negated_conjecture,
    ~ ( ~ ? [X1] : f(X1)
     => ! [X2] :
          ( f(X2)
         => g(X2) ) ),
    inference(assume_negation,[status(cth)],[1]) ).

fof(3,negated_conjecture,
    ( ! [X1] : ~ f(X1)
    & ? [X2] :
        ( f(X2)
        & ~ g(X2) ) ),
    inference(fof_nnf,[status(thm)],[2]) ).

fof(4,negated_conjecture,
    ( ! [X3] : ~ f(X3)
    & ? [X4] :
        ( f(X4)
        & ~ g(X4) ) ),
    inference(variable_rename,[status(thm)],[3]) ).

fof(5,negated_conjecture,
    ( ! [X3] : ~ f(X3)
    & f(esk1_0)
    & ~ g(esk1_0) ),
    inference(skolemize,[status(esa)],[4]) ).

fof(6,negated_conjecture,
    ! [X3] :
      ( ~ f(X3)
      & f(esk1_0)
      & ~ g(esk1_0) ),
    inference(shift_quantors,[status(thm)],[5]) ).

cnf(8,negated_conjecture,
    f(esk1_0),
    inference(split_conjunct,[status(thm)],[6]) ).

cnf(9,negated_conjecture,
    ~ f(X1),
    inference(split_conjunct,[status(thm)],[6]) ).

cnf(10,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[8,9,theory(equality)]) ).

cnf(11,negated_conjecture,
    $false,
    10,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
%   from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN408+1.p
% --creating new selector for []
% -running prover on /tmp/tmpXuhH0P/sel_SYN408+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN408+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN408+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN408+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
% 
%------------------------------------------------------------------------------