Add benchmark result [m-mp | ipc-2011 | no-mystery-sequential-satisficing | 13]
This commit is contained in:
56
m-mp/ipc-2011_no-mystery-sequential-satisficing_13.out
Normal file
56
m-mp/ipc-2011_no-mystery-sequential-satisficing_13.out
Normal file
@@ -0,0 +1,56 @@
|
||||
Madagascar 0.99999 25/02/2015 09:46:27 amd64 1-core (no VSIDS)
|
||||
Options: file:/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/domain.pddl file:/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-13.pddlignoring --stats
|
||||
ignoring --verbose
|
||||
-m 8192
|
||||
Domain: transport-strips
|
||||
Problem: transport-l8-t1-p8---int100n150-m25---int100c110---s1---e0
|
||||
Parser: 2958 ground actions and 9172 state variables
|
||||
Invariants: 0 1 2 3 4 5 6 0.10 secs
|
||||
Goal: conjunctive
|
||||
Simplified: 2584 ground actions and 204 state variables
|
||||
Actions: STRIPS
|
||||
Disabling graph %: 10 20 30 40 50 60 70 80 90 100 0.05 secs (max SCC size 1)
|
||||
Plan type: E-step
|
||||
Allocated 32 MB permanent (total 144 MB)
|
||||
Horizon 0: 204 variables
|
||||
0 UNSAT (0 decisions 0 conflicts)
|
||||
Horizon 5: 14144 variables
|
||||
Allocated 32 MB (total 331 MB)
|
||||
5 UNSAT (3 decisions 3 conflicts)
|
||||
Horizon 10: 28084 variables
|
||||
Horizon 15: 42024 variables
|
||||
Horizon 20: 55964 variables
|
||||
SAT (117 decisions 71 conflicts)
|
||||
PLAN FOUND: 15 steps
|
||||
STEP 0: drive(t0,l2,l4,level120,level12,level132)
|
||||
STEP 1.0: load(p0,t0,l4) load(p2,t0,l4)
|
||||
STEP 1.1: drive(t0,l4,l1,level107,level13,level120)
|
||||
STEP 2.0: load(p1,t0,l1) load(p5,t0,l1) load(p7,t0,l1) unload(p0,t0,l1)
|
||||
STEP 2.1: drive(t0,l1,l6,level104,level3,level107)
|
||||
STEP 3.0: load(p4,t0,l6) unload(p7,t0,l6)
|
||||
STEP 3.1: drive(t0,l6,l5,level86,level18,level104)
|
||||
STEP 4.0: unload(p1,t0,l5)
|
||||
STEP 4.1: drive(t0,l5,l7,level76,level10,level86)
|
||||
STEP 5.0: load(p6,t0,l7) unload(p2,t0,l7)
|
||||
STEP 5.1: drive(t0,l7,l5,level66,level10,level76)
|
||||
STEP 6: drive(t0,l5,l6,level48,level18,level66)
|
||||
STEP 7.0: unload(p6,t0,l6)
|
||||
STEP 7.1: drive(t0,l6,l1,level45,level3,level48)
|
||||
STEP 8.0: unload(p4,t0,l1)
|
||||
STEP 8.1: drive(t0,l1,l0,level33,level12,level45)
|
||||
STEP 9.0: load(p3,t0,l0)
|
||||
STEP 9.1: drive(t0,l0,l1,level21,level12,level33)
|
||||
STEP 10.0: unload(p3,t0,l1)
|
||||
STEP 10.1: drive(t0,l1,l4,level8,level13,level21)
|
||||
STEP 11: unload(p5,t0,l4)
|
||||
27 actions in the plan.
|
||||
Cost of the plan is 27.
|
||||
total time 19.01 preprocess 18.85
|
||||
total size 669.000 MB
|
||||
max. learned clause length 8289
|
||||
t val conflicts decisions
|
||||
0 0 0 0
|
||||
5 0 3 3
|
||||
10 -1 180 235
|
||||
15 1 71 117
|
||||
|
Reference in New Issue
Block a user