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

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,axiom,
    ! [X1] :
      ( ( big_f(X1)
        | big_g(X1) )
     => ~ big_h(X1) ),
    file('/tmp/tmpkUsrFK/sel_SYN060+1.p_1',pel30_1) ).

fof(2,axiom,
    ! [X1] :
      ( ( big_g(X1)
       => ~ big_i(X1) )
     => ( big_f(X1)
        & big_h(X1) ) ),
    file('/tmp/tmpkUsrFK/sel_SYN060+1.p_1',pel30_2) ).

fof(3,conjecture,
    ! [X1] : big_i(X1),
    file('/tmp/tmpkUsrFK/sel_SYN060+1.p_1',pel30) ).

fof(4,negated_conjecture,
    ~ ! [X1] : big_i(X1),
    inference(assume_negation,[status(cth)],[3]) ).

fof(5,plain,
    ! [X1] :
      ( ( big_f(X1)
        | big_g(X1) )
     => ~ big_h(X1) ),
    inference(fof_simplification,[status(thm)],[1,theory(equality)]) ).

fof(6,plain,
    ! [X1] :
      ( ( big_g(X1)
       => ~ big_i(X1) )
     => ( big_f(X1)
        & big_h(X1) ) ),
    inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).

fof(7,plain,
    ! [X1] :
      ( ( ~ big_f(X1)
        & ~ big_g(X1) )
      | ~ big_h(X1) ),
    inference(fof_nnf,[status(thm)],[5]) ).

fof(8,plain,
    ! [X2] :
      ( ( ~ big_f(X2)
        & ~ big_g(X2) )
      | ~ big_h(X2) ),
    inference(variable_rename,[status(thm)],[7]) ).

fof(9,plain,
    ! [X2] :
      ( ( ~ big_f(X2)
        | ~ big_h(X2) )
      & ( ~ big_g(X2)
        | ~ big_h(X2) ) ),
    inference(distribute,[status(thm)],[8]) ).

cnf(11,plain,
    ( ~ big_h(X1)
    | ~ big_f(X1) ),
    inference(split_conjunct,[status(thm)],[9]) ).

fof(12,plain,
    ! [X1] :
      ( ( big_g(X1)
        & big_i(X1) )
      | ( big_f(X1)
        & big_h(X1) ) ),
    inference(fof_nnf,[status(thm)],[6]) ).

fof(13,plain,
    ! [X2] :
      ( ( big_g(X2)
        & big_i(X2) )
      | ( big_f(X2)
        & big_h(X2) ) ),
    inference(variable_rename,[status(thm)],[12]) ).

fof(14,plain,
    ! [X2] :
      ( ( big_f(X2)
        | big_g(X2) )
      & ( big_h(X2)
        | big_g(X2) )
      & ( big_f(X2)
        | big_i(X2) )
      & ( big_h(X2)
        | big_i(X2) ) ),
    inference(distribute,[status(thm)],[13]) ).

cnf(15,plain,
    ( big_i(X1)
    | big_h(X1) ),
    inference(split_conjunct,[status(thm)],[14]) ).

cnf(16,plain,
    ( big_i(X1)
    | big_f(X1) ),
    inference(split_conjunct,[status(thm)],[14]) ).

fof(19,negated_conjecture,
    ? [X1] : ~ big_i(X1),
    inference(fof_nnf,[status(thm)],[4]) ).

fof(20,negated_conjecture,
    ? [X2] : ~ big_i(X2),
    inference(variable_rename,[status(thm)],[19]) ).

fof(21,negated_conjecture,
    ~ big_i(esk1_0),
    inference(skolemize,[status(esa)],[20]) ).

cnf(22,negated_conjecture,
    ~ big_i(esk1_0),
    inference(split_conjunct,[status(thm)],[21]) ).

cnf(23,negated_conjecture,
    big_f(esk1_0),
    inference(spm,[status(thm)],[22,16,theory(equality)]) ).

cnf(24,negated_conjecture,
    big_h(esk1_0),
    inference(spm,[status(thm)],[22,15,theory(equality)]) ).

cnf(27,negated_conjecture,
    ~ big_h(esk1_0),
    inference(spm,[status(thm)],[11,23,theory(equality)]) ).

cnf(28,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[27,24,theory(equality)]) ).

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

cnf(30,negated_conjecture,
    $false,
    29,
    [proof] ).

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