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

% Computer : art04.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:49 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,axiom,
    ! [X1] :
    ? [X2] : big_g(X1,X2),
    file('/tmp/tmppmbQ7Q/sel_SYN065+1.p_1',pel36_2) ).

fof(2,axiom,
    ! [X1,X2] :
      ( ( big_f(X1,X2)
        | big_g(X1,X2) )
     => ! [X3] :
          ( ( big_f(X2,X3)
            | big_g(X2,X3) )
         => big_h(X1,X3) ) ),
    file('/tmp/tmppmbQ7Q/sel_SYN065+1.p_1',pel36_3) ).

fof(4,conjecture,
    ! [X1] :
    ? [X2] : big_h(X1,X2),
    file('/tmp/tmppmbQ7Q/sel_SYN065+1.p_1',pel36) ).

fof(5,negated_conjecture,
    ~ ! [X1] :
      ? [X2] : big_h(X1,X2),
    inference(assume_negation,[status(cth)],[4]) ).

fof(6,plain,
    ! [X3] :
    ? [X4] : big_g(X3,X4),
    inference(variable_rename,[status(thm)],[1]) ).

fof(7,plain,
    ! [X3] : big_g(X3,esk1_1(X3)),
    inference(skolemize,[status(esa)],[6]) ).

cnf(8,plain,
    big_g(X1,esk1_1(X1)),
    inference(split_conjunct,[status(thm)],[7]) ).

fof(9,plain,
    ! [X1,X2] :
      ( ( ~ big_f(X1,X2)
        & ~ big_g(X1,X2) )
      | ! [X3] :
          ( ( ~ big_f(X2,X3)
            & ~ big_g(X2,X3) )
          | big_h(X1,X3) ) ),
    inference(fof_nnf,[status(thm)],[2]) ).

fof(10,plain,
    ! [X4,X5] :
      ( ( ~ big_f(X4,X5)
        & ~ big_g(X4,X5) )
      | ! [X6] :
          ( ( ~ big_f(X5,X6)
            & ~ big_g(X5,X6) )
          | big_h(X4,X6) ) ),
    inference(variable_rename,[status(thm)],[9]) ).

fof(11,plain,
    ! [X4,X5,X6] :
      ( ( ~ big_f(X5,X6)
        & ~ big_g(X5,X6) )
      | big_h(X4,X6)
      | ( ~ big_f(X4,X5)
        & ~ big_g(X4,X5) ) ),
    inference(shift_quantors,[status(thm)],[10]) ).

fof(12,plain,
    ! [X4,X5,X6] :
      ( ( ~ big_f(X4,X5)
        | ~ big_f(X5,X6)
        | big_h(X4,X6) )
      & ( ~ big_g(X4,X5)
        | ~ big_f(X5,X6)
        | big_h(X4,X6) )
      & ( ~ big_f(X4,X5)
        | ~ big_g(X5,X6)
        | big_h(X4,X6) )
      & ( ~ big_g(X4,X5)
        | ~ big_g(X5,X6)
        | big_h(X4,X6) ) ),
    inference(distribute,[status(thm)],[11]) ).

cnf(13,plain,
    ( big_h(X1,X2)
    | ~ big_g(X3,X2)
    | ~ big_g(X1,X3) ),
    inference(split_conjunct,[status(thm)],[12]) ).

fof(20,negated_conjecture,
    ? [X1] :
    ! [X2] : ~ big_h(X1,X2),
    inference(fof_nnf,[status(thm)],[5]) ).

fof(21,negated_conjecture,
    ? [X3] :
    ! [X4] : ~ big_h(X3,X4),
    inference(variable_rename,[status(thm)],[20]) ).

fof(22,negated_conjecture,
    ! [X4] : ~ big_h(esk3_0,X4),
    inference(skolemize,[status(esa)],[21]) ).

cnf(23,negated_conjecture,
    ~ big_h(esk3_0,X1),
    inference(split_conjunct,[status(thm)],[22]) ).

cnf(24,plain,
    ( big_h(X1,esk1_1(X2))
    | ~ big_g(X1,X2) ),
    inference(spm,[status(thm)],[13,8,theory(equality)]) ).

cnf(28,negated_conjecture,
    ~ big_g(esk3_0,X1),
    inference(spm,[status(thm)],[23,24,theory(equality)]) ).

cnf(30,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[28,8,theory(equality)]) ).

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

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