Three teams participated: one from SUNY Stony Brook (Anu Singh,
Diptikalyan Saha, Hui Wan, Paul Fodor, Senlin Liang using XSB), one
from Vienna University of Technology (Christian Flicker, Markus Triska
using SWI-Prolog) and one team consisting of only Daniel Kraft who
wrote he has no affiliation - he used GNU-Prolog.

All of them submitted more than once, the XSB team even 8 times. In
compliance with the rules, we only looked at the last submission.

Christian Flicker, Markus Triska were the fastest, followed by the XSB
team some two hours later and Daniel Kraft some 10 more hours
later.

Every team submitted a solution to every of the six problems.

Here are the results: a + means the bonus was earned, a - says it was
not. The bonus has not influenced the final ranking.

The indication "time" means that the program took an "infinite" time,
i.e. too long for us to wait for it, even with very small input.

"bug" means that at least one answer was wrong.


               | bitrev| bookmove| carpet| juggle| optisort| sumdiff| #correct
------------------------------------------------------------------------------
Vienna         | ok -  | ok      | ok    | ok    | time    | ok     |  5
Daniel Kraft   | ok +  | ok      | ok    | ok    | ok -    | bug    |  5
XSB            | ok -  | bug     | ok    | ok    | time    | ok     |  4

Taking into account the submission time ...

       the Vienna team wins the net-version of the 14th Prolog
       Programming Contest. Congratulations.

The Vienna team already won the net version in 2006 !


The bug in sumdiff by Daniel Kraft was very unfortunate: his program
delivers the answer to the query as a list in the opposite order !
We had to reject that, but it pained us, because the fix is so easy
and he would otherwise have won this contest; his programs also had a
high aestetic value and all his programs were self-contained, i.e. he
didn't use any libraries.


Cheers

Bart Demoen and Phuong-Lan Nguyen