Latest Execution of Plan Tuesday, April 6th, 15:28:55 #47
Description
Below is the output from the latest plan execution
Output
Executing Problem 1
Number of literals: 31
Constructing lookup tables: [10%] [20%] [30%] [40%] [50%] [60%] [70%] [80%] [90%] [100%]
Post filtering unreachable actions: [10%] [20%] [30%] [40%] [50%] [60%] [70%] [80%] [90%] [100%]
(total-time-taken) has a finite lower bound: [0.000,inf]
�[01;34mNo analytic limits found, not considering limit effects of goal-only operators�[00m
76% of the ground temporal actions in this problem are compression-safe
Initial heuristic = 12.000, admissible cost estimate 0.000
b (11.000 | 60.001)b (10.000 | 80.001)b (9.000 | 80.001)b (8.000 | 80.001)b (7.000 | 1290.003)b (6.000 | 1290.004)b (5.000 | 3690.004)b (4.000 | 3690.004)b (3.000 | 3690.004)b (2.000 | 3690.005)b (1.000 | 3710.006)(G);;;; Solution Found
; States evaluated: 40
; Cost: 3710.007
; Time 0.01
0.000: (move waiter1 kitchen1 table1) [20.000]
0.000: (move waiter2 kitchen1 table2) [30.000]
20.001: (takeorder waiter1 table1 order1) [60.000]
30.001: (takeorder waiter2 table2 order2) [30.000]
60.001: (move waiter2 table2 kitchen1) [30.000]
80.001: (move waiter1 table1 kitchen1) [20.000]
90.002: (delivertocounter counter1 waiter2 kitchen1 order2) [0.001]
90.003: (cook kitchen1 order2 counter1) [1200.000]
100.002: (delivertocounter counter1 waiter1 kitchen1 order1) [0.001]
1290.004: (takefromcounter counter1 waiter1 kitchen1 order2) [0.001]
1290.004: (cook kitchen1 order1 counter1) [2400.000]
1290.005: (move waiter1 kitchen1 table2) [30.000]
1320.006: (delivertotable waiter1 table2 order2) [0.001]
1320.007: (move waiter1 table2 table1) [10.000]
1330.008: (move waiter1 table1 kitchen1) [20.000]
3690.005: (takefromcounter counter1 waiter1 kitchen1 order1) [0.001]
3690.006: (move waiter1 kitchen1 table1) [20.000]
3710.007: (delivertotable waiter1 table1 order1) [0.001]
Executing Problem 2
Number of literals: 98
Constructing lookup tables: [10%] [20%] [30%] [40%] [50%] [60%] [70%] [80%] [90%] [100%]
Post filtering unreachable actions: [10%] [20%] [30%] [40%] [50%] [60%] [70%] [80%] [90%] [100%]
(total-time-taken) has a finite lower bound: [0.000,inf]
�[01;34mNo analytic limits found, not considering limit effects of goal-only operators�[00m
90% of the ground temporal actions in this problem are compression-safe
Initial heuristic = 47.000, admissible cost estimate 0.000
b (46.000 | 10.000)b (45.000 | 55.001)b (43.000 | 55.001)b (39.000 | 55.001)b (38.000 | 55.001)b (37.000 | 55.001)b (36.000 | 1250.003)b (32.000 | 1250.003)b (31.000 | 1250.003)b (30.000 | 1250.003)b (29.000 | 1870.004)b (27.000 | 1870.004)b (26.000 | 1870.004)b (25.000 | 4850.004)b (24.000 | 4850.004)b (23.000 | 4850.004)b (22.000 | 4850.004)b (21.000 | 4870.005)b (20.000 | 4870.005)b (19.000 | 4870.005)b (18.000 | 5450.005)
Resorting to best-first search
Running WA* with W = 5.000, not restarting with goal states
b (46.000 | 10.000)b (45.000 | 55.001)b (43.000 | 55.001)b (39.000 | 55.001)b (35.000 | 55.001)b (34.000 | 65.000)b (33.000 | 75.000)b (32.000 | 1875.002)b (31.000 | 1875.003)b (30.000 | 1885.004)b (29.000 | 1885.005)b (28.000 | 1885.005)b (27.000 | 1885.005)b (26.000 | 3755.003)b (25.000 | 3765.005)b (24.000 | 3785.005)b (23.000 | 3785.006)b (22.000 | 3785.006)b (21.000 | 3785.006)b (20.000 | 3785.006)b (19.000 | 3785.006)b (18.000 | 3785.006)b (17.000 | 3785.006)b (16.000 | 3785.006)b (15.000 | 4875.004)b (14.000 | 4875.004)b (13.000 | 4875.004)b (12.000 | 4885.006)b (11.000 | 4885.007)b (10.000 | 4885.007)b (9.000 | 4885.007)b (8.000 | 5034.009)b (7.000 | 5034.010)b (6.000 | 5044.011)b (5.000 | 5044.012)b (4.000 | 5475.005)b (3.000 | 5475.006)b (2.000 | 5485.007)b (1.000 | 5525.007)(G);;;; Solution Found
; States evaluated: 19996
; Cost: 5525.008
; Time 38.04
0.000: (move waiter1 kitchen1 table5) [10.000]
0.000: (move waiter3 kitchen2 kitchen1) [5.000]
0.000: (move waiter4 kitchen2 kitchen1) [5.000]
0.000: (move waiter2 kitchen1 table1) [20.000]
5.001: (move waiter3 kitchen1 table2) [30.000]
5.001: (move waiter4 kitchen1 table3) [40.000]
10.001: (takeorder waiter1 table5 order5) [45.000]
20.000: (takeorder waiter2 table1 order1) [45.000]
35.001: (takeorder waiter3 table2 order2) [90.000]
45.001: (takeorder waiter4 table3 order3) [30.000]
55.001: (move waiter1 table5 kitchen1) [10.000]
65.000: (move waiter2 table1 kitchen2) [10.000]
65.002: (delivertocounter counter1 waiter1 kitchen1 order5) [0.001]
65.003: (move waiter1 kitchen1 table4) [50.000]
75.001: (delivertocounter counter1 waiter2 kitchen2 order1) [0.001]
75.001: (move waiter4 table3 kitchen1) [40.000]
75.002: (cook kitchen1 order1 counter1) [1800.000]
115.002: (delivertocounter counter1 waiter4 kitchen1 order3) [0.001]
115.003: (takeorder waiter1 table4 order4) [15.000]
125.001: (move waiter3 table2 kitchen1) [30.000]
130.003: (move waiter1 table4 kitchen1) [50.000]
155.002: (delivertocounter counter1 waiter3 kitchen1 order2) [0.001]
155.003: (cook kitchen2 order2 counter1) [3600.000]
180.004: (delivertocounter counter1 waiter1 kitchen1 order4) [0.001]
1875.003: (takefromcounter counter1 waiter2 kitchen2 order1) [0.001]
1875.003: (cook kitchen1 order3 counter1) [1200.000]
1875.004: (move waiter2 kitchen2 table1) [10.000]
1885.005: (delivertotable waiter2 table1 order1) [0.001]
1885.006: (move waiter2 table1 kitchen1) [20.000]
3075.004: (takefromcounter counter1 waiter4 kitchen1 order3) [0.001]
3075.004: (cook kitchen1 order5 counter1) [1800.000]
3075.005: (move waiter4 kitchen1 table3) [40.000]
3115.006: (delivertotable waiter4 table3 order3) [0.001]
3755.004: (takefromcounter counter1 waiter3 kitchen1 order2) [0.001]
3755.005: (move waiter3 kitchen1 table2) [30.000]
3785.006: (delivertotable waiter3 table2 order2) [0.001]
3785.007: (move waiter3 table2 table6) [9.000]
3794.007: (takeorder waiter3 table6 order6) [30.000]
3824.007: (move waiter3 table6 kitchen2) [10.000]
3834.008: (delivertocounter counter1 waiter3 kitchen2 order6) [0.001]
3834.009: (cook kitchen2 order6 counter1) [1200.000]
4875.005: (takefromcounter counter1 waiter2 kitchen1 order5) [0.001]
4875.005: (cook kitchen1 order4 counter1) [600.000]
4875.006: (move waiter2 kitchen1 table5) [10.000]
4885.007: (delivertotable waiter2 table5 order5) [0.001]
5034.010: (takefromcounter counter1 waiter3 kitchen2 order6) [0.001]
5034.011: (move waiter3 kitchen2 table6) [10.000]
5044.012: (delivertotable waiter3 table6 order6) [0.001]
5475.006: (takefromcounter counter1 waiter1 kitchen1 order4) [0.001]
5475.007: (move waiter1 kitchen1 table4) [50.000]
5525.008: (delivertotable waiter1 table4 order4) [0.001]
Executing Problem 3
Number of literals: 272
Constructing lookup tables: [10%] [20%] [30%] [40%] [50%] [60%] [70%] [80%] [90%] [100%]
Post filtering unreachable actions: [10%] [20%] [30%] [40%] [50%] [60%] [70%] [80%] [90%] [100%]
(total-time-taken) has a finite lower bound: [0.000,inf]
�[01;34mNo analytic limits found, not considering limit effects of goal-only operators�[00m
97% of the ground temporal actions in this problem are compression-safe
Initial heuristic = 179.000, admissible cost estimate 0.000
b (155.000 | 10.000)b (151.000 | 70.001)b (147.000 | 70.001)b (145.000 | 70.001)b (144.000 | 70.001)b (143.000 | 70.001)b (142.000 | 95.001)b (141.000 | 105.003)b (140.000 | 2505.004)b (139.000 | 2505.004)b (138.000 | 2505.004)b (137.000 | 2588.007)b (136.000 | 2588.007)b (135.000 | 2588.007)b (134.000 | 2588.007)b (133.000 | 2588.007)b (132.000 | 2588.007)b (131.000 | 2588.007)b (130.000 | 2588.007)b (129.000 | 2588.007)b (126.000 | 2588.007)b (125.000 | 2588.007)b (124.000 | 2588.007)b (123.000 | 2588.007)b (122.000 | 2588.007)b (121.000 | 2744.017)b (120.000 | 2744.017)b (119.000 | 2744.017)b (118.000 | 2744.017)b (117.000 | 2744.017)b (116.000 | 2744.017)b (115.000 | 2744.017)b (114.000 | 2744.017)b (113.000 | 2744.017)b (112.000 | 2744.017)b (111.000 | 2744.017)b (110.000 | 2744.017)b (109.000 | 2744.017)b (108.000 | 2744.017)b (107.000 | 2768.014)b (106.000 | 3410.023)b (105.000 | 3410.023)b (104.000 | 3410.023)b (103.000 | 3410.023)b (102.000 | 3853.010)b (101.000 | 3853.010)b (100.000 | 3918.011)b (99.000 | 3918.011)b (98.000 | 3918.011)b (97.000 | 3918.011)b (96.000 | 3918.011)b (95.000 | 3918.011)b (94.000 | 3918.011)b (93.000 | 3918.011)b (92.000 | 3918.011)b (91.000 | 5018.012)b (90.000 | 5018.012)b (89.000 | 5018.012)b (88.000 | 5018.012)```
Executing Problem 4
Number of literals: 55
Constructing lookup tables: [10%] [20%] [30%] [40%] [50%] [60%] [70%] [80%] [90%] [100%]
Post filtering unreachable actions: [10%] [20%] [30%] [40%] [50%] [60%] [70%] [80%] [90%] [100%]
(total-time-taken) has a finite lower bound: [0.000,inf]
�[01;34mNo analytic limits found, not considering limit effects of goal-only operators�[00m
84% of the ground temporal actions in this problem are compression-safe
Initial heuristic = 24.000, admissible cost estimate 0.000
b (23.000 | 35.001)b (22.000 | 35.001)b (20.000 | 125.001)b (19.000 | 125.001)b (18.000 | 125.001)b (17.000 | 655.002)b (16.000 | 655.002)b (15.000 | 655.002)b (14.000 | 1855.004)b (13.000 | 1855.004)b (12.000 | 3055.005)b (11.000 | 3055.005)b (10.000 | 3055.005)b (9.000 | 3055.005)b (8.000 | 3055.005)b (7.000 | 3055.005)b (6.000 | 3055.006)b (5.000 | 3075.007)b (4.000 | 3075.008)b (3.000 | 4855.005)b (2.000 | 4855.007)b (1.000 | 4895.008)(G);;;; Solution Found
; States evaluated: 737
; Cost: 4895.009
; Time 0.50
0.000: (move waiter1 kitchen1 table2) [20.000]
0.000: (move waiter2 kitchen1 table2) [20.000]
0.000: (move waiter3 kitchen1 table2) [20.000]
20.001: (takeorder waiter1 table2 order2) [15.000]
20.001: (move waiter2 table2 table4) [40.000]
20.001: (move waiter3 table2 table3) [60.000]
35.001: (move waiter1 table2 kitchen1) [20.000]
55.002: (delivertocounter counter1 waiter1 kitchen1 order2) [0.001]
55.003: (move waiter1 kitchen1 table1) [20.000]
55.003: (cook kitchen1 order2 counter1) [600.000]
60.001: (takeorder waiter2 table4 order4) [30.000]
75.003: (takeorder waiter1 table1 order1) [30.000]
80.001: (takeorder waiter3 table3 order3) [45.000]
90.001: (move waiter2 table4 kitchen1) [40.000]
105.003: (move waiter1 table1 kitchen1) [20.000]
125.001: (move waiter3 table3 kitchen1) [40.000]
125.004: (delivertocounter counter1 waiter1 kitchen1 order1) [0.001]
130.002: (delivertocounter counter1 waiter2 kitchen1 order4) [0.001]
165.002: (delivertocounter counter1 waiter3 kitchen1 order3) [0.001]
655.004: (cook kitchen1 order4 counter1) [1200.000]
655.004: (takefromcounter counter1 waiter1 kitchen1 order2) [0.001]
655.005: (move waiter1 kitchen1 table2) [20.000]
675.006: (delivertotable waiter1 table2 order2) [0.001]
675.007: (move waiter1 table2 table4) [40.000]
715.008: (move waiter1 table4 kitchen1) [40.000]
1855.005: (cook kitchen1 order1 counter1) [1200.000]
1855.005: (takefromcounter counter1 waiter1 kitchen1 order4) [0.001]
1855.006: (move waiter1 kitchen1 table4) [40.000]
1895.007: (delivertotable waiter1 table4 order4) [0.001]
1895.008: (move waiter1 table4 table1) [60.000]
1955.009: (move waiter1 table1 kitchen1) [20.000]
3055.006: (takefromcounter counter1 waiter1 kitchen1 order1) [0.001]
3055.006: (cook kitchen1 order3 counter1) [1800.000]
3055.007: (move waiter1 kitchen1 table1) [20.000]
3075.008: (delivertotable waiter1 table1 order1) [0.001]
3075.009: (move waiter1 table1 kitchen1) [20.000]
4855.007: (takefromcounter counter1 waiter1 kitchen1 order3) [0.001]
4855.008: (move waiter1 kitchen1 table3) [40.000]
4895.009: (delivertotable waiter1 table3 order3) [0.001]
Executing Problem 5
Number of literals: 79
Constructing lookup tables: [10%] [20%] [30%] [40%] [50%] [60%] [70%] [80%] [90%] [100%]
Post filtering unreachable actions: [10%] [20%] [30%] [40%] [50%] [60%] [70%] [80%] [90%] [100%]
(total-time-taken) has a finite lower bound: [0.000,inf]
�[01;34mNo analytic limits found, not considering limit effects of goal-only operators�[00m
82% of the ground temporal actions in this problem are compression-safe
Initial heuristic = 36.000, admissible cost estimate 0.000
b (35.000 | 35.001)b (33.000 | 70.002)b (32.000 | 70.002)b (31.000 | 90.002)b (30.000 | 90.002)b (29.000 | 1310.004)b (28.000 | 2510.005)b (27.000 | 3110.005)b (26.000 | 3110.005)b (25.000 | 3110.005)b (24.000 | 3110.005)b (23.000 | 3110.005)b (22.000 | 4310.007)b (21.000 | 4310.007)b (20.000 | 4310.007)b (19.000 | 4310.007)b (18.000 | 6110.008)b (17.000 | 6110.008)b (16.000 | 6110.008)b (15.000 | 6110.008)b (14.000 | 8510.009)b (12.000 | 8510.009)b (11.000 | 8510.009)b (10.000 | 8510.009)b (9.000 | 8510.009)b (8.000 | 8510.009)b (6.000 | 8510.009)b (5.000 | 8510.009)b (3.000 | 8510.009)b (2.000 | 8510.010)b (1.000 | 8540.011)(G);;;; Solution Found
; States evaluated: 989
; Cost: 8540.012
; Time 0.74
0.000: (move waiter1 kitchen1 table3) [20.000]
0.000: (move waiter2 kitchen1 table3) [20.000]
0.000: (move waiter3 kitchen1 table3) [20.000]
20.001: (takeorder waiter1 table3 order3) [15.000]
20.001: (move waiter2 table3 table5) [10.000]
20.001: (move waiter3 table3 kitchen1) [20.000]
30.002: (move waiter2 table5 table6) [10.000]
35.001: (move waiter1 table3 table1) [10.000]
40.002: (takeorder waiter2 table6 order6) [30.000]
40.002: (move waiter3 kitchen1 table4) [20.000]
45.002: (move waiter1 table1 kitchen1) [10.000]
55.003: (delivertocounter counter1 waiter1 kitchen1 order3) [0.001]
55.004: (move waiter1 kitchen1 table2) [10.000]
60.002: (takeorder waiter3 table4 order4) [30.000]
65.004: (takeorder waiter1 table2 order2) [45.000]
70.002: (move waiter2 table6 kitchen1) [30.000]
90.002: (move waiter3 table4 kitchen1) [20.000]
100.003: (delivertocounter counter1 waiter2 kitchen1 order6) [0.001]
100.004: (move waiter2 kitchen1 table1) [10.000]
110.003: (delivertocounter counter1 waiter3 kitchen1 order4) [0.001]
110.004: (move waiter1 table2 table4) [10.000]
110.004: (cook kitchen1 order4 counter1) [1200.000]
110.004: (takeorder waiter2 table1 order1) [30.000]
110.004: (move waiter3 kitchen1 table5) [30.000]
120.005: (move waiter1 table4 kitchen1) [20.000]
140.004: (move waiter2 table1 kitchen1) [10.000]
140.004: (takeorder waiter3 table5 order5) [60.000]
140.006: (delivertocounter counter1 waiter1 kitchen1 order2) [0.001]
150.005: (delivertocounter counter1 waiter2 kitchen1 order1) [0.001]
200.004: (move waiter3 table5 kitchen1) [30.000]
230.005: (delivertocounter counter1 waiter3 kitchen1 order5) [0.001]
1310.005: (takefromcounter counter1 waiter1 kitchen1 order4) [0.001]
1310.005: (cook kitchen1 order6 counter1) [1200.000]
1310.006: (move waiter1 kitchen1 table4) [20.000]
1330.007: (delivertotable waiter1 table4 order4) [0.001]
1330.008: (move waiter1 table4 kitchen1) [20.000]
2510.006: (cook kitchen1 order3 counter1) [600.000]
2510.006: (takefromcounter counter1 waiter1 kitchen1 order6) [0.001]
2510.007: (move waiter1 kitchen1 table6) [30.000]
2540.008: (delivertotable waiter1 table6 order6) [0.001]
2540.009: (move waiter1 table6 table5) [10.000]
2550.010: (move waiter1 table5 kitchen1) [30.000]
3110.007: (cook kitchen1 order1 counter1) [1200.000]
3110.007: (takefromcounter counter1 waiter1 kitchen1 order3) [0.001]
3110.008: (move waiter1 kitchen1 table3) [20.000]
3130.009: (delivertotable waiter1 table3 order3) [0.001]
3130.010: (move waiter1 table3 kitchen1) [20.000]
4310.008: (cook kitchen1 order2 counter1) [1800.000]
4310.008: (takefromcounter counter1 waiter1 kitchen1 order1) [0.001]
4310.009: (move waiter1 kitchen1 table1) [10.000]
4320.010: (delivertotable waiter1 table1 order1) [0.001]
4320.011: (move waiter1 table1 kitchen1) [10.000]
6110.009: (cook kitchen1 order5 counter1) [2400.000]
6110.009: (takefromcounter counter1 waiter1 kitchen1 order2) [0.001]
6110.010: (move waiter1 kitchen1 table2) [10.000]
6120.011: (delivertotable waiter1 table2 order2) [0.001]
6120.012: (move waiter1 table2 kitchen1) [10.000]
8510.010: (takefromcounter counter1 waiter1 kitchen1 order5) [0.001]
8510.011: (move waiter1 kitchen1 table5) [30.000]
8540.012: (delivertotable waiter1 table5 order5) [0.001]
Executing Problem 6
Number of literals: 45
Constructing lookup tables: [10%] [20%] [30%] [40%] [50%] [60%] [70%] [80%] [90%] [100%]
Post filtering unreachable actions: [10%] [20%] [30%] [40%] [50%] [60%] [70%] [80%] [90%] [100%]
(total-time-taken) has a finite lower bound: [0.000,inf]
�[01;34mNo analytic limits found, not considering limit effects of goal-only operators�[00m
84% of the ground temporal actions in this problem are compression-safe
Initial heuristic = 24.000, admissible cost estimate 0.000
b (23.000 | 70.001)b (22.000 | 70.001)b (21.000 | 70.001)b (20.000 | 70.001)b (19.000 | 2480.003)b (18.000 | 2480.003)b (17.000 | 2480.003)b (16.000 | 3680.004)b (15.000 | 5480.005)b (14.000 | 5480.005)b (13.000 | 5480.005)b (12.000 | 5480.005)b (11.000 | 6080.006)b (10.000 | 6080.006)b (9.000 | 6080.006)b (8.000 | 6080.006)b (7.000 | 6080.006)b (6.000 | 6080.006)b (5.000 | 6080.006)b (4.000 | 6080.006)b (3.000 | 6080.006)b (2.000 | 6080.007)b (1.000 | 6115.008)(G);;;; Solution Found
; States evaluated: 167
; Cost: 6115.009
; Time 0.10
0.000: (move waiter1 kitchen1 table3) [15.000]
0.000: (move waiter2 kitchen1 table1) [10.000]
10.001: (takeorder waiter2 table1 order1) [60.000]
15.001: (takeorder waiter1 table3 order3) [45.000]
60.001: (move waiter1 table3 table4) [20.000]
70.001: (move waiter2 table1 kitchen1) [10.000]
80.002: (delivertocounter counter1 waiter2 kitchen1 order1) [0.001]
80.002: (move waiter1 table4 kitchen1) [35.000]
80.003: (cook kitchen1 order1 counter1) [2400.000]
80.003: (move waiter2 kitchen1 table2) [20.000]
100.003: (takeorder waiter2 table2 order2) [30.000]
115.003: (delivertocounter counter1 waiter1 kitchen1 order3) [0.001]
115.004: (move waiter1 kitchen1 table4) [35.000]
130.003: (move waiter2 table2 kitchen1) [20.000]
150.004: (delivertocounter counter1 waiter2 kitchen1 order2) [0.001]
150.004: (takeorder waiter1 table4 order4) [15.000]
165.004: (move waiter1 table4 kitchen1) [35.000]
200.005: (delivertocounter counter1 waiter1 kitchen1 order4) [0.001]
2480.004: (cook kitchen1 order2 counter1) [1200.000]
2480.004: (takefromcounter counter1 waiter1 kitchen1 order1) [0.001]
2480.005: (move waiter1 kitchen1 table1) [10.000]
2490.006: (delivertotable waiter1 table1 order1) [0.001]
2490.007: (move waiter1 table1 table4) [45.000]
2535.008: (move waiter1 table4 kitchen1) [35.000]
3680.005: (cook kitchen1 order3 counter1) [1800.000]
3680.005: (takefromcounter counter1 waiter1 kitchen1 order2) [0.001]
3680.006: (move waiter1 kitchen1 table2) [20.000]
3700.007: (delivertotable waiter1 table2 order2) [0.001]
3700.008: (move waiter1 table2 table4) [15.000]
3715.009: (move waiter1 table4 kitchen1) [35.000]
5480.006: (cook kitchen1 order4 counter1) [600.000]
5480.006: (takefromcounter counter1 waiter1 kitchen1 order3) [0.001]
5480.007: (move waiter1 kitchen1 table3) [15.000]
5495.008: (delivertotable waiter1 table3 order3) [0.001]
5495.009: (move waiter1 table3 table4) [20.000]
5515.010: (move waiter1 table4 kitchen1) [35.000]
6080.007: (takefromcounter counter1 waiter1 kitchen1 order4) [0.001]
6080.008: (move waiter1 kitchen1 table4) [35.000]
6115.009: (delivertotable waiter1 table4 order4) [0.001]