%------------------------------------------------------------------------------
% File     : Faust---1.0
% Problem  : SET002+3 : 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:22:31 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       :   10 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    6 (   4   ~;   2   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-2 aty)
%            Number of variables   :    7 (   0 sgn   3   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(subset_union,plain,
    ! [A,B] :
      ( ~ subset(A,B)
      | $equal(union(A,B),B) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET002+3.tptp',unknown),
    [] ).

cnf(145784904,plain,
    ( ~ subset(A,B)
    | $equal(union(A,B),B) ),
    inference(rewrite,[status(thm)],[subset_union]),
    [] ).

fof(reflexivity_of_subset,plain,
    ! [A] : subset(A,A),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET002+3.tptp',unknown),
    [] ).

cnf(145888464,plain,
    subset(A,A),
    inference(rewrite,[status(thm)],[reflexivity_of_subset]),
    [] ).

cnf(153722112,plain,
    $equal(union(A,A),A),
    inference(resolution,[status(thm)],[145784904,145888464]),
    [] ).

fof(prove_idempotency_of_union,plain,
    ~ $equal(union(b,b),b),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET002+3.tptp',unknown),
    [] ).

cnf(145949224,plain,
    ~ $equal(union(b,b),b),
    inference(rewrite,[status(thm)],[prove_idempotency_of_union]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(resolution,[status(thm)],[153722112,145949224]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(subset_union,plain,(~subset(A,B)|$equal(union(A,B),B)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET002+3.tptp',unknown),[]).
% 
% cnf(145784904,plain,(~subset(A,B)|$equal(union(A,B),B)),inference(rewrite,[status(thm)],[subset_union]),[]).
% 
% fof(reflexivity_of_subset,plain,(subset(A,A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET002+3.tptp',unknown),[]).
% 
% cnf(145888464,plain,(subset(A,A)),inference(rewrite,[status(thm)],[reflexivity_of_subset]),[]).
% 
% cnf(153722112,plain,($equal(union(A,A),A)),inference(resolution,[status(thm)],[145784904,145888464]),[]).
% 
% fof(prove_idempotency_of_union,plain,(~$equal(union(b,b),b)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET002+3.tptp',unknown),[]).
% 
% cnf(145949224,plain,(~$equal(union(b,b),b)),inference(rewrite,[status(thm)],[prove_idempotency_of_union]),[]).
% 
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[153722112,145949224]),[]).
% 
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
% 
%------------------------------------------------------------------------------