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

% Computer : art07.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:44 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ( ! [X1] :
        ( p
        & f(X1) )
  <=> ( p
      & ! [X2] : f(X2) ) ),
    file('/tmp/tmpG6f2hz/sel_SYN398+1.p_1',kalish215) ).

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

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

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

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

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

fof(7,negated_conjecture,
    ! [X5,X6] :
      ( ( p
        | f(X6) )
      & ( f(X5)
        | f(X6) )
      & ( p
        | p )
      & ( f(X5)
        | p )
      & ( ~ p
        | ~ f(esk1_0)
        | ~ p
        | ~ f(esk2_0) ) ),
    inference(distribute,[status(thm)],[6]) ).

cnf(8,negated_conjecture,
    ( ~ f(esk2_0)
    | ~ p
    | ~ f(esk1_0)
    | ~ p ),
    inference(split_conjunct,[status(thm)],[7]) ).

cnf(10,negated_conjecture,
    ( p
    | p ),
    inference(split_conjunct,[status(thm)],[7]) ).

cnf(11,negated_conjecture,
    ( f(X1)
    | f(X2) ),
    inference(split_conjunct,[status(thm)],[7]) ).

cnf(15,negated_conjecture,
    f(X3),
    inference(ef,[status(thm)],[11,theory(equality)]) ).

cnf(17,negated_conjecture,
    ( $false
    | ~ f(esk1_0)
    | ~ f(esk2_0) ),
    inference(rw,[status(thm)],[8,10,theory(equality)]) ).

cnf(18,negated_conjecture,
    ( ~ f(esk1_0)
    | ~ f(esk2_0) ),
    inference(cn,[status(thm)],[17,theory(equality)]) ).

cnf(21,negated_conjecture,
    ( $false
    | ~ f(esk2_0) ),
    inference(rw,[status(thm)],[18,15,theory(equality)]) ).

cnf(22,negated_conjecture,
    ( $false
    | $false ),
    inference(rw,[status(thm)],[21,15,theory(equality)]) ).

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

cnf(24,negated_conjecture,
    $false,
    23,
    [proof] ).

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