Skip to content

Latest Execution of Plan Saturday, April 3rd, 09:52:29 #43

@github-actions

Description

@github-actions

Below is the output from the latest plan execution

Output

Executing Problem 1

Number of literals: 32
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%]
No semaphore facts found, returning
(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
All the ground actions in this problem are compression-safe
Initial heuristic = 10.000, admissible cost estimate 0.000
b (9.000 | 20.001)b (8.000 | 30.001)b (7.000 | 41.004)b (6.000 | 41.005)b (5.000 | 61.006)b (4.000 | 61.007)b (3.000 | 62.004)b (2.000 | 62.005)b (1.000 | 92.006)(G);;;; Solution Found
; States evaluated: 37
; Cost: 92.007
; Time 0.02
0.000: (move waiter1 kitchen1 table1)  [20.000]
0.000: (move waiter2 kitchen1 table2)  [30.000]
20.001: (takeorder waiter1 table1 order1)  [0.001]
20.002: (move waiter1 table1 kitchen1)  [20.000]
30.001: (takeorder waiter2 table2 order2)  [0.001]
30.002: (move waiter2 table2 kitchen1)  [30.000]
40.003: (delivertocook waiter1 kitchen1 order1)  [0.001]
40.004: (cook kitchen1 order1)  [1.000]
41.005: (takefromcook waiter3 kitchen1 order1)  [0.001]
41.006: (move waiter3 kitchen1 table1)  [20.000]
60.003: (delivertocook waiter2 kitchen1 order2)  [0.001]
60.004: (cook kitchen1 order2)  [2.000]
61.007: (delivertotable waiter3 table1 order1)  [0.001]
62.005: (takefromcook waiter1 kitchen1 order2)  [0.001]
62.006: (move waiter1 kitchen1 table2)  [30.000]
92.007: (delivertotable waiter1 table2 order2)  [0.001]

Executing Problem 2

Number of literals: 106
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%]
No semaphore facts found, returning
(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
All the ground actions in this problem are compression-safe
Initial heuristic = 38.000, admissible cost estimate 0.000
b (32.000 | 10.000)b (31.000 | 10.001)b (30.000 | 20.003)b (29.000 | 52.004)b (28.000 | 52.005)b (27.000 | 62.006)b (26.000 | 62.007)b (25.000 | 62.007)b (24.000 | 62.007)b (23.000 | 62.007)b (22.000 | 62.007)b (21.000 | 62.007)b (20.000 | 67.008)b (19.000 | 67.009)b (18.000 | 67.009)b (17.000 | 68.006)b (16.000 | 89.012)b (15.000 | 89.012)b (14.000 | 89.012)b (13.000 | 89.012)b (12.000 | 89.012)b (11.000 | 106.018)b (10.000 | 116.019)b (9.000 | 121.020)b (8.000 | 121.021)b (7.000 | 121.021)b (6.000 | 121.021)b (5.000 | 121.021)b (4.000 | 121.021)b (3.000 | 121.021)b (2.000 | 121.021)b (1.000 | 121.021)(G);;;; Solution Found
; States evaluated: 7556
; Cost: 121.021
; Time 13.45
0.000: (move waiter3 kitchen2 kitchen1)  [5.000]
0.000: (move waiter4 kitchen2 table6)  [10.000]
0.000: (move waiter1 kitchen1 kitchen2)  [5.000]
0.000: (move waiter2 kitchen1 table5)  [10.000]
5.001: (move waiter3 kitchen1 table5)  [10.000]
10.001: (takeorder waiter4 table6 order6)  [0.001]
10.001: (takeorder waiter2 table5 order5)  [0.001]
10.002: (move waiter4 table6 kitchen2)  [10.000]
10.002: (move waiter2 table5 table4)  [3.000]
13.003: (move waiter2 table4 table5)  [3.000]
15.002: (move waiter3 table5 kitchen1)  [10.000]
16.004: (move waiter2 table5 kitchen1)  [10.000]
20.003: (delivertocook waiter4 kitchen2 order6)  [0.001]
20.004: (cook kitchen2 order6)  [32.000]
20.004: (move waiter4 kitchen2 kitchen1)  [5.000]
25.003: (move waiter3 kitchen1 kitchen2)  [5.000]
25.005: (move waiter4 kitchen1 kitchen2)  [5.000]
26.005: (delivertocook waiter2 kitchen1 order5)  [0.001]
26.006: (cook kitchen1 order5)  [14.000]
30.004: (move waiter3 kitchen2 table1)  [10.000]
30.006: (move waiter4 kitchen2 table6)  [10.000]
40.005: (takeorder waiter3 table1 order1)  [0.001]
40.006: (move waiter3 table1 kitchen2)  [10.000]
40.007: (takefromcook waiter2 kitchen1 order5)  [0.001]
40.007: (move waiter4 table6 table2)  [9.000]
40.008: (move waiter2 kitchen1 table5)  [10.000]
49.008: (takeorder waiter4 table2 order2)  [0.001]
49.009: (move waiter4 table2 table5)  [7.000]
50.009: (delivertotable waiter2 table5 order5)  [0.001]
50.010: (move waiter2 table5 table3)  [5.000]
52.005: (takefromcook waiter1 kitchen2 order6)  [0.001]
52.005: (delivertocook waiter3 kitchen2 order1)  [0.001]
52.006: (move waiter1 kitchen2 table6)  [10.000]
52.006: (move waiter3 kitchen2 table1)  [10.000]
52.006: (cook kitchen2 order1)  [16.000]
55.011: (takeorder waiter2 table3 order3)  [0.001]
55.012: (move waiter2 table3 table1)  [5.000]
56.010: (move waiter4 table5 kitchen1)  [10.000]
60.013: (move waiter2 table1 kitchen2)  [10.000]
62.007: (delivertotable waiter1 table6 order6)  [0.001]
62.007: (move waiter3 table1 table3)  [5.000]
62.008: (move waiter1 table6 table4)  [5.000]
66.011: (delivertocook waiter4 kitchen1 order2)  [0.001]
66.012: (cook kitchen1 order2)  [23.000]
66.012: (move waiter4 kitchen1 table5)  [10.000]
67.008: (move waiter3 table3 table1)  [5.000]
67.009: (takeorder waiter1 table4 order4)  [0.001]
67.010: (move waiter1 table4 table6)  [5.000]
70.014: (delivertocook waiter2 kitchen2 order3)  [0.001]
70.015: (cook kitchen2 order3)  [14.000]
70.015: (takefromcook waiter2 kitchen2 order1)  [0.001]
70.016: (move waiter2 kitchen2 table1)  [10.000]
72.009: (move waiter3 table1 kitchen2)  [10.000]
72.011: (move waiter1 table6 kitchen2)  [10.000]
76.013: (move waiter4 table5 table6)  [3.000]
79.014: (move waiter4 table6 table3)  [7.000]
80.017: (delivertotable waiter2 table1 order1)  [0.001]
80.018: (move waiter2 table1 table3)  [5.000]
84.016: (delivertocook waiter1 kitchen2 order4)  [0.001]
84.016: (takefromcook waiter3 kitchen2 order3)  [0.001]
84.017: (cook kitchen2 order4)  [22.000]
84.017: (move waiter3 kitchen2 table1)  [10.000]
85.019: (move waiter2 table3 table5)  [5.000]
86.015: (move waiter4 table3 table5)  [5.000]
90.020: (move waiter2 table5 kitchen1)  [10.000]
91.016: (move waiter4 table5 kitchen1)  [10.000]
94.018: (move waiter3 table1 table3)  [5.000]
99.019: (delivertotable waiter3 table3 order3)  [0.001]
99.020: (move waiter3 table3 table2)  [3.000]
100.021: (takefromcook waiter2 kitchen1 order2)  [0.001]
100.022: (move waiter2 kitchen1 table5)  [10.000]
106.018: (takefromcook waiter1 kitchen2 order4)  [0.001]
106.019: (move waiter1 kitchen2 table6)  [10.000]
110.023: (move waiter2 table5 table2)  [7.000]
116.020: (move waiter1 table6 table4)  [5.000]
117.024: (delivertotable waiter2 table2 order2)  [0.001]
121.021: (delivertotable waiter1 table4 order4)  [0.001]

Executing Problem 3

Number of literals: 790
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%]
No semaphore facts found, returning
(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
All the ground actions in this problem are compression-safe
Initial heuristic = 156.000, admissible cost estimate 0.000
b (154.000 | 10.000)b (145.000 | 10.000)b (139.000 | 10.000)b (138.000 | 10.001)b (137.000 | 10.001)b (136.000 | 10.001)b (132.000 | 10.001)b (125.000 | 10.001)b (124.000 | 10.001)b (123.000 | 10.001)b (122.000 | 20.003)b (121.000 | 26.004)b (120.000 | 26.005)b (119.000 | 36.006)b (118.000 | 36.007)b (117.000 | 36.007)b (116.000 | 36.007)b (115.000 | 36.007)b (114.000 | 36.007)b (113.000 | 36.007)b (112.000 | 36.007)b (111.000 | 36.007)b (110.000 | 36.007)b (109.000 | 36.007)b (108.000 | 37.008)b (107.000 | 37.009)```



Executing Problem 4



Number of literals: 56
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%]
No semaphore facts found, returning
(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
All the ground actions in this problem are compression-safe
Initial heuristic = 20.000, admissible cost estimate 0.000
b (19.000 | 20.001)b (18.000 | 20.001)b (17.000 | 40.001)b (16.000 | 42.004)b (15.000 | 62.006)b (14.000 | 100.003)b (13.000 | 100.003)b (12.000 | 122.009)b (11.000 | 122.009)b (10.000 | 122.009)b (9.000 | 124.006)b (8.000 | 124.007)b (7.000 | 124.007)b (6.000 | 124.007)b (5.000 | 141.008)b (4.000 | 141.009)b (3.000 | 165.012)b (2.000 | 184.009)b (1.000 | 205.014)(G);;;; Solution Found
; States evaluated: 191
; Cost: 205.015
; Time 0.12
0.000: (move waiter1 kitchen1 table2) [20.000]
0.000: (move waiter2 kitchen1 table1) [20.000]
0.000: (move waiter3 kitchen1 table4) [40.000]
20.001: (takeorder waiter1 table2 order2) [0.001]
20.001: (takeorder waiter2 table1 order1) [0.001]
20.002: (move waiter1 table2 kitchen1) [20.000]
20.002: (move waiter2 table1 table3) [40.000]
40.001: (takeorder waiter3 table4 order4) [0.001]
40.002: (move waiter3 table4 kitchen1) [40.000]
40.003: (delivertocook waiter1 kitchen1 order2) [0.001]
40.004: (cook kitchen1 order2) [2.000]
42.005: (takefromcook waiter1 kitchen1 order2) [0.001]
42.006: (move waiter1 kitchen1 table2) [20.000]
60.003: (move waiter2 table3 table1) [40.000]
62.007: (delivertotable waiter1 table2 order2) [0.001]
62.008: (move waiter1 table2 table3) [60.000]
80.003: (delivertocook waiter3 kitchen1 order4) [0.001]
80.004: (cook kitchen1 order4) [4.000]
84.005: (takefromcook waiter3 kitchen1 order4) [0.001]
84.006: (move waiter3 kitchen1 table4) [40.000]
100.004: (move waiter2 table1 kitchen1) [20.000]
120.005: (delivertocook waiter2 kitchen1 order1) [0.001]
120.006: (cook kitchen1 order1) [1.000]
121.007: (takefromcook waiter2 kitchen1 order1) [0.001]
121.008: (move waiter2 kitchen1 table1) [20.000]
122.009: (takeorder waiter1 table3 order3) [0.001]
122.010: (move waiter1 table3 kitchen1) [40.000]
124.007: (delivertotable waiter3 table4 order4) [0.001]
124.008: (move waiter3 table4 table3) [20.000]
141.009: (delivertotable waiter2 table1 order1) [0.001]
141.010: (move waiter2 table1 kitchen1) [20.000]
144.009: (move waiter3 table3 kitchen1) [40.000]
162.011: (delivertocook waiter1 kitchen1 order3) [0.001]
162.012: (cook kitchen1 order3) [3.000]
165.013: (takefromcook waiter2 kitchen1 order3) [0.001]
165.014: (move waiter2 kitchen1 table3) [40.000]
205.015: (delivertotable waiter2 table3 order3) [0.001]




Executing Problem 5



Number of literals: 80
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%]
No semaphore facts found, returning
(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
All the ground actions in this problem are compression-safe
Initial heuristic = 30.000, admissible cost estimate 0.000
b (29.000 | 20.001)b (28.000 | 20.001)b (27.000 | 40.003)b (26.000 | 44.004)b (25.000 | 44.005)b (24.000 | 64.006)b (23.000 | 64.007)b (22.000 | 64.007)b (21.000 | 67.008)b (20.000 | 67.009)b (19.000 | 84.008)b (18.000 | 84.008)b (16.000 | 87.012)b (15.000 | 105.008)b (13.000 | 105.009)b (12.000 | 105.009)b (11.000 | 105.009)b (10.000 | 110.017)b (9.000 | 114.012)b (8.000 | 114.012)b (7.000 | 126.015)b (6.000 | 130.019)b (5.000 | 136.017)b (4.000 | 136.018)b (3.000 | 146.019)b (2.000 | 146.019)b (1.000 | 172.014)(G);;;; Solution Found
; States evaluated: 729
; Cost: 172.015
; Time 0.53
0.000: (move waiter1 kitchen1 table4) [20.000]
0.000: (move waiter2 kitchen1 table3) [20.000]
0.000: (move waiter3 kitchen1 table6) [30.000]
20.001: (takeorder waiter1 table4 order4) [0.001]
20.001: (takeorder waiter2 table3 order3) [0.001]
20.002: (move waiter1 table4 kitchen1) [20.000]
20.002: (move waiter2 table3 kitchen1) [20.000]
30.001: (takeorder waiter3 table6 order6) [0.001]
30.002: (move waiter3 table6 kitchen1) [30.000]
40.003: (delivertocook waiter1 kitchen1 order4) [0.001]
40.004: (cook kitchen1 order4) [4.000]
44.005: (takefromcook waiter1 kitchen1 order4) [0.001]
44.005: (delivertocook waiter2 kitchen1 order3) [0.001]
44.006: (cook kitchen1 order3) [3.000]
44.006: (move waiter1 kitchen1 table4) [20.000]
47.007: (takefromcook waiter2 kitchen1 order3) [0.001]
47.008: (move waiter2 kitchen1 table3) [20.000]
60.003: (delivertocook waiter3 kitchen1 order6) [0.001]
60.004: (cook kitchen1 order6) [5.000]
64.007: (delivertotable waiter1 table4 order4) [0.001]
64.008: (move waiter1 table4 kitchen1) [20.000]
65.005: (takefromcook waiter3 kitchen1 order6) [0.001]
65.006: (move waiter3 kitchen1 table6) [30.000]
67.009: (delivertotable waiter2 table3 order3) [0.001]
67.010: (move waiter2 table3 table4) [10.000]
77.011: (move waiter2 table4 table2) [10.000]
84.009: (move waiter1 kitchen1 table1) [10.000]
87.012: (takeorder waiter2 table2 order2) [0.001]
87.013: (move waiter2 table2 kitchen1) [10.000]
94.010: (takeorder waiter1 table1 order1) [0.001]
94.011: (move waiter1 table1 table2) [10.000]
95.007: (delivertotable waiter3 table6 order6) [0.001]
95.008: (move waiter3 table6 table5) [10.000]
97.014: (delivertocook waiter2 kitchen1 order2) [0.001]
97.015: (cook kitchen1 order2) [3.000]
100.016: (takefromcook waiter2 kitchen1 order2) [0.001]
100.017: (move waiter2 kitchen1 table2) [10.000]
104.012: (move waiter1 table2 table1) [10.000]
105.009: (takeorder waiter3 table5 order5) [0.001]
105.010: (move waiter3 table5 kitchen1) [30.000]
110.018: (delivertotable waiter2 table2 order2) [0.001]
110.019: (move waiter2 table2 table1) [10.000]
114.013: (move waiter1 table1 kitchen1) [10.000]
120.020: (move waiter2 table1 kitchen1) [10.000]
124.014: (delivertocook waiter1 kitchen1 order1) [0.001]
124.015: (cook kitchen1 order1) [2.000]
126.016: (takefromcook waiter1 kitchen1 order1) [0.001]
126.017: (move waiter1 kitchen1 table1) [10.000]
135.011: (delivertocook waiter3 kitchen1 order5) [0.001]
135.012: (cook kitchen1 order5) [7.000]
136.018: (delivertotable waiter1 table1 order1) [0.001]
136.019: (move waiter1 table1 table3) [10.000]
142.013: (takefromcook waiter2 kitchen1 order5) [0.001]
142.014: (move waiter2 kitchen1 table5) [30.000]
172.015: (delivertotable waiter2 table5 order5) [0.001]




Executing Problem 6



Number of literals: 46
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%]
No semaphore facts found, returning
(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
All the ground actions in this problem are compression-safe
Initial heuristic = 20.000, admissible cost estimate 0.000
b (19.000 | 10.001)b (18.000 | 15.001)b (17.000 | 21.004)b (16.000 | 21.005)b (15.000 | 31.006)b (14.000 | 31.007)b (13.000 | 33.004)b (12.000 | 33.005)b (11.000 | 63.007)b (10.000 | 63.007)b (9.000 | 63.007)b (8.000 | 83.012)b (7.000 | 83.013)b (6.000 | 103.014)b (5.000 | 103.015)b (4.000 | 116.013)b (3.000 | 155.016)b (2.000 | 155.017)b (1.000 | 190.018)(G);;;; Solution Found
; States evaluated: 117
; Cost: 190.019
; Time 0.07
0.000: (move waiter1 kitchen1 table1) [10.000]
0.000: (move waiter2 kitchen1 table3) [15.000]
10.001: (takeorder waiter1 table1 order1) [0.001]
10.002: (move waiter1 table1 kitchen1) [10.000]
15.001: (takeorder waiter2 table3 order3) [0.001]
15.002: (move waiter2 table3 kitchen1) [15.000]
20.003: (delivertocook waiter1 kitchen1 order1) [0.001]
20.004: (cook kitchen1 order1) [1.000]
21.005: (takefromcook waiter1 kitchen1 order1) [0.001]
21.006: (move waiter1 kitchen1 table1) [10.000]
30.003: (delivertocook waiter2 kitchen1 order3) [0.001]
30.004: (cook kitchen1 order3) [3.000]
31.007: (delivertotable waiter1 table1 order1) [0.001]
31.008: (move waiter1 table1 table2) [30.000]
33.005: (takefromcook waiter2 kitchen1 order3) [0.001]
33.006: (move waiter2 kitchen1 table3) [15.000]
48.007: (delivertotable waiter2 table3 order3) [0.001]
48.008: (move waiter2 table3 kitchen1) [15.000]
61.009: (takeorder waiter1 table2 order2) [0.001]
61.010: (move waiter1 table2 kitchen1) [20.000]
81.011: (delivertocook waiter1 kitchen1 order2) [0.001]
81.012: (cook kitchen1 order2) [2.000]
81.012: (move waiter1 kitchen1 table4) [35.000]
83.013: (takefromcook waiter2 kitchen1 order2) [0.001]
83.014: (move waiter2 kitchen1 table2) [20.000]
103.015: (delivertotable waiter2 table2 order2) [0.001]
103.016: (move waiter2 table2 table4) [15.000]
116.013: (takeorder waiter1 table4 order4) [0.001]
116.014: (move waiter1 table4 kitchen1) [35.000]
118.017: (move waiter2 table4 kitchen1) [35.000]
151.015: (delivertocook waiter1 kitchen1 order4) [0.001]
151.016: (cook kitchen1 order4) [4.000]
155.017: (takefromcook waiter1 kitchen1 order4) [0.001]
155.018: (move waiter1 kitchen1 table4) [35.000]
190.019: (delivertotable waiter1 table4 order4) [0.001]




Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions