1
0
Fork 0
tplp-planning-benchmark/m-mp/ipc-2011_scanalyzer-3d-sequ...

43 lines
2.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/scanalyzer-3d-sequential-satisficing/domain.pddl file:/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/scanalyzer-3d-sequential-satisficing/instances/instance-6.pddlignoring --stats
ignoring --verbose
-m 8192
Domain: scanalyzer3d
Problem: scanalyzer3d-57
Parser: 24576 ground actions and 78 state variables
Invariants: 0 1 2 0.12 secs
Goal: conjunctive
Simplified: 24544 ground actions and 72 state variables
Actions: STRIPS
Disabling graph %: 10 20 30 40 50 60 70 80 90 100 2.61 secs (max SCC size 384)
Plan type: E-step
Allocated 32 MB permanent (total 436 MB)
Horizon 0: 72 variables
0 UNSAT (0 decisions 0 conflicts)
Horizon 5: 542992 variables
5 UNSAT (0 decisions 0 conflicts)
Horizon 10: 1085912 variables
Allocated 32 MB (total 831 MB)
SAT (21 decisions 8 conflicts)
PLAN FOUND: 10 steps
STEP 0: analyze-4(seg-in-2a,seg-in-2b,seg-out-1a,seg-out-1b,car-in-2a,car-in-2b,car-out-1a,car-out-1b) rotate-4(seg-in-1a,seg-in-1b,seg-out-2a,seg-out-2b,car-in-1a,car-in-1b,car-out-2a,car-out-2b)
STEP 1: rotate-4(seg-in-1a,seg-in-1b,seg-out-1a,seg-out-1b,car-in-1b,car-out-2a,car-out-1b,car-in-2a) rotate-4(seg-in-2a,seg-in-2b,seg-out-2a,seg-out-2b,car-in-2b,car-out-1a,car-out-2b,car-in-1a)
STEP 2: analyze-4(seg-in-2a,seg-in-2b,seg-out-1a,seg-out-1b,car-out-1a,car-out-2b,car-in-2a,car-in-1b) rotate-4(seg-in-1a,seg-in-1b,seg-out-2a,seg-out-2b,car-out-2a,car-out-1b,car-in-1a,car-in-2b)
STEP 3: analyze-4(seg-in-2a,seg-in-2b,seg-out-1a,seg-out-1b,car-out-2b,car-in-2a,car-in-1b,car-out-1a) rotate-4(seg-in-1a,seg-in-1b,seg-out-2a,seg-out-2b,car-out-1b,car-in-1a,car-in-2b,car-out-2a)
STEP 4: analyze-4(seg-in-2a,seg-in-2b,seg-out-1a,seg-out-1b,car-in-2a,car-in-1b,car-out-1a,car-out-2b) rotate-4(seg-in-1a,seg-in-1b,seg-out-2a,seg-out-2b,car-in-1a,car-in-2b,car-out-2a,car-out-1b)
STEP 5: analyze-4(seg-in-2a,seg-in-2b,seg-out-1a,seg-out-1b,car-in-1b,car-out-1a,car-out-2b,car-in-2a)
STEP 6: analyze-4(seg-in-1a,seg-in-1b,seg-out-1a,seg-out-1b,car-in-2b,car-out-2a,car-in-2a,car-in-1b) rotate-4(seg-in-2a,seg-in-2b,seg-out-2a,seg-out-2b,car-out-1a,car-out-2b,car-out-1b,car-in-1a)
STEP 7: analyze-4(seg-in-1a,seg-in-1b,seg-out-1a,seg-out-1b,car-out-2a,car-in-2a,car-in-1b,car-in-2b) rotate-4(seg-in-2a,seg-in-2b,seg-out-2a,seg-out-2b,car-out-2b,car-out-1b,car-in-1a,car-out-1a)
STEP 8: analyze-4(seg-in-2a,seg-in-2b,seg-out-1a,seg-out-1b,car-out-1b,car-in-1a,car-in-2b,car-out-2a) rotate-4(seg-in-1a,seg-in-1b,seg-out-2a,seg-out-2b,car-in-2a,car-in-1b,car-out-1a,car-out-2b)
STEP 9: analyze-4(seg-in-2a,seg-in-2b,seg-out-1a,seg-out-1b,car-in-1a,car-in-2b,car-out-2a,car-out-1b)
18 actions in the plan.
Cost of the plan is 36.
total time 3.80 preprocess 2.89
total size 1.060 GB
max. learned clause length 7775
t val conflicts decisions
0 0 0 0
5 0 0 0
10 1 8 21