%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SYN362+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:11 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ( ( ! [X1] :
        ? [X2] : big_r(X1,X2)
      & ? [X3] :
        ! [X4] :
          ( big_p(X4)
         => ~ big_r(X3,X4) ) )
   => ? [X4] : ~ big_p(X4) ),
    file('/tmp/tmpQVh6bp/sel_SYN362+1.p_1',x2113) ).

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

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

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

fof(5,negated_conjecture,
    ( ! [X5] :
      ? [X6] : big_r(X5,X6)
    & ? [X7] :
      ! [X8] :
        ( ~ big_p(X8)
        | ~ big_r(X7,X8) )
    & ! [X9] : big_p(X9) ),
    inference(variable_rename,[status(thm)],[4]) ).

fof(6,negated_conjecture,
    ( ! [X5] : big_r(X5,esk1_1(X5))
    & ! [X8] :
        ( ~ big_p(X8)
        | ~ big_r(esk2_0,X8) )
    & ! [X9] : big_p(X9) ),
    inference(skolemize,[status(esa)],[5]) ).

fof(7,negated_conjecture,
    ! [X5,X8,X9] :
      ( big_p(X9)
      & ( ~ big_p(X8)
        | ~ big_r(esk2_0,X8) )
      & big_r(X5,esk1_1(X5)) ),
    inference(shift_quantors,[status(thm)],[6]) ).

cnf(8,negated_conjecture,
    big_r(X1,esk1_1(X1)),
    inference(split_conjunct,[status(thm)],[7]) ).

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

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

cnf(11,negated_conjecture,
    ( $false
    | ~ big_r(esk2_0,X1) ),
    inference(rw,[status(thm)],[9,10,theory(equality)]),
    [unfolding] ).

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

cnf(13,negated_conjecture,
    $false,
    12,
    [proof] ).

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