%------------------------------------------------------------------------------
% File     : Faust---1.0
% Problem  : SYN372+1 : TPTP v3.4.2. Released v2.0.0.
% Transfm  : none
% Format   : tptp
% Command  : faust %s

% Computer : art03.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 1003MB
% OS       : Linux 2.6.17-1.2142_FC4
% CPULimit : 600s
% DateTime : Wed May  6 17:51:56 EDT 2009

% Result   : Theorem 0.1s
% Output   : Refutation 0.1s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    5 (   4 unt;   0 def)
%            Number of atoms       :   22 (   0 equ)
%            Maximal formula atoms :   18 (   4 avg)
%            Number of connectives :   27 (  10   ~;   9   |;   8   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :    3 (   2 sgn   1   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(x2123,plain,
    ! [C] :
      ( ( big_p(C)
        | ~ big_p(y_nn_1) )
      & ( ~ big_q(C)
        | ~ big_p(y_nn_1) )
      & ( big_q(x)
        | ~ big_p(y_nn_1) )
      & ( big_p(C)
        | big_p(C) )
      & ( ~ big_q(C)
        | big_p(C) )
      & ( big_q(x)
        | big_p(C) )
      & ( big_p(C)
        | ~ big_q(C) )
      & ( ~ big_q(C)
        | ~ big_q(C) )
      & ( big_q(x)
        | ~ big_q(C) ) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN372+1.tptp',unknown),
    [] ).

cnf(142906752,plain,
    big_p(C),
    inference(rewrite,[status(thm)],[x2123]),
    [] ).

cnf(142910472,plain,
    big_q(x),
    inference(rewrite__forward_subsumption_resolution,[status(thm)],[x2123,142906752]),
    [] ).

cnf(142894256,plain,
    ~ big_q(C),
    inference(rewrite,[status(thm)],[x2123]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(resolution,[status(thm)],[142910472,142894256]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(x2123,plain,(((big_p(C)|~big_p(y_nn_1))&(~big_q(C)|~big_p(y_nn_1))&(big_q(x)|~big_p(y_nn_1))&(big_p(C)|big_p(C))&(~big_q(C)|big_p(C))&(big_q(x)|big_p(C))&(big_p(C)|~big_q(C))&(~big_q(C)|~big_q(C))&(big_q(x)|~big_q(C)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN372+1.tptp',unknown),[]).
% 
% cnf(142906752,plain,(big_p(C)),inference(rewrite,[status(thm)],[x2123]),[]).
% 
% cnf(142910472,plain,(big_q(x)),inference(rewrite__forward_subsumption_resolution,[status(thm)],[x2123,142906752]),[]).
% 
% cnf(142894256,plain,(~big_q(C)),inference(rewrite,[status(thm)],[x2123]),[]).
% 
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[142910472,142894256]),[]).
% 
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
% 
%------------------------------------------------------------------------------