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

% Computer : art10.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:47 EDT 2009

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(prove_extensionality,plain,
    ( subset(b,c)
    & subset(c,b)
    & ~ $equal(c,b) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET583+3.tptp',unknown),
    [] ).

cnf(161400256,plain,
    subset(c,b),
    inference(rewrite,[status(thm)],[prove_extensionality]),
    [] ).

cnf(161407248,plain,
    subset(b,c),
    inference(rewrite,[status(thm)],[prove_extensionality]),
    [] ).

fof(equal_defn,plain,
    ! [B,A] :
      ( ( subset(B,A)
        | ~ $equal(B,A) )
      & ( subset(A,B)
        | ~ $equal(B,A) )
      & ( $equal(B,A)
        | ~ subset(A,B)
        | ~ subset(B,A) ) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET583+3.tptp',unknown),
    [] ).

cnf(161295344,plain,
    ( $equal(B,A)
    | ~ subset(A,B)
    | ~ subset(B,A) ),
    inference(rewrite,[status(thm)],[equal_defn]),
    [] ).

cnf(161392928,plain,
    ~ $equal(c,b),
    inference(rewrite,[status(thm)],[prove_extensionality]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(forward_subsumption_resolution__resolution,[status(thm)],[161400256,161407248,161295344,161392928]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(prove_extensionality,plain,((subset(b,c)&subset(c,b)&~$equal(c,b))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET583+3.tptp',unknown),[]).
% 
% cnf(161400256,plain,(subset(c,b)),inference(rewrite,[status(thm)],[prove_extensionality]),[]).
% 
% cnf(161407248,plain,(subset(b,c)),inference(rewrite,[status(thm)],[prove_extensionality]),[]).
% 
% fof(equal_defn,plain,(((subset(B,A)|~$equal(B,A))&(subset(A,B)|~$equal(B,A))&($equal(B,A)|~subset(A,B)|~subset(B,A)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET583+3.tptp',unknown),[]).
% 
% cnf(161295344,plain,($equal(B,A)|~subset(A,B)|~subset(B,A)),inference(rewrite,[status(thm)],[equal_defn]),[]).
% 
% cnf(161392928,plain,(~$equal(c,b)),inference(rewrite,[status(thm)],[prove_extensionality]),[]).
% 
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__resolution,[status(thm)],[161400256,161407248,161295344,161392928]),[]).
% 
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
% 
%------------------------------------------------------------------------------