; Ausf�hrung von LOGBSP.LSP mit interpretiertem CLISP

#<STRING-CHAR-FILE-STREAM #"LOGBSP.LOG">
> (goal () (mensch sokrates))
Yes.
Real time: 0.17 sec.
Run time: 0.17 sec.
Space: 744 Bytes
> (goal () (fehlbar sokrates))
Yes.
Real time: 0.34 sec.
Run time: 0.34 sec.
Space: 1658 Bytes
> (goal (irgendjemand) (fehlbar irgendjemand))
IRGENDJEMAND = SOKRATES 
IRGENDJEMAND = HANNIBAL 
No other solutions.
Real time: 1.15 sec.
Run time: 1.15 sec.
Space: 4968 Bytes
> (gc)
266250
> (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: 34.495 sec.
Run time: 34.495 sec.
Space: 191434 Bytes
> (goal (ort) (geh drau�en ort ()))
ORT = DRAU�EN 
ORT = WINDFANG 
ORT = FLUR 
ORT = E�ZIMMER 
ORT = K�CHE 
ORT = WOHNZIMMER 
ORT = DIELE 
ORT = ARBEITSZIMMER 
ORT = BAD 
ORT = SCHLAFZIMMER 
ORT = SCHLAFZIMMER 
ORT = BAD 
ORT = DIELE 
ORT = ARBEITSZIMMER 
ORT = K�CHE 
ORT = E�ZIMMER 
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 = E�ZIMMER 
ORT = K�CHE 
ORT = SCHLAFZIMMER 
ORT = BAD 
ORT = DIELE 
ORT = ARBEITSZIMMER 
ORT = DRAU�EN 
No other solutions.
Real time: 401.89 sec.
Run time: 401.89 sec.
Space: 1548942 Bytes
GC: 8, GC time: 26.76 sec.
> (goal (pr�d.log.ausdruck) (sentence (every man loves a woman) () pr�d.log.ausdruck))
PR�D.LOG.AUSDRUCK = (ALL _::X1942
 (==> (MAN _::X1942)
  (EXISTS _::X1982 (& (WOMAN _::X1982) (LOVES _::X1942 _::X1982)))
 )
                    ) 
No other solutions.
Real time: 14.07 sec.
Run time: 14.07 sec.
Space: 73382 Bytes
> (goal (p) (sentence (a man that eats a apple loves every dog) () p))
P = (EXISTS _::X2063
 (&
  (& (MAN _::X2063)
   (EXISTS _::X2103 (& (APPLE _::X2103) (EATS _::X2063 _::X2103)))
  )
  (ALL _::X2143 (==> (DOG _::X2143) (LOVES _::X2063 _::X2143)))
 )
    ) 
No other solutions.
Real time: 26.085 sec.
Run time: 26.085 sec.
Space: 133210 Bytes
GC: 1, GC time: 4.28 sec.
> (goal (a b c p) (sentence (a b c) () p))
A = EVERY, B = MAN, C = LIVES, P = (ALL _::X2266
 (==> (MAN _::X2266) (LIVES _::X2266))
                                   ) 
A = EVERY, B = MAN, C = BARKS, P = (ALL _::X2266
 (==> (MAN _::X2266) (BARKS _::X2266))
                                   ) 
A = EVERY, B = WOMAN, C = LIVES, P = (ALL _::X2266
 (==> (WOMAN _::X2266) (LIVES _::X2266))
                                     ) 
A = EVERY, B = WOMAN, C = BARKS, P = (ALL _::X2266
 (==> (WOMAN _::X2266) (BARKS _::X2266))
                                     ) 
A = EVERY, B = APPLE, C = LIVES, P = (ALL _::X2266
 (==> (APPLE _::X2266) (LIVES _::X2266))
                                     ) 
A = EVERY, B = APPLE, C = BARKS, P = (ALL _::X2266
 (==> (APPLE _::X2266) (BARKS _::X2266))
                                     ) 
A = EVERY, B = DOG, C = LIVES, P = (ALL _::X2266
 (==> (DOG _::X2266) (LIVES _::X2266))
                                   ) 
A = EVERY, B = DOG, C = BARKS, P = (ALL _::X2266
 (==> (DOG _::X2266) (BARKS _::X2266))
                                   ) 
A = A, B = MAN, C = LIVES, P = (EXISTS _::X2826
 (& (MAN _::X2826) (LIVES _::X2826))
                               ) 
A = A, B = MAN, C = BARKS, P = (EXISTS _::X2826
 (& (MAN _::X2826) (BARKS _::X2826))
                               ) 
A = A, B = WOMAN, C = LIVES, P = (EXISTS _::X2826
 (& (WOMAN _::X2826) (LIVES _::X2826))
                                 ) 
A = A, B = WOMAN, C = BARKS, P = (EXISTS _::X2826
 (& (WOMAN _::X2826) (BARKS _::X2826))
                                 ) 
A = A, B = APPLE, C = LIVES, P = (EXISTS _::X2826
 (& (APPLE _::X2826) (LIVES _::X2826))
                                 ) 
A = A, B = APPLE, C = BARKS, P = (EXISTS _::X2826
 (& (APPLE _::X2826) (BARKS _::X2826))
                                 ) 
A = A, B = DOG, C = LIVES, P = (EXISTS _::X2826
 (& (DOG _::X2826) (LIVES _::X2826))
                               ) 
A = A, B = DOG, C = BARKS, P = (EXISTS _::X2826
 (& (DOG _::X2826) (BARKS _::X2826))
                               ) 
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: 231.325 sec.
Run time: 231.325 sec.
Space: 1065112 Bytes
GC: 9, GC time: 36.11 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 (x) (list7 x))
X = (_::A13894 _::A23895 _::A33896 _::A43897 _::A53898 _::A63899 _::A73900) 
No other solutions.
Real time: 1.085 sec.
Run time: 1.085 sec.
Space: 6058 Bytes
> (goal (sent pred) (and (list7 sent) (sentence sent () pred)))
SENT = (EVERY MAN THAT HAS EVERY MAN LIVES), PRED = (ALL _::X3928
 (==>
  (& (MAN _::X3928) (ALL _::X3958 (==> (MAN _::X3958) (HAS _::X3928 _::X3958))))
  (LIVES _::X3928)
 )
                                                    ) 
