source: CGBLisp/examples/robot2.output@ 1

Starts dribbling to robot2.output (1995/7/5, 14:40:15).
NIL

>
(load "robot2.lisp")Loading robot2.lisp
------------------- CASE 1 -------------------
Condition:
  Green list: [ L2 - 1, L3 - 1 ]
  Red list: [ A^2 + B^2, L2, A, L3 ]
 Basis: [ ( - 2 * A) * S2 + ( - 2 * A^2 - 2 * B^2) * S1 + (A^2 * B + B^3), ( - 2) * C2 + (A^2 + B^2 - 2), (2 * A) * C1 + (2 * B) * S1 + ( - A^2 - B^2), (4 * A^2 + 4 * B^2) * S1^2 + ( - 4 * A^2 * B - 4 * B^3) * S1 + (A^4 + 2 * A^2 * B^2 - 4 * A^2 + B^4) ]
------------------- CASE 2 -------------------
Condition:
  Green list: [ L2 - 1, L3 - 1, A^2 + B^2 ]
  Red list: [ A^4 + 2 * A^2 * B^2 - 2 * A^2 * L2^2 - 2 * A^2 * L3^2 + B^4 + 2 * B^2 * L2^2 - 2 * B^2 * L3^2 + L2^4 - 2 * L2^2 * L3^2 + L3^4, L2, A, L3 ]
 Basis: [ (32 * B^4) ]
------------------- CASE 3 -------------------
Condition:
  Green list: [ L2 - 1, L3 - 1, A ]
  Red list: [ L3, B * L2 ]
 Basis: [ (4 * B^2) * C1^2 + (B^4 - 4 * B^2), (2 * B) * S2 + ( - 2 * B^2) * C1, ( - 2) * C2 + (B^2 - 2), (2 * B) * S1 + ( - B^2) ]
------------------- CASE 4 -------------------
Condition:
  Green list: [ L2 - 1, L3 - 1, A, B ]
  Red list: [ L3 ]
 Basis: [ (1) * C1^2 + (1) * S1^2 + ( - 1), (1) * S2, (1) * C2 + (1) ]
real time : 49.333 secs
run time  : 41.650 secs
Finished loading robot2.lisp
T

>
(dribble)