46 lines
1.8 KiB
Plaintext
46 lines
1.8 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-2.pddlignoring --stats
|
|
ignoring --verbose
|
|
-m 8192
|
|
Domain: transport-strips
|
|
Problem: transport-l7-t1-p7---int100n150-m25---int100c150---s1---e0
|
|
Parser: 1852 ground actions and 5253 state variables
|
|
Invariants: 0 1 2 3 4 5 6 0.05 secs
|
|
Goal: conjunctive
|
|
Simplified: 1640 ground actions and 157 state variables
|
|
Actions: STRIPS
|
|
Disabling graph %: 10 20 30 40 50 60 70 80 90 100 0.02 secs (max SCC size 1)
|
|
Plan type: E-step
|
|
Allocated 32 MB permanent (total 134 MB)
|
|
Horizon 0: 157 variables
|
|
0 UNSAT (0 decisions 0 conflicts)
|
|
Horizon 5: 9142 variables
|
|
Allocated 32 MB (total 320 MB)
|
|
5 UNSAT (3 decisions 3 conflicts)
|
|
Horizon 10: 18127 variables
|
|
SAT (24 decisions 1 conflicts)
|
|
PLAN FOUND: 10 steps
|
|
STEP 0.0: load(p5,t0,l5)
|
|
STEP 0.1: drive(t0,l5,l4,level87,level12,level99)
|
|
STEP 1.0: load(p2,t0,l4) load(p6,t0,l4)
|
|
STEP 1.1: drive(t0,l4,l3,level79,level8,level87)
|
|
STEP 2.0: load(p0,t0,l3) load(p1,t0,l3)
|
|
STEP 2.1: drive(t0,l3,l1,level67,level12,level79)
|
|
STEP 3: drive(t0,l1,l2,level64,level3,level67)
|
|
STEP 4.0: load(p3,t0,l2) unload(p0,t0,l2) unload(p1,t0,l2)
|
|
STEP 4.1: drive(t0,l2,l6,level48,level16,level64)
|
|
STEP 5: drive(t0,l6,l0,level35,level13,level48)
|
|
STEP 6.0: load(p4,t0,l0) unload(p2,t0,l0) unload(p3,t0,l0) unload(p5,t0,l0) unload(p6,t0,l0)
|
|
STEP 6.1: drive(t0,l0,l3,level17,level18,level35)
|
|
STEP 7: unload(p4,t0,l3)
|
|
21 actions in the plan.
|
|
Cost of the plan is 21.
|
|
total time 5.13 preprocess 5.07
|
|
total size 487.000 MB
|
|
max. learned clause length 154
|
|
t val conflicts decisions
|
|
0 0 0 0
|
|
5 0 3 3
|
|
10 1 1 24
|
|
|