# $Id: README 1295 2007-05-11 16:52:51Z josd $

N3 proof engine inspired by http://www.ibiblio.org/obp/py4fun/prolog/prolog3.py
euler3 prove is with depth first search and euler path anti-looping detection
Usage: python euler.py [--why] [--once] [--debug] triples
Test:  python euler.py -why http://eulersharp.sourceforge.net/2005/11swap/tree.n3

Remark that the N3 that is actually understood is very limited:
qnames, () lists, facts and => rules on a single line and not yet [] ; , ^ ! ^^ @
One might use the java version euler --pass to produce triples for euler3.