%------------------------------------------------------------------------------
% File     : Faust---1.0
% Problem  : SET573+3 : TPTP v3.4.2. Released v2.2.0.
% Transfm  : none
% Format   : tptp
% Command  : faust %s

% Computer : art09.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 15:31:23 EDT 2009

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(prove_th12,plain,
    ( member(b,c)
    & disjoint(c,d)
    & member(b,d) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET573+3.tptp',unknown),
    [] ).

cnf(170908592,plain,
    disjoint(c,d),
    inference(rewrite,[status(thm)],[prove_th12]),
    [] ).

fof(disjoint_defn,plain,
    ! [A,B] :
      ( ( ~ disjoint(A,B)
        | ~ intersect(A,B) )
      & ( disjoint(A,B)
        | intersect(A,B) ) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET573+3.tptp',unknown),
    [] ).

cnf(170844472,plain,
    ( ~ disjoint(A,B)
    | ~ intersect(A,B) ),
    inference(rewrite,[status(thm)],[disjoint_defn]),
    [] ).

fof(intersect_defn,plain,
    ! [A,B,D] :
      ( ( member(d_nn_1(A,B),B)
        | ~ intersect(A,B) )
      & ( member(d_nn_1(A,B),A)
        | ~ intersect(A,B) )
      & ( intersect(A,B)
        | ~ member(D,A)
        | ~ member(D,B) ) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET573+3.tptp',unknown),
    [] ).

cnf(170819944,plain,
    ( intersect(A,B)
    | ~ member(D,A)
    | ~ member(D,B) ),
    inference(rewrite,[status(thm)],[intersect_defn]),
    [] ).

cnf(170901360,plain,
    member(b,d),
    inference(rewrite,[status(thm)],[prove_th12]),
    [] ).

cnf(183979112,plain,
    ( intersect(A,d)
    | ~ member(b,A) ),
    inference(resolution,[status(thm)],[170819944,170901360]),
    [] ).

cnf(170915896,plain,
    member(b,c),
    inference(rewrite,[status(thm)],[prove_th12]),
    [] ).

cnf(184000304,plain,
    intersect(c,d),
    inference(resolution,[status(thm)],[183979112,170915896]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(forward_subsumption_resolution__resolution,[status(thm)],[170908592,170844472,184000304]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(prove_th12,plain,((member(b,c)&disjoint(c,d)&member(b,d))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET573+3.tptp',unknown),[]).
% 
% cnf(170908592,plain,(disjoint(c,d)),inference(rewrite,[status(thm)],[prove_th12]),[]).
% 
% fof(disjoint_defn,plain,(((~disjoint(A,B)|~intersect(A,B))&(disjoint(A,B)|intersect(A,B)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET573+3.tptp',unknown),[]).
% 
% cnf(170844472,plain,(~disjoint(A,B)|~intersect(A,B)),inference(rewrite,[status(thm)],[disjoint_defn]),[]).
% 
% fof(intersect_defn,plain,(((member(d_nn_1(A,B),B)|~intersect(A,B))&(member(d_nn_1(A,B),A)|~intersect(A,B))&(intersect(A,B)|~member(D,A)|~member(D,B)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET573+3.tptp',unknown),[]).
% 
% cnf(170819944,plain,(intersect(A,B)|~member(D,A)|~member(D,B)),inference(rewrite,[status(thm)],[intersect_defn]),[]).
% 
% cnf(170901360,plain,(member(b,d)),inference(rewrite,[status(thm)],[prove_th12]),[]).
% 
% cnf(183979112,plain,(intersect(A,d)|~member(b,A)),inference(resolution,[status(thm)],[170819944,170901360]),[]).
% 
% cnf(170915896,plain,(member(b,c)),inference(rewrite,[status(thm)],[prove_th12]),[]).
% 
% cnf(184000304,plain,(intersect(c,d)),inference(resolution,[status(thm)],[183979112,170915896]),[]).
% 
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__resolution,[status(thm)],[170908592,170844472,184000304]),[]).
% 
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
% 
%------------------------------------------------------------------------------