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

% Result   : Theorem 0.16s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   16 (   6 unt;   0 def)
%            Number of atoms       :   57 (   0 equ)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :   57 (  16   ~;  19   |;  16   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 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   :   46 (   2 sgn  30   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ( ( ! [X1] :
          ( ? [X2] : big_q(X1,X2)
         => big_p(X1) )
      & ! [X3] :
        ? [X4] : big_q(X4,X3)
      & ! [X5,X6] :
          ( big_q(X5,X6)
         => ( big_q(X6,X5)
            | big_q(X6,X6) ) ) )
   => ! [X6] : big_p(X6) ),
    file('/tmp/tmpdMCufK/sel_SYN381+1.p_1',x2133) ).

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

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

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

fof(5,negated_conjecture,
    ( ! [X7] :
        ( ! [X8] : ~ big_q(X7,X8)
        | big_p(X7) )
    & ! [X9] : big_q(esk1_1(X9),X9)
    & ! [X11,X12] :
        ( ~ big_q(X11,X12)
        | big_q(X12,X11)
        | big_q(X12,X12) )
    & ~ big_p(esk2_0) ),
    inference(skolemize,[status(esa)],[4]) ).

fof(6,negated_conjecture,
    ! [X7,X8,X9,X11,X12] :
      ( ( ~ big_q(X11,X12)
        | big_q(X12,X11)
        | big_q(X12,X12) )
      & big_q(esk1_1(X9),X9)
      & ( ~ big_q(X7,X8)
        | big_p(X7) )
      & ~ big_p(esk2_0) ),
    inference(shift_quantors,[status(thm)],[5]) ).

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

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

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

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

cnf(12,negated_conjecture,
    ( big_q(X1,X1)
    | big_q(X1,esk1_1(X1)) ),
    inference(spm,[status(thm)],[10,9,theory(equality)]) ).

cnf(13,negated_conjecture,
    ( big_p(X1)
    | big_q(X1,X1) ),
    inference(spm,[status(thm)],[8,12,theory(equality)]) ).

cnf(16,negated_conjecture,
    big_p(X1),
    inference(csr,[status(thm)],[13,8]) ).

cnf(18,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[7,16,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/SYN381+1.p
% --creating new selector for []
% -running prover on /tmp/tmpdMCufK/sel_SYN381+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN381+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN381+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN381+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
% 
%------------------------------------------------------------------------------