58 lines
2.3 KiB
Plaintext
58 lines
2.3 KiB
Plaintext
|
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-4.pddlignoring --stats
|
||
|
|
ignoring --verbose
|
||
|
|
-m 8192
|
||
|
|
Domain: transport-strips
|
||
|
|
Problem: transport-l9-t1-p9---int100n150-m25---int100c150---s1---e0
|
||
|
|
Parser: 6030 ground actions and 29796 state variables
|
||
|
|
Invariants: 0 1 2 3 4 5 6 0.63 secs
|
||
|
|
Goal: conjunctive
|
||
|
|
Simplified: 5656 ground actions and 334 state variables
|
||
|
|
Actions: STRIPS
|
||
|
|
Disabling graph %: 10 20 30 40 50 60 70 80 90 100 0.40 secs (max SCC size 1)
|
||
|
|
Plan type: E-step
|
||
|
|
Allocated 32 MB permanent (total 193 MB)
|
||
|
|
Horizon 0: 334 variables
|
||
|
|
0 UNSAT (0 decisions 0 conflicts)
|
||
|
|
Horizon 5: 30284 variables
|
||
|
|
5 UNSAT (0 decisions 0 conflicts)
|
||
|
|
Horizon 10: 60234 variables
|
||
|
|
Allocated 32 MB (total 465 MB)
|
||
|
|
Horizon 15: 90184 variables
|
||
|
|
SAT (75 decisions 50 conflicts)
|
||
|
|
PLAN FOUND: 15 steps
|
||
|
|
STEP 0: drive(t0,l7,l5,level227,level14,level241)
|
||
|
|
STEP 1.0: load(p4,t0,l5) load(p5,t0,l5) load(p7,t0,l5)
|
||
|
|
STEP 1.1: drive(t0,l5,l0,level206,level21,level227)
|
||
|
|
STEP 2.0: load(p2,t0,l0)
|
||
|
|
STEP 2.1: drive(t0,l0,l6,level196,level10,level206)
|
||
|
|
STEP 3.0: load(p3,t0,l6) load(p6,t0,l6) load(p8,t0,l6) unload(p4,t0,l6)
|
||
|
|
STEP 3.1: drive(t0,l6,l0,level186,level10,level196)
|
||
|
|
STEP 4: drive(t0,l0,l5,level165,level21,level186)
|
||
|
|
STEP 5: drive(t0,l5,l7,level151,level14,level165)
|
||
|
|
STEP 6.0: unload(p5,t0,l7)
|
||
|
|
STEP 6.1: drive(t0,l7,l5,level137,level14,level151)
|
||
|
|
STEP 7: drive(t0,l5,l1,level134,level3,level137)
|
||
|
|
STEP 8: drive(t0,l1,l3,level109,level25,level134)
|
||
|
|
STEP 9.0: load(p0,t0,l3) unload(p7,t0,l3)
|
||
|
|
STEP 9.1: drive(t0,l3,l2,level95,level14,level109)
|
||
|
|
STEP 10.0: load(p1,t0,l2) unload(p2,t0,l2) unload(p3,t0,l2) unload(p8,t0,l2)
|
||
|
|
STEP 10.1: drive(t0,l2,l0,level85,level10,level95)
|
||
|
|
STEP 11.0: unload(p1,t0,l0)
|
||
|
|
STEP 11.1: drive(t0,l0,l5,level64,level21,level85)
|
||
|
|
STEP 12: drive(t0,l5,l4,level39,level25,level64)
|
||
|
|
STEP 13.0: unload(p0,t0,l4)
|
||
|
|
STEP 13.1: drive(t0,l4,l8,level21,level18,level39)
|
||
|
|
STEP 14: unload(p6,t0,l8)
|
||
|
|
32 actions in the plan.
|
||
|
|
Cost of the plan is 32.
|
||
|
|
total time 245.17 preprocess 244.63
|
||
|
|
total size 0.704 GB
|
||
|
|
max. learned clause length 8586
|
||
|
|
t val conflicts decisions
|
||
|
|
0 0 0 0
|
||
|
|
5 0 0 0
|
||
|
|
10 -1 120 127
|
||
|
|
15 1 50 75
|
||
|
|
|