%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : SET627+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:33:35 EDT 2009
% Result : Theorem 0.0s
% Output : Refutation 0.0s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 11 ( 7 unt; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 22 ( 11 ~; 8 |; 3 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 11 ( 1 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(intersect_defn,plain,
! [A,B,D] :
( ( member(d_nn_1(A,B),B)
| ~ intersect(A,B) )
& ( member(d_nn_1(A,B),A)
| ~ intersect(A,B) )
& ( intersect(A,B)
| ~ member(D,A)
| ~ member(D,B) ) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET627+3.tptp',unknown),
[] ).
cnf(156706256,plain,
( member(d_nn_1(A,B),B)
| ~ intersect(A,B) ),
inference(rewrite,[status(thm)],[intersect_defn]),
[] ).
fof(disjoint_defn,plain,
! [A,B] :
( ( ~ disjoint(A,B)
| ~ intersect(A,B) )
& ( disjoint(A,B)
| intersect(A,B) ) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET627+3.tptp',unknown),
[] ).
cnf(156712248,plain,
( disjoint(A,B)
| intersect(A,B) ),
inference(rewrite,[status(thm)],[disjoint_defn]),
[] ).
fof(prove_th104,plain,
~ disjoint(b,empty_set),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET627+3.tptp',unknown),
[] ).
cnf(156763192,plain,
~ disjoint(b,empty_set),
inference(rewrite,[status(thm)],[prove_th104]),
[] ).
cnf(164597176,plain,
intersect(b,empty_set),
inference(resolution,[status(thm)],[156712248,156763192]),
[] ).
cnf(164631120,plain,
member(d_nn_1(b,empty_set),empty_set),
inference(resolution,[status(thm)],[156706256,164597176]),
[] ).
fof(empty_set_defn,plain,
! [A] : ~ member(A,empty_set),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET627+3.tptp',unknown),
[] ).
cnf(156678312,plain,
~ member(A,empty_set),
inference(rewrite,[status(thm)],[empty_set_defn]),
[] ).
cnf(contradiction,plain,
$false,
inference(resolution,[status(thm)],[164631120,156678312]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(intersect_defn,plain,(((member(d_nn_1(A,B),B)|~intersect(A,B))&(member(d_nn_1(A,B),A)|~intersect(A,B))&(intersect(A,B)|~member(D,A)|~member(D,B)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET627+3.tptp',unknown),[]).
%
% cnf(156706256,plain,(member(d_nn_1(A,B),B)|~intersect(A,B)),inference(rewrite,[status(thm)],[intersect_defn]),[]).
%
% fof(disjoint_defn,plain,(((~disjoint(A,B)|~intersect(A,B))&(disjoint(A,B)|intersect(A,B)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET627+3.tptp',unknown),[]).
%
% cnf(156712248,plain,(disjoint(A,B)|intersect(A,B)),inference(rewrite,[status(thm)],[disjoint_defn]),[]).
%
% fof(prove_th104,plain,(~disjoint(b,empty_set)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET627+3.tptp',unknown),[]).
%
% cnf(156763192,plain,(~disjoint(b,empty_set)),inference(rewrite,[status(thm)],[prove_th104]),[]).
%
% cnf(164597176,plain,(intersect(b,empty_set)),inference(resolution,[status(thm)],[156712248,156763192]),[]).
%
% cnf(164631120,plain,(member(d_nn_1(b,empty_set),empty_set)),inference(resolution,[status(thm)],[156706256,164597176]),[]).
%
% fof(empty_set_defn,plain,(~member(A,empty_set)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET627+3.tptp',unknown),[]).
%
% cnf(156678312,plain,(~member(A,empty_set)),inference(rewrite,[status(thm)],[empty_set_defn]),[]).
%
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[164631120,156678312]),[]).
%
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
%
%------------------------------------------------------------------------------