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

% Computer : art01.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:14:29 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ? [X1] :
    ! [X2,X3] :
      ( ( ( big_f(X2,X3)
         => ( big_g(X2)
           => big_h(X1) ) )
       => big_f(X1,X1) )
     => ( ( ( big_f(X3,X1)
           => big_g(X1) )
         => big_h(X3) )
       => ( big_f(X1,X2)
         => big_f(X3,X3) ) ) ),
    file('/tmp/tmpp-Wool/sel_SYN326+1.p_1',church_46_12_1) ).

fof(2,negated_conjecture,
    ~ ? [X1] :
      ! [X2,X3] :
        ( ( ( big_f(X2,X3)
           => ( big_g(X2)
             => big_h(X1) ) )
         => big_f(X1,X1) )
       => ( ( ( big_f(X3,X1)
             => big_g(X1) )
           => big_h(X3) )
         => ( big_f(X1,X2)
           => big_f(X3,X3) ) ) ),
    inference(assume_negation,[status(cth)],[1]) ).

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

fof(4,negated_conjecture,
    ! [X4] :
    ? [X5,X6] :
      ( ( ( big_f(X5,X6)
          & big_g(X5)
          & ~ big_h(X4) )
        | big_f(X4,X4) )
      & ( ( big_f(X6,X4)
          & ~ big_g(X4) )
        | big_h(X6) )
      & big_f(X4,X5)
      & ~ big_f(X6,X6) ),
    inference(variable_rename,[status(thm)],[3]) ).

fof(5,negated_conjecture,
    ! [X4] :
      ( ( ( big_f(esk1_1(X4),esk2_1(X4))
          & big_g(esk1_1(X4))
          & ~ big_h(X4) )
        | big_f(X4,X4) )
      & ( ( big_f(esk2_1(X4),X4)
          & ~ big_g(X4) )
        | big_h(esk2_1(X4)) )
      & big_f(X4,esk1_1(X4))
      & ~ big_f(esk2_1(X4),esk2_1(X4)) ),
    inference(skolemize,[status(esa)],[4]) ).

fof(6,negated_conjecture,
    ! [X4] :
      ( ( big_f(esk1_1(X4),esk2_1(X4))
        | big_f(X4,X4) )
      & ( big_g(esk1_1(X4))
        | big_f(X4,X4) )
      & ( ~ big_h(X4)
        | big_f(X4,X4) )
      & ( big_f(esk2_1(X4),X4)
        | big_h(esk2_1(X4)) )
      & ( ~ big_g(X4)
        | big_h(esk2_1(X4)) )
      & big_f(X4,esk1_1(X4))
      & ~ big_f(esk2_1(X4),esk2_1(X4)) ),
    inference(distribute,[status(thm)],[5]) ).

cnf(7,negated_conjecture,
    ~ big_f(esk2_1(X1),esk2_1(X1)),
    inference(split_conjunct,[status(thm)],[6]) ).

cnf(9,negated_conjecture,
    ( big_h(esk2_1(X1))
    | ~ big_g(X1) ),
    inference(split_conjunct,[status(thm)],[6]) ).

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

cnf(12,negated_conjecture,
    ( big_f(X1,X1)
    | big_g(esk1_1(X1)) ),
    inference(split_conjunct,[status(thm)],[6]) ).

cnf(14,negated_conjecture,
    ( big_f(esk2_1(X1),esk2_1(X1))
    | ~ big_g(X1) ),
    inference(spm,[status(thm)],[11,9,theory(equality)]) ).

cnf(15,negated_conjecture,
    big_g(esk1_1(esk2_1(X1))),
    inference(spm,[status(thm)],[7,12,theory(equality)]) ).

cnf(18,negated_conjecture,
    ~ big_g(X1),
    inference(sr,[status(thm)],[14,7,theory(equality)]) ).

cnf(20,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[15,18,theory(equality)]) ).

cnf(21,negated_conjecture,
    $false,
    20,
    [proof] ).

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