patrick/tplp-planning-benchmark
1
0
Fork 0
Code Issues Releases Activity

Add benchmark result [m-mp | ipc-2011 | scanalyzer-3d-sequential-satisficing | 3]

Browse Source
This commit is contained in:
Potassco Bot
2017-12-03 11:00:37 +01:00
parent 0f8c79ddb4
commit 5b85bbe7b3
3 changed files with 99 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

50
m-mp/ipc-2011_scanalyzer-3d-sequential-satisficing_3.out Normal file
View File

@@ -0,0 +1,50 @@
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-3.pddlignoring --stats
ignoring --verbose
-m 8192
Domain: scanalyzer3d
Problem: scanalyzer3d-16
Parser: 1088 ground actions and 89 state variables
Invariants: 0 1 2 3 0.00 secs
Goal: conjunctive
Simplified: 960 ground actions and 72 state variables
Actions: STRIPS
Disabling graph %: 10 20 30 40 50 60 70 80 90 100 0.00 secs (max SCC size 17)
Plan type: E-step
Allocated 32 MB permanent (total 126 MB)
Horizon 0: 72 variables
0 UNSAT (0 decisions 0 conflicts)
Horizon 5: 5232 variables
Allocated 32 MB (total 311 MB)
5 UNSAT (39 decisions 37 conflicts)
Horizon 10: 10392 variables
Horizon 15: 15552 variables
Horizon 20: 20712 variables
SAT (194 decisions 66 conflicts)
PLAN FOUND: 15 steps
STEP 0: rotate-2(seg-in-1,seg-out-2,car-in-1,car-out-2) rotate-2(seg-in-2,seg-out-4,car-in-2,car-out-4) rotate-2(seg-in-3,seg-out-1,car-in-3,car-out-1) rotate-2(seg-in-4,seg-out-3,car-in-4,car-out-3)
STEP 1: analyze-2(seg-in-1,seg-out-1,car-out-2,car-in-3) rotate-2(seg-in-2,seg-out-3,car-out-4,car-in-4) rotate-2(seg-in-3,seg-out-4,car-out-1,car-in-2) rotate-2(seg-in-4,seg-out-2,car-out-3,car-in-1)
STEP 2: rotate-2(seg-in-1,seg-out-2,car-in-3,car-out-3) rotate-2(seg-in-2,seg-out-1,car-in-4,car-out-2) rotate-2(seg-in-3,seg-out-3,car-in-2,car-out-4)
STEP 3: analyze-2(seg-in-1,seg-out-1,car-out-3,car-in-4) rotate-2(seg-in-3,seg-out-4,car-out-4,car-out-1) rotate-2(seg-in-4,seg-out-3,car-in-1,car-in-2)
STEP 4: rotate-2(seg-in-1,seg-out-4,car-in-4,car-out-4) rotate-2(seg-in-3,seg-out-3,car-out-1,car-in-1) rotate-2(seg-in-4,seg-out-1,car-in-2,car-out-3)
STEP 5: analyze-2(seg-in-1,seg-out-1,car-out-4,car-in-2) rotate-2(seg-in-3,seg-out-4,car-in-1,car-in-4) rotate-2(seg-in-4,seg-out-3,car-out-3,car-out-1)
STEP 6: rotate-2(seg-in-1,seg-out-4,car-in-2,car-in-1) rotate-2(seg-in-2,seg-out-1,car-out-2,car-out-4) rotate-2(seg-in-3,seg-out-2,car-in-4,car-in-3)
STEP 7: analyze-2(seg-in-1,seg-out-1,car-in-1,car-out-2) rotate-2(seg-in-2,seg-out-3,car-out-4,car-out-3) rotate-2(seg-in-3,seg-out-2,car-in-3,car-in-4)
STEP 8: rotate-2(seg-in-1,seg-out-4,car-out-2,car-in-2) rotate-2(seg-in-2,seg-out-1,car-out-3,car-in-1) rotate-2(seg-in-4,seg-out-3,car-out-1,car-out-4)
STEP 9: analyze-2(seg-in-1,seg-out-1,car-in-2,car-out-3) rotate-2(seg-in-2,seg-out-3,car-in-1,car-out-1)
STEP 10: rotate-2(seg-in-1,seg-out-2,car-out-3,car-in-3) rotate-2(seg-in-3,seg-out-1,car-in-4,car-in-2) rotate-2(seg-in-4,seg-out-3,car-out-4,car-in-1)
STEP 11: analyze-2(seg-in-1,seg-out-1,car-in-3,car-in-4) rotate-2(seg-in-2,seg-out-2,car-out-1,car-out-3) rotate-2(seg-in-3,seg-out-3,car-in-2,car-out-4)
STEP 12: analyze-2(seg-in-1,seg-out-1,car-in-4,car-in-3) rotate-2(seg-in-2,seg-out-3,car-out-3,car-in-2) rotate-2(seg-in-3,seg-out-4,car-out-4,car-out-2)
STEP 13: rotate-2(seg-in-1,seg-out-2,car-in-3,car-out-1) rotate-2(seg-in-4,seg-out-1,car-in-1,car-in-4)
STEP 14: analyze-2(seg-in-1,seg-out-1,car-out-1,car-in-1) rotate-2(seg-in-3,seg-out-2,car-out-2,car-in-3)
44 actions in the plan.
Cost of the plan is 60.
total time 0.06 preprocess 0.01
total size 621.000 MB
max. learned clause length 1336
t val conflicts decisions
0 0 0 0
5 0 37 39
10 -1 182 294
15 1 66 194