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

% Computer : art05.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:52:30 EDT 2009

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(x2136,plain,
    ! [B,C] :
      ( big_p(B,C,z)
      & ~ big_p(u(B,C),B,B) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN384+1.tptp',unknown),
    [] ).

cnf(147302248,plain,
    big_p(B,C,z),
    inference(rewrite,[status(thm)],[x2136]),
    [] ).

cnf(147287592,plain,
    ~ big_p(u(B,C),B,B),
    inference(rewrite,[status(thm)],[x2136]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(resolution,[status(thm)],[147302248,147287592]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(x2136,plain,((big_p(B,C,z)&~big_p(u(B,C),B,B))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN384+1.tptp',unknown),[]).
% 
% cnf(147302248,plain,(big_p(B,C,z)),inference(rewrite,[status(thm)],[x2136]),[]).
% 
% cnf(147287592,plain,(~big_p(u(B,C),B,B)),inference(rewrite,[status(thm)],[x2136]),[]).
% 
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[147302248,147287592]),[]).
% 
% END OF PROOF SEQUENCE
% 
%------------------------------------------------------------------------------