%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SYN403+1 : TPTP v5.0.0. Released v2.0.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 13:20:04 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ! [X1] :
      ( ( ( f(X1)
         => g(X1) )
        & ( g(X1)
         => h(X1) ) )
     => ( f(X1)
       => h(X1) ) ),
    file('/tmp/tmpQBUIIU/sel_SYN403+1.p_1',kalish234) ).

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

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

fof(4,negated_conjecture,
    ? [X2] :
      ( ( ~ f(X2)
        | g(X2) )
      & ( ~ g(X2)
        | h(X2) )
      & f(X2)
      & ~ h(X2) ),
    inference(variable_rename,[status(thm)],[3]) ).

fof(5,negated_conjecture,
    ( ( ~ f(esk1_0)
      | g(esk1_0) )
    & ( ~ g(esk1_0)
      | h(esk1_0) )
    & f(esk1_0)
    & ~ h(esk1_0) ),
    inference(skolemize,[status(esa)],[4]) ).

cnf(6,negated_conjecture,
    ~ h(esk1_0),
    inference(split_conjunct,[status(thm)],[5]) ).

cnf(7,negated_conjecture,
    f(esk1_0),
    inference(split_conjunct,[status(thm)],[5]) ).

cnf(8,negated_conjecture,
    ( h(esk1_0)
    | ~ g(esk1_0) ),
    inference(split_conjunct,[status(thm)],[5]) ).

cnf(9,negated_conjecture,
    ( g(esk1_0)
    | ~ f(esk1_0) ),
    inference(split_conjunct,[status(thm)],[5]) ).

cnf(10,negated_conjecture,
    ( g(esk1_0)
    | $false ),
    inference(rw,[status(thm)],[9,7,theory(equality)]) ).

cnf(11,negated_conjecture,
    g(esk1_0),
    inference(cn,[status(thm)],[10,theory(equality)]) ).

cnf(12,negated_conjecture,
    ( h(esk1_0)
    | $false ),
    inference(rw,[status(thm)],[8,11,theory(equality)]) ).

cnf(13,negated_conjecture,
    h(esk1_0),
    inference(cn,[status(thm)],[12,theory(equality)]) ).

cnf(14,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[13,6,theory(equality)]) ).

cnf(15,negated_conjecture,
    $false,
    14,
    [proof] ).

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