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

52 lines
1.9 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-11.pddlignoring --stats
ignoring --verbose
-m 8192
Domain: transport-strips
Problem: transport-l6-t1-p6---int100n150-m25---int100c110---s1---e0
Parser: 952 ground actions and 2099 state variables
Invariants: 0 1 2 3 4 5 6 7 0.02 secs
Goal: conjunctive
Simplified: 770 ground actions and 106 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 126 MB)
Horizon 0: 106 variables
0 UNSAT (0 decisions 0 conflicts)
Horizon 5: 4486 variables
Allocated 32 MB (total 312 MB)
5 UNSAT (2 decisions 2 conflicts)
Horizon 10: 8866 variables
Horizon 15: 13246 variables
Horizon 20: 17626 variables
Horizon 25: 22006 variables
Horizon 30: 26386 variables
Horizon 35: 30766 variables
Horizon 40: 35146 variables
SAT (660 decisions 406 conflicts)
PLAN FOUND: 10 steps
STEP 0.0: load(p0,t0,l2) load(p1,t0,l2)
STEP 0.1: drive(t0,l2,l5,level48,level13,level61)
STEP 1.0: load(p5,t0,l5)
STEP 1.1: drive(t0,l5,l1,level37,level11,level48)
STEP 2.0: load(p2,t0,l1)
STEP 2.1: drive(t0,l1,l4,level25,level12,level37)
STEP 3.0: unload(p1,t0,l4) unload(p5,t0,l4)
STEP 3.1: drive(t0,l4,l3,level20,level5,level25)
STEP 4.0: load(p3,t0,l3) load(p4,t0,l3) unload(p0,t0,l3) unload(p2,t0,l3)
STEP 4.1: drive(t0,l3,l4,level15,level5,level20)
STEP 5: drive(t0,l4,l1,level3,level12,level15)
STEP 6: drive(t0,l1,l2,level0,level3,level3)
STEP 7: unload(p3,t0,l2) unload(p4,t0,l2)
19 actions in the plan.
Cost of the plan is 19.
total time 0.72 preprocess 0.56
total size 0.913 GB
max. learned clause length 10003
t val conflicts decisions
0 0 0 0
5 0 2 2
10 1 406 660