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

% Computer : art01.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:54 EST 2010

% Result   : Theorem 0.23s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   25 (   6 unt;   0 def)
%            Number of atoms       :   85 (   0 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  100 (  40   ~;  36   |;  20   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   4 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   29 (   9 sgn  12   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ( ? [X1] :
        ( p
        & big_q(X1) )
  <=> ( p
      & ? [X1] : big_q(X1) ) ),
    file('/tmp/tmpZrr8se/sel_SYN358+1.p_1',x2109) ).

fof(2,negated_conjecture,
    ~ ( ? [X1] :
          ( p
          & big_q(X1) )
    <=> ( p
        & ? [X1] : big_q(X1) ) ),
    inference(assume_negation,[status(cth)],[1]) ).

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

fof(4,negated_conjecture,
    ( ( ! [X2] :
          ( ~ p
          | ~ big_q(X2) )
      | ~ p
      | ! [X3] : ~ big_q(X3) )
    & ( ? [X4] :
          ( p
          & big_q(X4) )
      | ( p
        & ? [X5] : big_q(X5) ) ) ),
    inference(variable_rename,[status(thm)],[3]) ).

fof(5,negated_conjecture,
    ( ( ! [X2] :
          ( ~ p
          | ~ big_q(X2) )
      | ~ p
      | ! [X3] : ~ big_q(X3) )
    & ( ( p
        & big_q(esk1_0) )
      | ( p
        & big_q(esk2_0) ) ) ),
    inference(skolemize,[status(esa)],[4]) ).

fof(6,negated_conjecture,
    ! [X2,X3] :
      ( ( ~ big_q(X3)
        | ~ p
        | ~ p
        | ~ big_q(X2) )
      & ( ( p
          & big_q(esk1_0) )
        | ( p
          & big_q(esk2_0) ) ) ),
    inference(shift_quantors,[status(thm)],[5]) ).

fof(7,negated_conjecture,
    ! [X2,X3] :
      ( ( ~ big_q(X3)
        | ~ p
        | ~ p
        | ~ big_q(X2) )
      & ( p
        | p )
      & ( big_q(esk2_0)
        | p )
      & ( p
        | big_q(esk1_0) )
      & ( big_q(esk2_0)
        | big_q(esk1_0) ) ),
    inference(distribute,[status(thm)],[6]) ).

cnf(8,negated_conjecture,
    ( big_q(esk1_0)
    | big_q(esk2_0) ),
    inference(split_conjunct,[status(thm)],[7]) ).

cnf(11,negated_conjecture,
    ( p
    | p ),
    inference(split_conjunct,[status(thm)],[7]) ).

cnf(12,negated_conjecture,
    ( ~ big_q(X1)
    | ~ p
    | ~ p
    | ~ big_q(X2) ),
    inference(split_conjunct,[status(thm)],[7]) ).

cnf(15,negated_conjecture,
    ( $false
    | ~ big_q(X2)
    | ~ big_q(X1) ),
    inference(rw,[status(thm)],[12,11,theory(equality)]) ).

cnf(16,negated_conjecture,
    ( ~ big_q(X2)
    | ~ big_q(X1) ),
    inference(cn,[status(thm)],[15,theory(equality)]) ).

fof(17,plain,
    ( ~ epred1_0
  <=> ! [X2] : ~ big_q(X2) ),
    introduced(definition),
    [split] ).

cnf(18,plain,
    ( epred1_0
    | ~ big_q(X2) ),
    inference(split_equiv,[status(thm)],[17]) ).

fof(19,plain,
    ( ~ epred2_0
  <=> ! [X1] : ~ big_q(X1) ),
    introduced(definition),
    [split] ).

cnf(20,plain,
    ( epred2_0
    | ~ big_q(X1) ),
    inference(split_equiv,[status(thm)],[19]) ).

cnf(21,negated_conjecture,
    ( ~ epred2_0
    | ~ epred1_0 ),
    inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[16,17,theory(equality)]),19,theory(equality)]),
    [split] ).

cnf(22,negated_conjecture,
    ( epred1_0
    | big_q(esk1_0) ),
    inference(spm,[status(thm)],[18,8,theory(equality)]) ).

cnf(23,negated_conjecture,
    epred1_0,
    inference(csr,[status(thm)],[22,18]) ).

cnf(25,negated_conjecture,
    ( ~ epred2_0
    | $false ),
    inference(rw,[status(thm)],[21,23,theory(equality)]) ).

cnf(26,negated_conjecture,
    ~ epred2_0,
    inference(cn,[status(thm)],[25,theory(equality)]) ).

cnf(27,negated_conjecture,
    ~ big_q(X1),
    inference(sr,[status(thm)],[20,26,theory(equality)]) ).

cnf(28,negated_conjecture,
    big_q(esk1_0),
    inference(sr,[status(thm)],[8,27,theory(equality)]) ).

cnf(29,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[28,27,theory(equality)]) ).

cnf(30,negated_conjecture,
    $false,
    29,
    [proof] ).

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