%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SYN399+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:19:48 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ( ! [X1] :
        ( f(X1)
      <=> p )
   => ( ! [X2] : f(X2)
    <=> p ) ),
    file('/tmp/tmpeB7Tbz/sel_SYN399+1.p_1',kalish223) ).

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

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

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

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

fof(6,negated_conjecture,
    ! [X3,X5] :
      ( ( f(X5)
        | p )
      & ( ~ f(esk1_0)
        | ~ p )
      & ( ~ f(X3)
        | p )
      & ( ~ p
        | f(X3) ) ),
    inference(shift_quantors,[status(thm)],[5]) ).

cnf(7,negated_conjecture,
    ( f(X1)
    | ~ p ),
    inference(split_conjunct,[status(thm)],[6]) ).

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

cnf(9,negated_conjecture,
    ( ~ p
    | ~ f(esk1_0) ),
    inference(split_conjunct,[status(thm)],[6]) ).

cnf(10,negated_conjecture,
    ( p
    | f(X1) ),
    inference(split_conjunct,[status(thm)],[6]) ).

cnf(11,negated_conjecture,
    f(X1),
    inference(csr,[status(thm)],[7,10]) ).

cnf(13,negated_conjecture,
    ( ~ p
    | $false ),
    inference(rw,[status(thm)],[9,11,theory(equality)]) ).

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

cnf(15,negated_conjecture,
    ( p
    | $false ),
    inference(rw,[status(thm)],[8,11,theory(equality)]) ).

cnf(16,negated_conjecture,
    p,
    inference(cn,[status(thm)],[15,theory(equality)]) ).

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

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

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