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

% Computer : art02.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:17:45 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ? [X1] :
    ! [X2] :
    ? [X3] :
      ( ( big_p(a,X2,h(X2))
        | big_p(X1,X2,f(X2)) )
     => big_p(X1,X2,X3) ),
    file('/tmp/tmpokhilK/sel_SYN370+1.p_1',x2121) ).

fof(2,negated_conjecture,
    ~ ? [X1] :
      ! [X2] :
      ? [X3] :
        ( ( big_p(a,X2,h(X2))
          | big_p(X1,X2,f(X2)) )
       => big_p(X1,X2,X3) ),
    inference(assume_negation,[status(cth)],[1]) ).

fof(3,negated_conjecture,
    ! [X1] :
    ? [X2] :
    ! [X3] :
      ( ( big_p(a,X2,h(X2))
        | big_p(X1,X2,f(X2)) )
      & ~ big_p(X1,X2,X3) ),
    inference(fof_nnf,[status(thm)],[2]) ).

fof(4,negated_conjecture,
    ! [X4] :
    ? [X5] :
    ! [X6] :
      ( ( big_p(a,X5,h(X5))
        | big_p(X4,X5,f(X5)) )
      & ~ big_p(X4,X5,X6) ),
    inference(variable_rename,[status(thm)],[3]) ).

fof(5,negated_conjecture,
    ! [X4,X6] :
      ( ( big_p(a,esk1_1(X4),h(esk1_1(X4)))
        | big_p(X4,esk1_1(X4),f(esk1_1(X4))) )
      & ~ big_p(X4,esk1_1(X4),X6) ),
    inference(skolemize,[status(esa)],[4]) ).

cnf(6,negated_conjecture,
    ~ big_p(X1,esk1_1(X1),X2),
    inference(split_conjunct,[status(thm)],[5]) ).

cnf(7,negated_conjecture,
    ( big_p(X1,esk1_1(X1),f(esk1_1(X1)))
    | big_p(a,esk1_1(X1),h(esk1_1(X1))) ),
    inference(split_conjunct,[status(thm)],[5]) ).

cnf(8,negated_conjecture,
    big_p(a,esk1_1(X1),h(esk1_1(X1))),
    inference(sr,[status(thm)],[7,6,theory(equality)]) ).

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

cnf(10,negated_conjecture,
    $false,
    9,
    [proof] ).

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