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

% Computer : art06.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:37 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ? [X1] :
    ! [X2] :
      ( big_p(X1)
     => big_p(X2) ),
    file('/tmp/tmpoTXgCc/sel_SYN368+1.p_1',x2119) ).

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

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

fof(4,negated_conjecture,
    ! [X3] :
    ? [X4] :
      ( big_p(X3)
      & ~ big_p(X4) ),
    inference(variable_rename,[status(thm)],[3]) ).

fof(5,negated_conjecture,
    ! [X3] :
      ( big_p(X3)
      & ~ big_p(esk1_1(X3)) ),
    inference(skolemize,[status(esa)],[4]) ).

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

cnf(7,negated_conjecture,
    big_p(X1),
    inference(split_conjunct,[status(thm)],[5]) ).

cnf(8,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[6,7,theory(equality)]),
    [unfolding] ).

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

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