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

% Computer : art01.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:54 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 (   3 unt;   0 def)
%            Number of atoms       :   23 (   0 equ)
%            Maximal formula atoms :   18 (   4 avg)
%            Number of connectives :   28 (  10   ~;  10   |;   8   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 2-2 aty)
%            Number of variables   :    7 (   5 sgn   2   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(kalish201,plain,
    ! [B,A] :
      ( ( f(B)
        | ~ f(A) )
      & ( ~ g(z(A,B))
        | ~ f(A) )
      & ( g(A)
        | ~ f(A) )
      & ( f(B)
        | f(B) )
      & ( ~ g(z(A,B))
        | f(B) )
      & ( g(A)
        | f(B) )
      & ( f(B)
        | ~ g(z(A,B)) )
      & ( ~ g(z(A,B))
        | ~ g(z(A,B)) )
      & ( g(A)
        | ~ g(z(A,B)) ) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN394+1.tptp',unknown),
    [] ).

cnf(163829528,plain,
    ( g(A)
    | f(B) ),
    inference(rewrite,[status(thm)],[kalish201]),
    [] ).

cnf(163838112,plain,
    g(A),
    inference(rewrite__forward_subsumption_resolution,[status(thm)],[kalish201,163829528]),
    [] ).

cnf(163825000,plain,
    ~ g(z(A,B)),
    inference(rewrite,[status(thm)],[kalish201]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(resolution,[status(thm)],[163838112,163825000]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(kalish201,plain,(((f(B)|~f(A))&(~g(z(A,B))|~f(A))&(g(A)|~f(A))&(f(B)|f(B))&(~g(z(A,B))|f(B))&(g(A)|f(B))&(f(B)|~g(z(A,B)))&(~g(z(A,B))|~g(z(A,B)))&(g(A)|~g(z(A,B))))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN394+1.tptp',unknown),[]).
% 
% cnf(163829528,plain,(g(A)|f(B)),inference(rewrite,[status(thm)],[kalish201]),[]).
% 
% cnf(163838112,plain,(g(A)),inference(rewrite__forward_subsumption_resolution,[status(thm)],[kalish201,163829528]),[]).
% 
% cnf(163825000,plain,(~g(z(A,B))),inference(rewrite,[status(thm)],[kalish201]),[]).
% 
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[163838112,163825000]),[]).
% 
% END OF PROOF SEQUENCE
% 
%------------------------------------------------------------------------------