
ff: parsing domain file
domain 'ZEON' defined
 ... done.
ff: parsing problem file
problem 'P18' defined
 ... done.



Cueing down from goal distance:   15 into depth [1]
                                  14            [1][2]
                                  13            [1][2]
                                  12            [1]
                                  11            [1][2]
                                  10            [1]
                                   9            [1][2]
                                   8            [1][2]
                                   7            [1]
                                   6            [1][2]
                                   5            [1][2]
                                   4            [1]
                                   3            [1]
                                   2            [1]
                                   0            

ff: found legal plan as follows

step    0: BOARD PERSON2 PLANE1 CITY0
        1: FLY PLANE1 CITY0 CITY1 FL6 FL5
        2: BOARD PERSON1 PLANE1 CITY1
        3: DEBARK PERSON2 PLANE1 CITY1
        4: BOARD PERSON2 PLANE1 CITY1
        5: FLY PLANE1 CITY1 CITY0 FL5 FL4
        6: DEBARK PERSON1 PLANE1 CITY0
        7: BOARD PERSON1 PLANE1 CITY0
        8: FLY PLANE1 CITY0 CITY4 FL4 FL3
        9: DEBARK PERSON1 PLANE1 CITY4
       10: BOARD PERSON1 PLANE1 CITY4
       11: DEBARK PERSON2 PLANE1 CITY4
       12: BOARD PERSON2 PLANE1 CITY4
       13: FLY PLANE1 CITY4 CITY3 FL3 FL2
       14: DEBARK PERSON1 PLANE1 CITY3
       15: BOARD PERSON1 PLANE1 CITY3
       16: DEBARK PERSON2 PLANE1 CITY3
       17: BOARD PERSON2 PLANE1 CITY3
       18: FLY PLANE1 CITY3 CITY2 FL2 FL1
       19: DEBARK PERSON1 PLANE1 CITY2
       20: DEBARK PERSON2 PLANE1 CITY2
     

time spent:    0.01 seconds instantiating 2372 easy, 0 hard action templates
               0.01 seconds reachability analysis, yielding 420 facts and 868 actions
               0.06 seconds creating final representation with 420 relevant facts
               1.44 seconds building connectivity graph
               1.26 seconds searching, evaluating 40 states, to a max depth of 2
               2.78 seconds total time

