%------------------------------------------------------------------------------
% File     : Faust---1.0
% Problem  : SET062+3 : TPTP v3.4.2. Released v2.2.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 15:26:20 EDT 2009

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(subset_defn,plain,
    ! [A,B,C] :
      ( ( ~ subset(A,B)
        | ~ member(C,A)
        | member(C,B) )
      & ( ~ member(d(A,B,C),B)
        | subset(A,B) )
      & ( member(d(A,B,C),A)
        | subset(A,B) ) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET062+3.tptp',unknown),
    [] ).

cnf(144311704,plain,
    ( member(d(A,B,C),A)
    | subset(A,B) ),
    inference(rewrite,[status(thm)],[subset_defn]),
    [] ).

fof(empty_set_defn,plain,
    ! [A] : ~ member(A,empty_set),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET062+3.tptp',unknown),
    [] ).

cnf(144305120,plain,
    ~ member(A,empty_set),
    inference(rewrite,[status(thm)],[empty_set_defn]),
    [] ).

cnf(152163744,plain,
    subset(empty_set,A),
    inference(resolution,[status(thm)],[144311704,144305120]),
    [] ).

fof(prove_empty_set_subset,plain,
    ~ subset(empty_set,b),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET062+3.tptp',unknown),
    [] ).

cnf(144374048,plain,
    ~ subset(empty_set,b),
    inference(rewrite,[status(thm)],[prove_empty_set_subset]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(resolution,[status(thm)],[152163744,144374048]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(subset_defn,plain,(((~subset(A,B)|~member(C,A)|member(C,B))&(~member(d(A,B,C),B)|subset(A,B))&(member(d(A,B,C),A)|subset(A,B)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET062+3.tptp',unknown),[]).
% 
% cnf(144311704,plain,(member(d(A,B,C),A)|subset(A,B)),inference(rewrite,[status(thm)],[subset_defn]),[]).
% 
% fof(empty_set_defn,plain,(~member(A,empty_set)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET062+3.tptp',unknown),[]).
% 
% cnf(144305120,plain,(~member(A,empty_set)),inference(rewrite,[status(thm)],[empty_set_defn]),[]).
% 
% cnf(152163744,plain,(subset(empty_set,A)),inference(resolution,[status(thm)],[144311704,144305120]),[]).
% 
% fof(prove_empty_set_subset,plain,(~subset(empty_set,b)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET062+3.tptp',unknown),[]).
% 
% cnf(144374048,plain,(~subset(empty_set,b)),inference(rewrite,[status(thm)],[prove_empty_set_subset]),[]).
% 
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[152163744,144374048]),[]).
% 
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
% 
%------------------------------------------------------------------------------