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

% Computer : art05.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:28 EST 2010

% Result   : Theorem 0.17s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   16 (   5 unt;   0 def)
%            Number of atoms       :   44 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   48 (  20   ~;   9   |;  13   &)
%                                         (   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    :    1 (   1 usr;   0 con; 2-2 aty)
%            Number of variables   :   38 (   2 sgn  21   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ( ! [X1] : ~ big_r(X1,X1)
   => ? [X2,X3] :
        ( ~ big_r(X2,X3)
        & ( big_q(X3,X2)
         => ! [X4] : big_q(X4,X4) ) ) ),
    file('/tmp/tmp_KLJXg/sel_SYN380+1.p_1',x2132) ).

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

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

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

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

fof(6,negated_conjecture,
    ( ! [X5] : ~ big_r(X5,X5)
    & ! [X6,X7] :
        ( big_r(X6,X7)
        | ( big_q(X7,X6)
          & ~ big_q(esk1_2(X6,X7),esk1_2(X6,X7)) ) ) ),
    inference(skolemize,[status(esa)],[5]) ).

fof(7,negated_conjecture,
    ! [X5,X6,X7] :
      ( ( big_r(X6,X7)
        | ( big_q(X7,X6)
          & ~ big_q(esk1_2(X6,X7),esk1_2(X6,X7)) ) )
      & ~ big_r(X5,X5) ),
    inference(shift_quantors,[status(thm)],[6]) ).

fof(8,negated_conjecture,
    ! [X5,X6,X7] :
      ( ( big_q(X7,X6)
        | big_r(X6,X7) )
      & ( ~ big_q(esk1_2(X6,X7),esk1_2(X6,X7))
        | big_r(X6,X7) )
      & ~ big_r(X5,X5) ),
    inference(distribute,[status(thm)],[7]) ).

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

cnf(10,negated_conjecture,
    ( big_r(X1,X2)
    | ~ big_q(esk1_2(X1,X2),esk1_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[8]) ).

cnf(11,negated_conjecture,
    ( big_r(X1,X2)
    | big_q(X2,X1) ),
    inference(split_conjunct,[status(thm)],[8]) ).

cnf(12,negated_conjecture,
    ( big_r(X1,X2)
    | big_r(esk1_2(X1,X2),esk1_2(X1,X2)) ),
    inference(spm,[status(thm)],[10,11,theory(equality)]) ).

cnf(13,negated_conjecture,
    big_r(X1,X2),
    inference(sr,[status(thm)],[12,9,theory(equality)]) ).

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

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

cnf(16,negated_conjecture,
    $false,
    15,
    [proof] ).

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