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

Add benchmark result [m-mp | ipc-2006 | pathways-propositional-strips | 7]

Browse Source
This commit is contained in:
Potassco Bot
2017-12-01 23:52:42 +01:00
parent e86a9ce028
commit e20bb84dc4
3 changed files with 97 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

49
m-mp/ipc-2006_pathways-propositional-strips_7.out Normal file
View File

@@ -0,0 +1,49 @@
Madagascar 0.99999 25/02/2015 09:46:27 amd64 1-core (no VSIDS)
Options: file:/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/pathways-propositional-strips/domains/domain-7.pddl file:/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/pathways-propositional-strips/instances/instance-7.pddlignoring --stats
ignoring --verbose
-m 8192
Domain: grounded-pathways-propositional
Problem: grounded-pathways-07
Parser: 597 ground actions and 263 state variables
Invariants: 0 1 2 3 4 5 6 7 8 9 10 0.00 secs
Goal: conjunctive
Simplified: 597 ground actions and 262 state variables
Actions: STRIPS
Disabling graph %: 10 20 30 40 50 60 70 80 90 100 0.00 secs (max SCC size 56)
Plan type: E-step
Allocated 32 MB permanent (total 125 MB)
Horizon 0: 262 variables
0 UNSAT (0 decisions 0 conflicts)
Horizon 5: 6717 variables
5 UNSAT (0 decisions 0 conflicts)
Horizon 10: 13172 variables
Allocated 32 MB (total 388 MB)
Horizon 15: 19627 variables
SAT (343 decisions 45 conflicts)
PLAN FOUND: 15 steps
STEP 0: choose_p53_l1_l0()
STEP 1: choose_cdk2_l2_l1() initialize_p53()
STEP 2: choose_ge2_l3_l2() initialize_cdk2() synthesize_p53_mdm2() synthesize_p53_p21()
STEP 3: choose_e2f13-dp12_l4_l3() initialize_ge2()
STEP 4: choose_max_l5_l4() initialize_e2f13-dp12()
STEP 5: associate_e2f13-dp12_ge2_e2f13-dp12-ge2() choose_cdk2p1_l6_l5() initialize_max()
STEP 6: choose_p27_l7_l6() initialize_cdk2p1() initialize_e2f13-dp12() synthesize_e2f13-dp12-ge2_c-myc() synthesize_e2f13-dp12-ge2_cyca() synthesize_e2f13-dp12-ge2_cycdp1() synthesize_e2f13-dp12-ge2_cyce() synthesize_e2f13-dp12-ge2_cycep1()
STEP 7: associate_c-myc_max_c-myc-max() associate_cdk2_cyce_cdk2-cyce() associate_cdk2p1_cycep1_cdk2p1-cycep1() associate_mdm2_e2f13-dp12_mdm2-e2f13-dp12() choose_pcna_l8_l7() dummy-action-1-2() initialize_p27()
STEP 8.0: associate_p27_cdk2p1-cycep1_p27-cdk2p1-cycep1() choose_cdk46p1_l9_l8() dummy-action-6-2() dummy-action-7-2() dummy-action-9-2() initialize_cdk2() initialize_cdk2p1() initialize_pcna() synthesize_e2f13-dp12-ge2_cycep1()
STEP 8.1: associate_p21_cdk2-cyce_p21-cdk2-cyce()
STEP 9: associate_cdk2_cycep1_cdk2-cycep1() associate_cdk2p1_cyca_cdk2p1-cyca() choose_gcdc25a_l10_l9() dummy-action-11-1() dummy-action-8-1() initialize_cdk46p1() initialize_p27() synthesize_p53_p21()
STEP 10: associate_cdk46p1_cycdp1_cdk46p1-cycdp1() associate_p27_cdk2p1-cyca_p27-cdk2p1-cyca() associate_pcna_p21_pcna-p21() initialize_cdk2() initialize_cdk2p1() initialize_gcdc25a() synthesize_e2f13-dp12-ge2_cyca() synthesize_e2f13-dp12-ge2_cyce()
STEP 11: associate_c-myc-max_gcdc25a_c-myc-max-gcdc25a() associate_cdk2_cyca_cdk2-cyca() associate_cdk2p1_cyce_cdk2p1-cyce() associate_pcna-p21_cdk2-cycep1_pcna-p21-cdk2-cycep1() dummy-action-5-2() initialize_p27() initialize_pcna() synthesize_p53_p21()
STEP 12: associate_p27_cdk46p1-cycdp1_p27-cdk46p1-cycdp1() associate_pcna_p21_pcna-p21() dummy-action-10-1() synthesize_c-myc-max-gcdc25a_cdc25a()
STEP 13: associate_pcna-p21_cdk2-cyca_pcna-p21-cdk2-cyca() dummy-action-2-2() dummy-action-3-1()
STEP 14: dummy-action-4-2()
71 actions in the plan.
total time 0.04 preprocess 0.01
total size 542.000 MB
max. learned clause length 241
t val conflicts decisions
0 0 0 0
5 0 0 0
10 -1 120 198
15 1 45 343