tplp-planning-benchmark/m-mp/ipc-2011_no-mystery-sequential-satisficing_1.out

49 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-1.pddlignoring --stats
ignoring --verbose
-m 8192
Domain: transport-strips
Problem: transport-l6-t1-p6---int100n150-m25---int100c150---s1---e0
Parser: 1366 ground actions and 3824 state variables
Invariants: 0 1 2 3 4 5 6 7 0.05 secs
Goal: conjunctive
Simplified: 1184 ground actions and 129 state variables
Actions: STRIPS
Disabling graph %: 10 20 30 40 50 60 70 80 90 100 0.01 secs (max SCC size 1)
Plan type: E-step
Allocated 32 MB permanent (total 130 MB)
Horizon 0: 129 variables
0 UNSAT (0 decisions 0 conflicts)
Horizon 5: 6694 variables
Allocated 32 MB (total 316 MB)
5 UNSAT (3 decisions 3 conflicts)
Horizon 10: 13259 variables
SAT (36 decisions 19 conflicts)
PLAN FOUND: 10 steps
STEP 0.0: load(p0,t0,l2) load(p1,t0,l2)
STEP 0.1: drive(t0,l2,l4,level68,level16,level84)
STEP 1.0: unload(p1,t0,l4)
STEP 1.1: drive(t0,l4,l3,level63,level5,level68)
STEP 2.0: load(p3,t0,l3) load(p4,t0,l3) unload(p0,t0,l3)
STEP 2.1: drive(t0,l3,l4,level58,level5,level63)
STEP 3: drive(t0,l4,l2,level42,level16,level58)
STEP 4.0: unload(p3,t0,l2) unload(p4,t0,l2)
STEP 4.1: drive(t0,l2,l5,level29,level13,level42)
STEP 5.0: load(p5,t0,l5)
STEP 5.1: drive(t0,l5,l1,level18,level11,level29)
STEP 6.0: load(p2,t0,l1)
STEP 6.1: drive(t0,l1,l4,level6,level12,level18)
STEP 7.0: unload(p5,t0,l4)
STEP 7.1: drive(t0,l4,l3,level1,level5,level6)
STEP 8: unload(p2,t0,l3)
20 actions in the plan.
Cost of the plan is 20.
total time 3.28 preprocess 3.22
total size 477.000 MB
max. learned clause length 1515
t val conflicts decisions
0 0 0 0
5 0 3 3
10 1 19 36