; Ausfhrung von LOGBSP.LSP mit compiliertem CLISP # > (goal () (mensch sokrates)) Yes. Real time: 0.09 sec. Run time: 0.09 sec. Space: 602 Bytes > (goal () (fehlbar sokrates)) Yes. Real time: 0.12 sec. Run time: 0.12 sec. Space: 1490 Bytes > (goal (irgendjemand) (fehlbar irgendjemand)) IRGENDJEMAND = SOKRATES IRGENDJEMAND = HANNIBAL No other solutions. Real time: 0.645 sec. Run time: 0.645 sec. Space: 3860 Bytes > (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. Real time: 13.46 sec. Run time: 13.46 sec. Space: 158724 Bytes > (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. Real time: 94.345 sec. Run time: 94.345 sec. Space: 1402934 Bytes GC: 7, GC time: 22.17 sec. > (goal (prd.log.ausdruck) (sentence (every man loves a woman) () prd.log.ausdruck) ) PRD.LOG.AUSDRUCK = (ALL _::X1943 (==> (MAN _::X1943) (EXISTS _::X1983 (& (WOMAN _::X1983) (LOVES _::X1943 _::X1983))) ) ) No other solutions. Real time: 3.52 sec. Run time: 3.52 sec. Space: 70130 Bytes > (goal (p) (sentence (a man that eats a apple loves every dog) () p)) P = (EXISTS _::X2064 (& (& (MAN _::X2064) (EXISTS _::X2104 (& (APPLE _::X2104) (EATS _::X2064 _::X2104))) ) (ALL _::X2144 (==> (DOG _::X2144) (LOVES _::X2064 _::X2144))) ) ) No other solutions. Real time: 11.205 sec. Run time: 11.205 sec. Space: 128078 Bytes GC: 1, GC time: 3.64 sec. > (goal (a b c p) (sentence (a b c) () p)) A = EVERY, B = MAN, C = LIVES, P = (ALL _::X2267 (==> (MAN _::X2267) (LIVES _::X2267)) ) A = EVERY, B = MAN, C = BARKS, P = (ALL _::X2267 (==> (MAN _::X2267) (BARKS _::X2267)) ) A = EVERY, B = WOMAN, C = LIVES, P = (ALL _::X2267 (==> (WOMAN _::X2267) (LIVES _::X2267)) ) A = EVERY, B = WOMAN, C = BARKS, P = (ALL _::X2267 (==> (WOMAN _::X2267) (BARKS _::X2267)) ) A = EVERY, B = APPLE, C = LIVES, P = (ALL _::X2267 (==> (APPLE _::X2267) (LIVES _::X2267)) ) A = EVERY, B = APPLE, C = BARKS, P = (ALL _::X2267 (==> (APPLE _::X2267) (BARKS _::X2267)) ) A = EVERY, B = DOG, C = LIVES, P = (ALL _::X2267 (==> (DOG _::X2267) (LIVES _::X2267)) ) A = EVERY, B = DOG, C = BARKS, P = (ALL _::X2267 (==> (DOG _::X2267) (BARKS _::X2267)) ) A = A, B = MAN, C = LIVES, P = (EXISTS _::X2827 (& (MAN _::X2827) (LIVES _::X2827)) ) A = A, B = MAN, C = BARKS, P = (EXISTS _::X2827 (& (MAN _::X2827) (BARKS _::X2827)) ) A = A, B = WOMAN, C = LIVES, P = (EXISTS _::X2827 (& (WOMAN _::X2827) (LIVES _::X2827)) ) A = A, B = WOMAN, C = BARKS, P = (EXISTS _::X2827 (& (WOMAN _::X2827) (BARKS _::X2827)) ) A = A, B = APPLE, C = LIVES, P = (EXISTS _::X2827 (& (APPLE _::X2827) (LIVES _::X2827)) ) A = A, B = APPLE, C = BARKS, P = (EXISTS _::X2827 (& (APPLE _::X2827) (BARKS _::X2827)) ) A = A, B = DOG, C = LIVES, P = (EXISTS _::X2827 (& (DOG _::X2827) (LIVES _::X2827)) ) A = A, B = DOG, C = BARKS, P = (EXISTS _::X2827 (& (DOG _::X2827) (BARKS _::X2827)) ) 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. Real time: 87.135 sec. Run time: 87.135 sec. Space: 1014450 Bytes GC: 7, GC time: 26.84 sec. > (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 ) ) > (goal (sent pred) (and (list7 sent) (sentence sent () pred))) SENT = (EVERY MAN THAT HAS EVERY MAN LIVES), PRED = (ALL _::X3921 (==> (& (MAN _::X3921) (ALL _::X3951 (==> (MAN _::X3951) (HAS _::X3921 _::X3951)))) (LIVES _::X3921) ) ) SENT = (EVERY MAN THAT HAS EVERY MAN BARKS), PRED = (ALL _::X3921 (==> (& (MAN _::X3921) (ALL _::X3951 (==> (MAN _::X3951) (HAS _::X3921 _::X3951)))) (BARKS _::X3921) ) ) SENT = (EVERY MAN THAT HAS EVERY WOMAN LIVES), PRED = (ALL _::X3921 (==> (& (MAN _::X3921) (ALL _::X3951 (==> (WOMAN _::X3951) (HAS _::X3921 _::X3951))) ) (LIVES _::X3921) ) ) SENT = (EVERY MAN THAT HAS EVERY WOMAN BARKS), PRED = (ALL _::X3921 (==> (& (MAN _::X3921) (ALL _::X3951 (==> (WOMAN _::X3951) (HAS _::X3921 _::X3951))) ) (BARKS _::X3921) ) ) SENT = (EVERY MAN THAT HAS EVERY APPLE LIVES), PRED = (ALL _::X3921 (==> (& (MAN _::X3921) (ALL _::X3951 (==> (APPLE _::X3951) (HAS _::X3921 _::X3951))) ) (LIVES _::X3921) ) ) SENT = (EVERY MAN THAT HAS EVERY APPLE BARKS), PRED = (ALL _::X3921 (==> (& (MAN _::X3921) (ALL _::X3951 (==> (APPLE _::X3951) (HAS _::X3921 _::X3951))) ) (BARKS _::X3921) ) ) SENT = (EVERY MAN THAT HAS EVERY DOG LIVES), PRED = (ALL _::X3921 (==> (& (MAN _::X3921) (ALL _::X3951 (==> (DOG _::X3951) (HAS _::X3921 _::X3951)))) (LIVES _::X3921) ) ) SENT = (EVERY MAN THAT HAS EVERY DOG BARKS), PRED = (ALL _::X3921 (==> (& (MAN _::X3921) (ALL _::X3951 (==> (DOG _::X3951) (HAS _::X3921 _::X3951)))) (BARKS _::X3921) ) ) SENT = (EVERY MAN THAT HAS A MAN LIVES), PRED = (ALL _::X3921 (==> (& (MAN _::X3921) (EXISTS _::X4511 (& (MAN _::X4511) (HAS _::X3921 _::X4511))) ) (LIVES _::X3921) ) ) SENT = (EVERY MAN THAT HAS A MAN BARKS), PRED = (ALL _::X3921 (==> (& (MAN _::X3921) (EXISTS _::X4511 (& (MAN _::X4511) (HAS _::X3921 _::X4511))) ) (BARKS _::X3921) ) ) SENT = (EVERY MAN THAT HAS A WOMAN LIVES), PRED = (ALL _::X3921 (==> (& (MAN _::X3921) (EXISTS _::X4511 (& (WOMAN _::X4511) (HAS _::X3921 _::X4511))) ) (LIVES _::X3921) ) ) SENT = (EVERY MAN THAT HAS A WOMAN BARKS), PRED = (ALL _::X3921 (==> (& (MAN _::X3921) (EXISTS _::X4511 (& (WOMAN _::X4511) (HAS _::X3921 _::X4511))) ) (BARKS _::X3921) ) ) SENT = (EVERY MAN THAT HAS A APPLE LIVES), PRED = (ALL _::X3921 (==> (& (MAN _::X3921) (EXISTS _::X4511 (& (APPLE _::X4511) (HAS _::X3921 _::X4511))) ) (LIVES _::X3921) ) ) SENT = (EVERY MAN THAT HAS A APPLE BARKS), PRED = (ALL _::X3921 (==> (& (MAN _::X3921) (EXISTS _::X4511 (& (APPLE _::X4511) (HAS _::X3921 _::X4511))) ) (BARKS _::X3921) ) ) SENT = (EVERY MAN THAT HAS A DOG LIVES), PRED = (ALL _::X3921 (==> (& (MAN _::X3921) (EXISTS _::X4511 (& (DOG _::X4511) (HAS _::X3921 _::X4511))) ) (LIVES _::X3921) ) ) SENT = (EVERY MAN THAT HAS A DOG BARKS), PRED = (ALL _::X3921 (==> (& (MAN _::X3921) (EXISTS _::X4511 (& (DOG _::X4511) (HAS _::X3921 _::X4511))) ) (BARKS _::X3921) ) ) 1. Break> Real time: 864.8 sec. Run time: 623.68 sec. Space: 2022354 Bytes GC: 53, GC time: 239.225 sec. > (prologtrace nounphrase) T > (prologtrace determiner) T > (prologtrace noun) T > (prologtrace verbphrase) T > (prologtrace transverb) T > (prologtrace intransverb) T > (goal (p) (sentence (a dog barks) () p)) CALL = (NOUNPHRASE (A DOG BARKS) _::S25156 _::X5161 _::P15159 _::P5158) CALL = (DETERMINER (A DOG BARKS) _::S25164 _::X5170 _::P25168 _::P15167 _::P5166 ) RETURN = (DETERMINER (A . #1=(DOG BARKS)) #1# _::X5170 _::P25168 _::P15167 (EXISTS _::X5170 (& _::P25168 _::P15167)) ) CALL = (NOUN (DOG BARKS) _::S35165 _::X5170 _::P35169) RETURN = (NOUN (DOG . #1=(BARKS)) #1# _::X5170 (DOG _::X5170)) RETURN = (NOUNPHRASE (A DOG . #1=(BARKS)) #1# _::X5161 _::P15159 (EXISTS _::X5161 (& (DOG _::X5161) _::P15159)) ) CALL = (VERBPHRASE (BARKS) _::S35157 _::X5161 _::P15159) CALL = (TRANSVERB (BARKS) _::S25197 _::X5200 _::Y5201 _::P15199) FAIL = (TRANSVERB (BARKS) _::S25197 _::X5200 _::Y5201 _::P15199) CALL = (INTRANSVERB (BARKS) _::S15212 _::X5214 _::P5213) RETURN = (INTRANSVERB (BARKS) NIL _::X5214 (BARKS _::X5214)) RETURN = (VERBPHRASE (BARKS) NIL _::X5161 (BARKS _::X5161)) P = (EXISTS _::X5176 (& (DOG _::X5176) (BARKS _::X5176))) REDO = (VERBPHRASE (BARKS) NIL _::X5161 (BARKS _::X5161)) REDO = (INTRANSVERB (BARKS) NIL _::X5214 (BARKS _::X5214)) FAIL = (INTRANSVERB (BARKS) _::S15212 _::X5214 _::P5213) FAIL = (VERBPHRASE (BARKS) _::S35157 _::X5161 _::P15159) REDO = (NOUNPHRASE (A DOG . #1=(BARKS)) #1# _::X5161 _::P15159 (EXISTS _::X5161 (& (DOG _::X5161) _::P15159)) ) REDO = (NOUN (DOG . #1=(BARKS)) #1# _::X5170 (DOG _::X5170)) FAIL = (NOUN (DOG BARKS) _::S35165 _::X5170 _::P35169) REDO = (DETERMINER (A . #1=(DOG BARKS)) #1# _::X5170 _::P25168 _::P15167 (EXISTS _::X5170 (& _::P25168 _::P15167)) ) FAIL = (DETERMINER (A DOG BARKS) _::S25164 _::X5170 _::P25168 _::P15167 _::P5166 ) FAIL = (NOUNPHRASE (A DOG BARKS) _::S25156 _::X5161 _::P15159 _::P5158) No other solutions. Real time: 28.1 sec. Run time: 28.1 sec. Space: 90586 Bytes GC: 3, GC time: 13.685 sec. > (dribble)