%------------------------------------------------------------------------------
% File     : Faust---1.0
% Problem  : SET019+4 : TPTP v3.4.2. Released v2.2.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 15:24:07 EDT 2009

% Result   : Theorem 0.1s
% Output   : Refutation 0.1s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    8 (   5 unt;   0 def)
%            Number of atoms       :   18 (   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 (   2 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(thI02,plain,
    ( subset(a,b)
    & subset(b,a)
    & ~ equal_set(a,b) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET019+4.tptp',unknown),
    [] ).

cnf(168215800,plain,
    subset(a,b),
    inference(rewrite,[status(thm)],[thI02]),
    [] ).

fof(equal_set,plain,
    ! [B,A] :
      ( ( subset(B,A)
        | ~ equal_set(A,B) )
      & ( subset(A,B)
        | ~ equal_set(A,B) )
      & ( equal_set(A,B)
        | ~ subset(A,B)
        | ~ subset(B,A) ) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET019+4.tptp',unknown),
    [] ).

cnf(167963024,plain,
    ( equal_set(A,B)
    | ~ subset(A,B)
    | ~ subset(B,A) ),
    inference(rewrite,[status(thm)],[equal_set]),
    [] ).

cnf(168208184,plain,
    subset(b,a),
    inference(rewrite,[status(thm)],[thI02]),
    [] ).

cnf(181389256,plain,
    equal_set(a,b),
    inference(forward_subsumption_resolution__resolution,[status(thm)],[168215800,167963024,168208184]),
    [] ).

cnf(168200464,plain,
    ~ equal_set(a,b),
    inference(rewrite,[status(thm)],[thI02]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(resolution,[status(thm)],[181389256,168200464]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(thI02,plain,((subset(a,b)&subset(b,a)&~equal_set(a,b))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET019+4.tptp',unknown),[]).
% 
% cnf(168215800,plain,(subset(a,b)),inference(rewrite,[status(thm)],[thI02]),[]).
% 
% fof(equal_set,plain,(((subset(B,A)|~equal_set(A,B))&(subset(A,B)|~equal_set(A,B))&(equal_set(A,B)|~subset(A,B)|~subset(B,A)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET019+4.tptp',unknown),[]).
% 
% cnf(167963024,plain,(equal_set(A,B)|~subset(A,B)|~subset(B,A)),inference(rewrite,[status(thm)],[equal_set]),[]).
% 
% cnf(168208184,plain,(subset(b,a)),inference(rewrite,[status(thm)],[thI02]),[]).
% 
% cnf(181389256,plain,(equal_set(a,b)),inference(forward_subsumption_resolution__resolution,[status(thm)],[168215800,167963024,168208184]),[]).
% 
% cnf(168200464,plain,(~equal_set(a,b)),inference(rewrite,[status(thm)],[thI02]),[]).
% 
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[181389256,168200464]),[]).
% 
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
% 
%------------------------------------------------------------------------------