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

% Computer : art11.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory   : 2006MB
% OS       : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 26 13:18:06 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ? [X1] :
    ! [X2] :
      ( ( big_f(X1)
      <=> p )
     => ( big_f(X2)
      <=> p ) ),
    file('/tmp/tmpQsDnUL/sel_SYN315+1.p_1',church_46_2_1) ).

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

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

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

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

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

cnf(7,negated_conjecture,
    ( ~ p
    | ~ big_f(esk1_1(X1)) ),
    inference(split_conjunct,[status(thm)],[5]) ).

cnf(8,negated_conjecture,
    ( big_f(X1)
    | ~ p ),
    inference(split_conjunct,[status(thm)],[5]) ).

cnf(9,negated_conjecture,
    ( p
    | ~ big_f(X1) ),
    inference(split_conjunct,[status(thm)],[5]) ).

cnf(11,negated_conjecture,
    p,
    inference(csr,[status(thm)],[6,9]) ).

cnf(13,negated_conjecture,
    ( big_f(X1)
    | $false ),
    inference(rw,[status(thm)],[8,11,theory(equality)]) ).

cnf(14,negated_conjecture,
    big_f(X1),
    inference(cn,[status(thm)],[13,theory(equality)]) ).

cnf(15,negated_conjecture,
    ( $false
    | ~ big_f(esk1_1(X1)) ),
    inference(rw,[status(thm)],[7,11,theory(equality)]) ).

cnf(16,negated_conjecture,
    ~ big_f(esk1_1(X1)),
    inference(cn,[status(thm)],[15,theory(equality)]) ).

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

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

cnf(19,negated_conjecture,
    $false,
    18,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
%   from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN315+1.p
% --creating new selector for []
% -running prover on /tmp/tmpQsDnUL/sel_SYN315+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN315+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN315+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN315+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
% 
%------------------------------------------------------------------------------