%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : SYN366+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:17:28 EST 2010

% Result   : Theorem 0.17s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   15 (   7 unt;   0 def)
%            Number of atoms       :   63 (   0 equ)
%            Maximal formula atoms :   10 (   4 avg)
%            Number of connectives :   72 (  24   ~;  18   |;  22   &)
%                                         (   4 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   38 (   3 sgn  26   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ( ( ! [X1,X2] :
          ( big_r(X1,X1)
        <=> big_r(X1,X2) )
      & ! [X3,X4] :
          ( big_r(X3,X3)
        <=> big_r(X4,X3) ) )
   => ( ? [X5] : big_r(X5,X5)
     => ! [X6] : big_r(X6,X6) ) ),
    file('/tmp/tmpHo6XXK/sel_SYN366+1.p_1',x2117) ).

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

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

fof(4,negated_conjecture,
    ( ! [X7,X8] :
        ( ( ~ big_r(X7,X7)
          | big_r(X7,X8) )
        & ( ~ big_r(X7,X8)
          | big_r(X7,X7) ) )
    & ! [X9,X10] :
        ( ( ~ big_r(X9,X9)
          | big_r(X10,X9) )
        & ( ~ big_r(X10,X9)
          | big_r(X9,X9) ) )
    & ? [X11] : big_r(X11,X11)
    & ? [X12] : ~ big_r(X12,X12) ),
    inference(variable_rename,[status(thm)],[3]) ).

fof(5,negated_conjecture,
    ( ! [X7,X8] :
        ( ( ~ big_r(X7,X7)
          | big_r(X7,X8) )
        & ( ~ big_r(X7,X8)
          | big_r(X7,X7) ) )
    & ! [X9,X10] :
        ( ( ~ big_r(X9,X9)
          | big_r(X10,X9) )
        & ( ~ big_r(X10,X9)
          | big_r(X9,X9) ) )
    & big_r(esk1_0,esk1_0)
    & ~ big_r(esk2_0,esk2_0) ),
    inference(skolemize,[status(esa)],[4]) ).

fof(6,negated_conjecture,
    ! [X7,X8,X9,X10] :
      ( ( ~ big_r(X9,X9)
        | big_r(X10,X9) )
      & ( ~ big_r(X10,X9)
        | big_r(X9,X9) )
      & ( ~ big_r(X7,X7)
        | big_r(X7,X8) )
      & ( ~ big_r(X7,X8)
        | big_r(X7,X7) )
      & big_r(esk1_0,esk1_0)
      & ~ big_r(esk2_0,esk2_0) ),
    inference(shift_quantors,[status(thm)],[5]) ).

cnf(7,negated_conjecture,
    ~ big_r(esk2_0,esk2_0),
    inference(split_conjunct,[status(thm)],[6]) ).

cnf(8,negated_conjecture,
    big_r(esk1_0,esk1_0),
    inference(split_conjunct,[status(thm)],[6]) ).

cnf(9,negated_conjecture,
    ( big_r(X1,X1)
    | ~ big_r(X1,X2) ),
    inference(split_conjunct,[status(thm)],[6]) ).

cnf(12,negated_conjecture,
    ( big_r(X1,X2)
    | ~ big_r(X2,X2) ),
    inference(split_conjunct,[status(thm)],[6]) ).

cnf(13,negated_conjecture,
    big_r(X1,esk1_0),
    inference(spm,[status(thm)],[12,8,theory(equality)]) ).

cnf(22,negated_conjecture,
    big_r(X1,X1),
    inference(spm,[status(thm)],[9,13,theory(equality)]) ).

cnf(33,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[7,22,theory(equality)]) ).

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

cnf(35,negated_conjecture,
    $false,
    34,
    [proof] ).

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