Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!seismo!rochester!pt.cs.cmu.edu!sei.cmu.edu!firth
From: firth@sei.cmu.edu (Robert Firth)
Newsgroups: sci.math
Subject: Re: P = NP
Message-ID: <416@aw.sei.cmu.edu.sei.cmu.edu>
Date: Mon, 24-Nov-86 14:25:03 EST
Article-I.D.: aw.416
Posted: Mon Nov 24 14:25:03 1986
Date-Received: Mon, 24-Nov-86 22:31:53 EST
References: <1953@emory.UUCP>
Sender: netnews@sei.cmu.edu
Reply-To: firth@bd.sei.cmu.edu.UUCP (PUT YOUR NAME HERE)
Distribution: na
Organization: Carnegie-Mellon University, SEI, Pgh, Pa
Lines: 11

In article <1953@emory.UUCP> cmb@emory.UUCP (Chang Bang) writes:
> I heard a rumor that somebody in the west coast proved P = NP.  I would 
> like to get a preprint of the proof or any information for the rumor.

Your average Prolog interpreter should have no trouble generating
a proof of this.  Try, for instance

	All invisible dogs are dogs
	All dogs are visible
	---------------------------
	All invisible dogs are visible