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

% Computer : art04.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:03 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ( ( ! [X1] :
          ( ? [X2] : big_p(X1,X2)
         => ! [X2] : big_q(X1,X2) )
      & ! [X3] :
        ? [X2] : big_p(X3,X2) )
   => ! [X2,X1] : big_q(X1,X2) ),
    file('/tmp/tmpDgokxE/sel_SYN360+1.p_1',x2111) ).

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

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

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

fof(5,negated_conjecture,
    ( ! [X4] :
        ( ! [X5] : ~ big_p(X4,X5)
        | ! [X6] : big_q(X4,X6) )
    & ! [X7] : big_p(X7,esk1_1(X7))
    & ~ big_q(esk3_0,esk2_0) ),
    inference(skolemize,[status(esa)],[4]) ).

fof(6,negated_conjecture,
    ! [X4,X5,X6,X7] :
      ( big_p(X7,esk1_1(X7))
      & ( big_q(X4,X6)
        | ~ big_p(X4,X5) )
      & ~ big_q(esk3_0,esk2_0) ),
    inference(shift_quantors,[status(thm)],[5]) ).

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

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

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

cnf(10,negated_conjecture,
    big_q(X1,X2),
    inference(spm,[status(thm)],[8,9,theory(equality)]) ).

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

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

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

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