SENT = (EVERY MAN THAT HAS EVERY MAN BARKS), PRED = (ALL _::X3928
 (==>
  (& (MAN _::X3928) (ALL _::X3958 (==> (MAN _::X3958) (HAS _::X3928 _::X3958))))
  (BARKS _::X3928)
 )
                                                    ) 
SENT = (EVERY MAN THAT HAS EVERY WOMAN LIVES), PRED = (ALL _::X3928
 (==>
  (& (MAN _::X3928)
   (ALL _::X3958 (==> (WOMAN _::X3958) (HAS _::X3928 _::X3958)))
  )
  (LIVES _::X3928)
 )
                                                      ) 
SENT = (EVERY MAN THAT HAS EVERY WOMAN BARKS), PRED = (ALL _::X3928
 (==>
  (& (MAN _::X3928)
   (ALL _::X3958 (==> (WOMAN _::X3958) (HAS _::X3928 _::X3958)))
  )
  (BARKS _::X3928)
 )
                                                      ) 
1. Break> 
Real time: 80.28 sec.
Run time: 79.51 sec.
Space: 306816 Bytes
GC: 5, GC time: 22.25 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) _::S24373 _::X4378 _::P14376 _::P4375) 
CALL = (DETERMINER (A DOG BARKS) _::S24381 _::X4387 _::P24385 _::P14384
 _::P4383
       ) 
RETURN = (DETERMINER (A . #1=(DOG BARKS)) #1# _::X4387 _::P24385 _::P14384
 (EXISTS _::X4387 (& _::P24385 _::P14384))
         ) 
CALL = (NOUN (DOG BARKS) _::S34382 _::X4387 _::P34386) 
RETURN = (NOUN (DOG . #1=(BARKS)) #1# _::X4387 (DOG _::X4387)) 
RETURN = (NOUNPHRASE (A DOG . #1=(BARKS)) #1# _::X4378 _::P14376
 (EXISTS _::X4378 (& (DOG _::X4378) _::P14376))
         ) 
CALL = (VERBPHRASE (BARKS) _::S34374 _::X4378 _::P14376) 
CALL = (TRANSVERB (BARKS) _::S24414 _::X4417 _::Y4418 _::P14416) 
FAIL = (TRANSVERB (BARKS) _::S24414 _::X4417 _::Y4418 _::P14416) 
CALL = (INTRANSVERB (BARKS) _::S14429 _::X4431 _::P4430) 
RETURN = (INTRANSVERB (BARKS) NIL _::X4431 (BARKS _::X4431)) 
RETURN = (VERBPHRASE (BARKS) NIL _::X4378 (BARKS _::X4378)) 
P = (EXISTS _::X4393 (& (DOG _::X4393) (BARKS _::X4393))) 
REDO = (VERBPHRASE (BARKS) NIL _::X4378 (BARKS _::X4378)) 
REDO = (INTRANSVERB (BARKS) NIL _::X4431 (BARKS _::X4431)) 
FAIL = (INTRANSVERB (BARKS) _::S14429 _::X4431 _::P4430) 
FAIL = (VERBPHRASE (BARKS) _::S34374 _::X4378 _::P14376) 
REDO = (NOUNPHRASE (A DOG . #1=(BARKS)) #1# _::X4378 _::P14376
 (EXISTS _::X4378 (& (DOG _::X4378) _::P14376))
       ) 
REDO = (NOUN (DOG . #1=(BARKS)) #1# _::X4387 (DOG _::X4387)) 
FAIL = (NOUN (DOG BARKS) _::S34382 _::X4387 _::P34386) 
REDO = (DETERMINER (A . #1=(DOG BARKS)) #1# _::X4387 _::P24385 _::P14384
 (EXISTS _::X4387 (& _::P24385 _::P14384))
       ) 
FAIL = (DETERMINER (A DOG BARKS) _::S24381 _::X4387 _::P24385 _::P14384
 _::P4383
       ) 
FAIL = (NOUNPHRASE (A DOG BARKS) _::S24373 _::X4378 _::P14376 _::P4375) 
No other solutions.
Real time: 36.5 sec.
Run time: 36.5 sec.
Space: 105458 Bytes
GC: 2, GC time: 8.95 sec.
> (goal (x y) (and (equal x (a b . x)) (equal y (b a . y))))
X = #1=(A B . #1#), Y = #2=(B A . #2#) 
No other solutions.
Real time: 2.715 sec.
Run time: 2.715 sec.
Space: 5830 Bytes
> (goal (x y) (and (equal x (a b . x)) (equal y (b a . y)) (equal x (a . y))))
X = #1=(A . #2=(B . #1#)), Y = #2# 
No other solutions.
Real time: 1.395 sec.
Run time: 1.395 sec.
Space: 7170 Bytes
> (goal (x y c) (and (equal x (c . x)) (equal y (a . y)) (equal x y)))
X = #1=(A . #1#), Y = #1#, C = A 
No other solutions.
Real time: 1.545 sec.
Run time: 1.545 sec.
Space: 7398 Bytes
> (dribble)