; Ausfhrung von LOGBSP.LOG mit VAXLISP Dribbling to DISK$USER2:[I20.CAP27.LISP]LOGBSP.LOG;1 Lisp> (goal () (mensch sokrates)) Yes. CPU Time: 0.01 sec., Real Time: 0.01 sec. NIL Lisp> (goal () (fehlbar sokrates)) Yes. CPU Time: 0.01 sec., Real Time: 0.01 sec. NIL Lisp> (goal (irgendjemand) (fehlbar irgendjemand)) IRGENDJEMAND = SOKRATES IRGENDJEMAND = HANNIBAL No other solutions. CPU Time: 0.03 sec., Real Time: 0.04 sec. NIL Lisp> (goal () (hanoi 4)) Lege eine Scheibe vom linken Stab zum rechten Stab. Lege eine Scheibe vom linken Stab zum mittleren Stab. Lege eine Scheibe vom rechten Stab zum mittleren Stab. Lege eine Scheibe vom linken Stab zum rechten Stab. Lege eine Scheibe vom mittleren Stab zum linken Stab. Lege eine Scheibe vom mittleren Stab zum rechten Stab. Lege eine Scheibe vom linken Stab zum rechten Stab. Lege eine Scheibe vom linken Stab zum mittleren Stab. Lege eine Scheibe vom rechten Stab zum mittleren Stab. Lege eine Scheibe vom rechten Stab zum linken Stab. Lege eine Scheibe vom mittleren Stab zum linken Stab. Lege eine Scheibe vom rechten Stab zum mittleren Stab. Lege eine Scheibe vom linken Stab zum rechten Stab. Lege eine Scheibe vom linken Stab zum mittleren Stab. Lege eine Scheibe vom rechten Stab zum mittleren Stab. Yes. CPU Time: 0.68 sec., Real Time: 0.97 sec. GC CPU Time: 1.53 sec., GC Real Time: 2.49 sec. NIL Lisp> (goal (ort) (geh drauen ort)) Fatal error in function PROLOG-FORM (signaled with ERROR). Bad number of arguments to GEH, wanted 4, received 3 Control Stack Debugger Frame #8: (PROLOG-FORM (GEH DRAUEN _::ORT528) (SYSTEM::%COMPILED-CLOSURE% (#(NIL (ORT) (_::ORT528))) #) ... Debug 1> quit CPU Time: 0.12 sec., Real Time: 5.21 sec. Lisp> (goal (ort) (geh drauen ort ())) ORT = DRAUEN ORT = WINDFANG ORT = FLUR ORT = EZIMMER ORT = KCHE ORT = WOHNZIMMER ORT = DIELE ORT = ARBEITSZIMMER ORT = BAD ORT = SCHLAFZIMMER ORT = SCHLAFZIMMER ORT = BAD ORT = DIELE ORT = ARBEITSZIMMER ORT = KCHE ORT = EZIMMER ORT = WOHNZIMMER ORT = DIELE ORT = ARBEITSZIMMER ORT = BAD ORT = SCHLAFZIMMER ORT = SCHLAFZIMMER ORT = BAD ORT = DIELE ORT = ARBEITSZIMMER ORT = WOHNZIMMER ORT = DIELE ORT = ARBEITSZIMMER ORT = BAD ORT = SCHLAFZIMMER ORT = EZIMMER ORT = KCHE ORT = SCHLAFZIMMER ORT = BAD ORT = DIELE ORT = ARBEITSZIMMER ORT = DRAUEN No other solutions. CPU Time: 4.41 sec., Real Time: 5.58 sec. GC CPU Time: 1.53 sec., GC Real Time: 2.25 sec. NIL Lisp> (goal (praed-log-ausdruck) (sentence (every man loves a woman) () praed-log-ausdruck)) PRAED-LOG-AUSDRUCK = (ALL _::X2269 (IMPL (MAN _::X2269) (EXISTS _::X2309 (AND (WOMAN _::X2309) (LOVES _::X2269 _::X2309))))) No other solutions. CPU Time: 0.26 sec., Real Time: 0.30 sec. NIL Lisp> (load "logbsp.lsp") ; Loading contents of file DISK$USER2:[I20.CAP27.LISP]LOGBSP.LSP;10 ; EXAMPLE2 ; EXAMPLE3 ; Finished loading DISK$USER2:[I20.CAP27.LISP]LOGBSP.LSP;10 T Lisp> (eval ++) PRAED-LOG-AUSDRUCK = (ALL _::X2386 (==> (MAN _::X2386) (EXISTS _::X2426 (& (WOMAN _::X2426) (LOVES _::X2386 _::X2426))))) No other solutions. CPU Time: 0.23 sec., Real Time: 0.30 sec. NIL Lisp> (goal (p) (sentence (a man that eats a apple loves every dog) () p)) P = (EXISTS _::X2507 (& (& (MAN _::X2507) (EXISTS _::X2547 (& (APPLE _::X2547) (EATS _::X2507 _::X2547)))) (ALL _::X2587 (==> (DOG _::X2587) (LOVES _::X2507 _::X2587))))) No other solutions. CPU Time: 0.40 sec., Real Time: 0.58 sec. NIL Lisp> (goal (a b c p) (sentence (a b c) () p)) A = EVERY, B = MAN, C = LIVES, P = (ALL _::X2710 (==> (MAN _::X2710) (LIVES _::X2710))) A = EVERY, B = MAN, C = BARKS, P = (ALL _::X2710 (==> (MAN _::X2710) (BARKS _::X2710))) A = EVERY, B = WOMAN, C = LIVES, P = (ALL _::X2710 (==> (WOMAN _::X2710) (LIVES _::X2710))) A = EVERY, B = WOMAN, C = BARKS, P = (ALL _::X2710 (==> (WOMAN _::X2710) (BARKS _::X2710))) A = EVERY, B = APPLE, C = LIVES, P = (ALL _::X2710 (==> (APPLE _::X2710) (LIVES _::X2710))) A = EVERY, B = APPLE, C = BARKS, P = (ALL _::X2710 (==> (APPLE _::X2710) (BARKS _::X2710))) A = EVERY, B = DOG, C = LIVES, P = (ALL _::X2710 (==> (DOG _::X2710) (LIVES _::X2710))) A = EVERY, B = DOG, C = BARKS, P = (ALL _::X2710 (==> (DOG _::X2710) (BARKS _::X2710))) A = A, B = MAN, C = LIVES, P = (EXISTS _::X3272 (& (MAN _::X3272) (LIVES _::X3272))) A = A, B = MAN, C = BARKS, P = (EXISTS _::X3272 (& (MAN _::X3272) (BARKS _::X3272))) A = A, B = WOMAN, C = LIVES, P = (EXISTS _::X3272 (& (WOMAN _::X3272) (LIVES _::X3272))) A = A, B = WOMAN, C = BARKS, P = (EXISTS _::X3272 (& (WOMAN _::X3272) (BARKS _::X3272))) A = A, B = APPLE, C = LIVES, P = (EXISTS _::X3272 (& (APPLE _::X3272) (LIVES _::X3272))) A = A, B = APPLE, C = BARKS, P = (EXISTS _::X3272 (& (APPLE _::X3272) (BARKS _::X3272))) A = A, B = DOG, C = LIVES, P = (EXISTS _::X3272 (& (DOG _::X3272) (LIVES _::X3272))) A = A, B = DOG, C = BARKS, P = (EXISTS _::X3272 (& (DOG _::X3272) (BARKS _::X3272))) A = JOHN, B = HAS, C = JOHN, P = (HAS JOHN JOHN) A = JOHN, B = HAS, C = MARY, P = (HAS JOHN MARY) A = JOHN, B = LOVES, C = JOHN, P = (LOVES JOHN JOHN) A = JOHN, B = LOVES, C = MARY, P = (LOVES JOHN MARY) A = JOHN, B = EATS, C = JOHN, P = (EATS JOHN JOHN) A = JOHN, B = EATS, C = MARY, P = (EATS JOHN MARY) A = MARY, B = HAS, C = JOHN, P = (HAS MARY JOHN) A = MARY, B = HAS, C = MARY, P = (HAS MARY MARY) A = MARY, B = LOVES, C = JOHN, P = (LOVES MARY JOHN) A = MARY, B = LOVES, C = MARY, P = (LOVES MARY MARY) A = MARY, B = EATS, C = JOHN, P = (EATS MARY JOHN) A = MARY, B = EATS, C = MARY, P = (EATS MARY MARY) No other solutions. CPU Time: 4.59 sec., Real Time: 5.21 sec. GC CPU Time: 1.71 sec., GC Real Time: 1.84 sec. NIL Lisp> (deflog list7 ((a1 a2 a3 a4 a5 a6 a7) (list7 (a1 a2 a3 a4 a5 a6 a7))) ) (#S(HORNCLAUSE :VARS (A1 A2 A3 A4 A5 A6 A7) :HEAD (LIST7 (A1 A2 A3 A4 A5 A6 A7)) :BODY NIL)) Lisp> (goal (sent pred) (and (list7 sent) (sentence sent () pred))) SENT = (EVERY MAN THAT HAS EVERY MAN LIVES), PRED = (ALL _::X4366 (==> (& (MAN _::X4366) (ALL _::X4396 (==> (MAN _::X4396) (HAS _::X4366 _::X4396)))) (LIVES _::X4366))) SENT = (EVERY MAN THAT HAS EVERY MAN BARKS), PRED = (ALL _::X4366 (==> (& (MAN _::X4366) (ALL _::X4396 (==> (MAN _::X4396) (HAS _::X4366 _::X4396)))) (BARKS _::X4366))) SENT = (EVERY MAN THAT HAS EVERY WOMAN LIVES), PRED = (ALL _::X4366 (==> (& (MAN _::X4366) (ALL _::X4396 (==> (WOMAN _::X4396) (HAS _::X4366 _::X4396)))) (LIVES _::X4366))) SENT = (EVERY MAN THAT HAS EVERY WOMAN BARKS), PRED = (ALL _::X4366 (==> (& (MAN _::X4366) (ALL _::X4396 (==> (WOMAN _::X4396) (HAS _::X4366 _::X4396)))) (BARKS _::X4366))) SENT = (EVERY MAN THAT HAS EVERY APPLE LIVES), PRED = (ALL _::X4366 (==> (& (MAN _::X4366) (ALL _::X4396 (==> (APPLE _::X4396) (HAS _::X4366 _::X4396)))) (LIVES _::X4366))) SENT = (EVERY MAN THAT HAS EVERY APPLE BARKS), PRED = (ALL _::X4366 (==> (& (MAN _::X4366) (ALL _::X4396 (==> (APPLE _::X4396) (HAS _::X4366 _::X4396)))) (BARKS _::X4366))) SENT = (EVERY MAN THAT HAS EVERY DOG LIVES), PRED = (ALL _::X4366 (==> (& (MAN _::X4366) (ALL _::X4396 (==> (DOG _::X4396) (HAS _::X4366 _::X4396)))) (LIVES _::X4366))) ; usw. usw. SENT = (EVERY MAN EATS EVERY APPLE THAT LIVES), PRED = (ALL _::X4366 (==> (MAN _::X4366) (ALL _::X16875 (==> (& (APPLE _::X16875) (LIVES _::X16875)) (EATS _::X4366 _::X16875))))) SENT = (EVERY MAN EATS EVERY APPLE THAT BARKS), PRED = (ALL _::X4366 (==> (MAN _::X4366) (ALL _::X16875 (==> (& (APPLE _::X16875) (BARKS _::X16875)) (EATS _::X4366 _::X16875))))) CPU Time: 38.13 sec., Real Time: 58.13 sec. GC CPU Time: 89.93 sec., GC Real Time: 101.68 sec. Lisp> (prologtrace sentence) T Lisp> (prologtrace nounphrase) T Lisp> (prologtrace determiner) T Lisp> (prologtrace noun) T Lisp> (prologtrace determiner) T Lisp> (prologtrace verbphrase) T Lisp> (prologtrace transverb) T Lisp> (prologtrace intransverb) T Lisp> (goal (p) (sentence (a dog barks) () p)) CALL = (SENTENCE (A DOG BARKS) NIL _::P17488) CALL = (NOUNPHRASE (A DOG BARKS) _::S217491 _::X17496 _::P117494 _::P17493) CALL = (DETERMINER (A DOG BARKS) _::S217499 _::X17505 _::P217503 _::P117502 _::P17501) RETURN = (DETERMINER (A DOG BARKS) (DOG BARKS) _::X17505 _::P217503 _::P117502 (EXISTS _::X17505 (& _::P217503 _::P117502))) CALL = (NOUN (DOG BARKS) _::S317500 _::X17505 _::P317504) RETURN = (NOUN (DOG BARKS) (BARKS) _::X17505 (DOG _::X17505)) RETURN = (NOUNPHRASE (A DOG BARKS) (BARKS) _::X17496 _::P117494 (EXISTS _::X17496 (& (DOG _::X17496) _::P117494))) CALL = (VERBPHRASE (BARKS) _::S317492 _::X17496 _::P117494) CALL = (TRANSVERB (BARKS) _::S217535 _::X17538 _::Y17539 _::P117537) FAIL = (TRANSVERB (BARKS) _::S217535 _::X17538 _::Y17539 _::P117537) CALL = (INTRANSVERB (BARKS) _::S117550 _::X17552 _::P17551) RETURN = (INTRANSVERB (BARKS) NIL _::X17552 (BARKS _::X17552)) RETURN = (VERBPHRASE (BARKS) NIL _::X17496 (BARKS _::X17496)) RETURN = (SENTENCE (A DOG BARKS) NIL (EXISTS _::X17512 (& (DOG _::X17512) (BARKS _::X17512)))) P = (EXISTS _::X17512 (& (DOG _::X17512) (BARKS _::X17512))) REDO = (SENTENCE (A DOG BARKS) NIL (EXISTS _::X17512 (& (DOG _::X17512) (BARKS _::X17512)))) REDO = (VERBPHRASE (BARKS) NIL _::X17496 (BARKS _::X17496)) REDO = (INTRANSVERB (BARKS) NIL _::X17552 (BARKS _::X17552)) FAIL = (INTRANSVERB (BARKS) _::S117550 _::X17552 _::P17551) FAIL = (VERBPHRASE (BARKS) _::S317492 _::X17496 _::P117494) REDO = (NOUNPHRASE (A DOG BARKS) (BARKS) _::X17496 _::P117494 (EXISTS _::X17496 (& (DOG _::X17496) _::P117494))) REDO = (NOUN (DOG BARKS) (BARKS) _::X17505 (DOG _::X17505)) FAIL = (NOUN (DOG BARKS) _::S317500 _::X17505 _::P317504) REDO = (DETERMINER (A DOG BARKS) (DOG BARKS) _::X17505 _::P217503 _::P117502 (EXISTS _::X17505 (& _::P217503 _::P117502))) FAIL = (DETERMINER (A DOG BARKS) _::S217499 _::X17505 _::P217503 _::P117502 _::P17501) FAIL = (NOUNPHRASE (A DOG BARKS) _::S217491 _::X17496 _::P117494 _::P17493) FAIL = (SENTENCE (A DOG BARKS) NIL _::P17488) No other solutions. CPU Time: 0.88 sec., Real Time: 5.96 sec. GC CPU Time: 20.33 sec., GC Real Time: 26.63 sec. NIL Lisp> (dribble)