%------------------------------------------------------------------------------
% File     : Faust---1.0
% Problem  : SET687+4 : 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:35:48 EDT 2009

% Result   : Theorem 0.0s
% Output   : Refutation 0.0s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    7 (   4 unt;   0 def)
%            Number of atoms       :   15 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   14 (   6   ~;   6   |;   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    :    2 (   2 usr;   1 con; 0-3 aty)
%            Number of variables   :   10 (   3 sgn   3   !;   0   ?)

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

cnf(140887192,plain,
    ( member(x(A,B,C),A)
    | subset(A,B) ),
    inference(rewrite,[status(thm)],[subset]),
    [] ).

fof(thI01,plain,
    ~ subset(a,a),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET687+4.tptp',unknown),
    [] ).

cnf(141127136,plain,
    ~ subset(a,a),
    inference(rewrite,[status(thm)],[thI01]),
    [] ).

cnf(149240704,plain,
    member(x(a,a,A),a),
    inference(resolution,[status(thm)],[140887192,141127136]),
    [] ).

cnf(140894248,plain,
    ( ~ member(x(A,B,C),B)
    | subset(A,B) ),
    inference(rewrite,[status(thm)],[subset]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(forward_subsumption_resolution__resolution,[status(thm)],[149240704,140894248,141127136]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(subset,plain,(((~subset(A,B)|~member(C,A)|member(C,B))&(~member(x(A,B,C),B)|subset(A,B))&(member(x(A,B,C),A)|subset(A,B)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET687+4.tptp',unknown),[]).
% 
% cnf(140887192,plain,(member(x(A,B,C),A)|subset(A,B)),inference(rewrite,[status(thm)],[subset]),[]).
% 
% fof(thI01,plain,(~subset(a,a)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET687+4.tptp',unknown),[]).
% 
% cnf(141127136,plain,(~subset(a,a)),inference(rewrite,[status(thm)],[thI01]),[]).
% 
% cnf(149240704,plain,(member(x(a,a,A),a)),inference(resolution,[status(thm)],[140887192,141127136]),[]).
% 
% cnf(140894248,plain,(~member(x(A,B,C),B)|subset(A,B)),inference(rewrite,[status(thm)],[subset]),[]).
% 
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__resolution,[status(thm)],[149240704,140894248,141127136]),[]).
% 
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
% 
%------------------------------------------------------------------------------