%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SYN376+1 : TPTP v5.0.0. Bugfixed v2.1.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:18:11 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ( ? [X1] :
      ! [X2] :
        ( big_p(X2)
      <=> big_p(X1) )
   => ( ! [X1] : big_p(X1)
      | ! [X1] : ~ big_p(X1) ) ),
    file('/tmp/tmpF7dtpe/sel_SYN376+1.p_1',x2127) ).

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

fof(3,negated_conjecture,
    ~ ( ? [X1] :
        ! [X2] :
          ( big_p(X2)
        <=> big_p(X1) )
     => ( ! [X1] : big_p(X1)
        | ! [X1] : ~ big_p(X1) ) ),
    inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).

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

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

fof(6,negated_conjecture,
    ( ! [X4] :
        ( ( ~ big_p(X4)
          | big_p(esk1_0) )
        & ( ~ big_p(esk1_0)
          | big_p(X4) ) )
    & ~ big_p(esk2_0)
    & big_p(esk3_0) ),
    inference(skolemize,[status(esa)],[5]) ).

fof(7,negated_conjecture,
    ! [X4] :
      ( ( ~ big_p(X4)
        | big_p(esk1_0) )
      & ( ~ big_p(esk1_0)
        | big_p(X4) )
      & ~ big_p(esk2_0)
      & big_p(esk3_0) ),
    inference(shift_quantors,[status(thm)],[6]) ).

cnf(8,negated_conjecture,
    big_p(esk3_0),
    inference(split_conjunct,[status(thm)],[7]) ).

cnf(9,negated_conjecture,
    ~ big_p(esk2_0),
    inference(split_conjunct,[status(thm)],[7]) ).

cnf(10,negated_conjecture,
    ( big_p(X1)
    | ~ big_p(esk1_0) ),
    inference(split_conjunct,[status(thm)],[7]) ).

cnf(11,negated_conjecture,
    ( big_p(esk1_0)
    | ~ big_p(X1) ),
    inference(split_conjunct,[status(thm)],[7]) ).

cnf(12,negated_conjecture,
    big_p(esk1_0),
    inference(spm,[status(thm)],[11,8,theory(equality)]) ).

cnf(14,negated_conjecture,
    ( big_p(X1)
    | $false ),
    inference(rw,[status(thm)],[10,12,theory(equality)]) ).

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

cnf(18,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[9,15,theory(equality)]) ).

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

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

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