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

% Computer : art02.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:16:59 EST 2010

% Result   : Theorem 0.22s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   14 (   4 unt;   0 def)
%            Number of atoms       :   54 (   0 equ)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :   63 (  23   ~;  16   |;  18   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   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   :   45 (   3 sgn  26   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ( ( ? [X1] : big_r(X1)
      & ! [X2] :
          ( big_r(X2)
         => ? [X3] : big_q(X2,X3) )
      & ! [X1,X2] :
          ( big_q(X1,X2)
         => big_q(X1,X1) ) )
   => ? [X1,X2] :
        ( big_q(X1,X2)
        & big_r(X2) ) ),
    file('/tmp/tmpWASW8R/sel_SYN359+1.p_1',x2110) ).

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

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

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

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

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

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

cnf(8,negated_conjecture,
    ( big_q(X1,esk2_1(X1))
    | ~ big_r(X1) ),
    inference(split_conjunct,[status(thm)],[6]) ).

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

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

cnf(12,negated_conjecture,
    ( big_q(X1,X1)
    | ~ big_r(X1) ),
    inference(spm,[status(thm)],[9,8,theory(equality)]) ).

cnf(13,negated_conjecture,
    ~ big_r(X1),
    inference(csr,[status(thm)],[12,10]) ).

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

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

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