%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SYN061+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:11:32 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,axiom,
    ~ ? [X1] :
        ( big_f(X1)
        & ( big_g(X1)
          | big_h(X1) ) ),
    file('/tmp/tmpM5guJa/sel_SYN061+1.p_1',pel31_1) ).

fof(2,axiom,
    ! [X1] :
      ( ~ big_h(X1)
     => big_j(X1) ),
    file('/tmp/tmpM5guJa/sel_SYN061+1.p_1',pel31_3) ).

fof(3,axiom,
    ? [X1] :
      ( big_i(X1)
      & big_f(X1) ),
    file('/tmp/tmpM5guJa/sel_SYN061+1.p_1',pel31_2) ).

fof(4,conjecture,
    ? [X1] :
      ( big_i(X1)
      & big_j(X1) ),
    file('/tmp/tmpM5guJa/sel_SYN061+1.p_1',pel31) ).

fof(5,negated_conjecture,
    ~ ? [X1] :
        ( big_i(X1)
        & big_j(X1) ),
    inference(assume_negation,[status(cth)],[4]) ).

fof(6,plain,
    ! [X1] :
      ( ~ big_h(X1)
     => big_j(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)],[1]) ).

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

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

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

fof(12,plain,
    ! [X1] :
      ( big_h(X1)
      | big_j(X1) ),
    inference(fof_nnf,[status(thm)],[6]) ).

fof(13,plain,
    ! [X2] :
      ( big_h(X2)
      | big_j(X2) ),
    inference(variable_rename,[status(thm)],[12]) ).

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

fof(15,plain,
    ? [X2] :
      ( big_i(X2)
      & big_f(X2) ),
    inference(variable_rename,[status(thm)],[3]) ).

fof(16,plain,
    ( big_i(esk1_0)
    & big_f(esk1_0) ),
    inference(skolemize,[status(esa)],[15]) ).

cnf(17,plain,
    big_f(esk1_0),
    inference(split_conjunct,[status(thm)],[16]) ).

cnf(18,plain,
    big_i(esk1_0),
    inference(split_conjunct,[status(thm)],[16]) ).

fof(19,negated_conjecture,
    ! [X1] :
      ( ~ big_i(X1)
      | ~ big_j(X1) ),
    inference(fof_nnf,[status(thm)],[5]) ).

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

cnf(21,negated_conjecture,
    ( ~ big_j(X1)
    | ~ big_i(X1) ),
    inference(split_conjunct,[status(thm)],[20]) ).

cnf(22,negated_conjecture,
    ( big_h(X1)
    | ~ big_i(X1) ),
    inference(spm,[status(thm)],[21,14,theory(equality)]) ).

cnf(23,negated_conjecture,
    ( ~ big_f(X1)
    | ~ big_i(X1) ),
    inference(spm,[status(thm)],[10,22,theory(equality)]) ).

cnf(24,negated_conjecture,
    ~ big_f(esk1_0),
    inference(spm,[status(thm)],[23,18,theory(equality)]) ).

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

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

cnf(27,negated_conjecture,
    $false,
    26,
    [proof] ).

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