1
0
Fork 0

Add benchmark result [gc-ta1-tt1 | ipc-2006 | pathways-propositional-strips | 6]

This commit is contained in:
Potassco Bot 2017-12-01 23:52:24 +01:00
parent 2a4e8e46af
commit e86a9ce028
Signed by: potassco-bot
GPG Key ID: 1F54208CE70DDF73
3 changed files with 260 additions and 0 deletions

View File

@ -0,0 +1,53 @@
command:
- timeout
- -m=9216000
- -t=900
- python3
- /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/runplanner.py
- --domain=/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/pathways-propositional-strips/domains/domain-6.pddl
- /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/pathways-propositional-strips/instances/instance-6.pddl
- --stats
- --verbose
- --print-call
- -m 8192
- --translate
- -B 0.9
- --parallel=0
- --shallow
- --use-heuristic
- --test-until-not-sat
- --test=0
- --test-add=1
- --test-times=1
configuration:
id: gc-ta1-tt1
instanceSets:
- lpnmr-first-plan-not-serializable
- rintanen-aij-2012
options:
- --stats
- --verbose
- --print-call
- -m 8192
- --translate
- -B 0.9
- --parallel=0
- --shallow
- --use-heuristic
- --test-until-not-sat
- --test=0
- --test-add=1
- --test-times=1
exitCode: 0
instance:
domain: pathways-propositional-strips
instance: 6
ipc: ipc-2006
versions:
clingo: 5.2.2
fastDownward: 10997:847cdf0069cab0c8841a9958e783d1a7340fe2e9 (2017-11-02 15:10 +0100)
planner: 398fcb36ad9c5a23a8c35820fb4b021802dbc349 (2017-11-30 17:03:27 +0100)
plasp: 3.1.1
python: 3.6.3
workingDirectory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner

View File

@ -0,0 +1,33 @@
# configuration: {'id': 'gc-ta1-tt1', 'options': ['--stats', '--verbose', '--print-call', '-m 8192', '--translate', '-B 0.9', '--parallel=0', '--shallow', '--use-heuristic', '--test-until-not-sat', '--test=0', '--test-add=1', '--test-times=1'], 'instanceSets': ['lpnmr-first-plan-not-serializable', 'rintanen-aij-2012']}
# instance: {'ipc': 'ipc-2006', 'domain': 'pathways-propositional-strips', 'instance': 6}
# command: ['timeout', '-m=9216000', '-t=900', 'python3', '/home/pluehne/Documents/ASP/plasp-javier/encodings/planner/runplanner.py', '--domain=/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/pathways-propositional-strips/domains/domain-6.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/pathways-propositional-strips/instances/instance-6.pddl', '--stats', '--verbose', '--print-call', '-m 8192', '--translate', '-B 0.9', '--parallel=0', '--shallow', '--use-heuristic', '--test-until-not-sat', '--test=0', '--test-add=1', '--test-times=1']
# working directory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner
# exit code: 0
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/preprocess.lp:13:4-34: info: atom does not occur in any rule head:
requires(feature(actionCosts))
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/preprocess.lp:14:4-33: info: atom does not occur in any rule head:
requires(feature(axiomRules))
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/preprocess.lp:15:4-41: info: atom does not occur in any rule head:
requires(feature(conditionalEffects))
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp:66:15-28: info: atom does not occur in any rule head:
mutexGroup(G)
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp:66:30-45: info: atom does not occur in any rule head:
contains(G,X,V)
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp:67:15-28: info: atom does not occur in any rule head:
mutexGroup(G)
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp:74:41-56: info: atom does not occur in any rule head:
contains(G,X,V)
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp:84:41-56: info: atom does not occur in any rule head:
contains(G,X,V)
# planner call: /home/wv/bin/linux/64/fast-downward/fast-downward.py --translate --build=release64 /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/pathways-propositional-strips/domains/domain-6.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/pathways-propositional-strips/instances/instance-6.pddl && plasp-3.1.1 translate --parsing-mode=compatibility output.sas | /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/planner.py - /home/pluehne/Documents/ASP/plasp-javier/encodings/strips/preprocess.lp /home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp --stats --verbose -m 8192 -B 0.9 --test-until-not-sat --query-at-last --check-at-last --forbid-actions --force-actions -c planner_on=1 --test=- --test=/home/pluehne/Documents/ASP/plasp-javier/encodings/planner/test_files/test.lp /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/test_files/block_forall_t.lp --test-once --heuristic=Domain /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/heuristic.lp -c _shallow=1 -c _closure=3 -c _parallel=0
FINISHED CPU 303.82 MEM 33472 MAXMEM 312920 STALE 1 MAXMEM_RSS 239952
<time name="ALL">303770</time>

View File

@ -0,0 +1,174 @@
INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/pathways-propositional-strips/domains/domain-6.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/pathways-propositional-strips/instances/instance-6.pddl']
INFO translator arguments: []
INFO translator time limit: None
INFO translator memory limit: None
INFO callstring: /home/pluehne/.usr/bin/python /home/wv/bin/linux/64/fast-downward-10997/builds/release64/bin/translate/translate.py /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/pathways-propositional-strips/domains/domain-6.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/pathways-propositional-strips/instances/instance-6.pddl
Parsing...
Parsing: [0.540s CPU, 0.541s wall-clock]
Normalizing task... [0.080s CPU, 0.078s wall-clock]
Instantiating...
Generating Datalog program... [0.050s CPU, 0.049s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.130s CPU, 0.130s wall-clock]
Preparing model... [0.090s CPU, 0.088s wall-clock]
Generated 1345 rules.
Computing model... [0.040s CPU, 0.051s wall-clock]
713 relevant atoms
0 auxiliary atoms
713 final queue length
1382 total queue pushes
Completing instantiation... [0.110s CPU, 0.107s wall-clock]
Instantiating: [0.430s CPU, 0.431s wall-clock]
Computing fact groups...
Finding invariants...
214 initial candidates
Time limit reached, aborting invariant generation
Finding invariants: [300.380s CPU, 300.255s wall-clock]
Checking invariant weight... [0.090s CPU, 0.089s wall-clock]
Instantiating groups... [0.010s CPU, 0.002s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
133 uncovered facts
Choosing groups: [0.010s CPU, 0.004s wall-clock]
Building translation key... [0.010s CPU, 0.005s wall-clock]
Computing fact groups: [300.500s CPU, 300.377s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.003s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.003s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.000s CPU, 0.007s wall-clock]
Translating task: [0.140s CPU, 0.144s wall-clock]
157 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
36 propositions removed
Detecting unreachable propositions: [0.100s CPU, 0.097s wall-clock]
Reordering and filtering variables...
126 of 169 variables necessary.
0 of 45 mutex groups necessary.
484 of 497 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.040s CPU, 0.037s wall-clock]
Translator variables: 126
Translator derived variables: 0
Translator facts: 261
Translator goal facts: 8
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 484
Translator axioms: 0
Translator task size: 2746
Translator peak memory: 232024 KB
Writing output... [0.060s CPU, 0.058s wall-clock]
Done! [301.900s CPU, 301.777s wall-clock]
planner.py version 0.0.1
Time: 0.07s
Memory: 52MB
Iteration 1
Queue: [(0,0,0,True), (1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 0
Solving...
Solving Time: 0.00s
Memory: 52MB (+0MB)
UNSAT
Iteration Time: 0.00s
Iteration 2
Queue: [(1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 0
Expected Memory: 52MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.03s
Memory: 56MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 57MB (+1MB)
UNSAT
Iteration Time: 0.04s
Iteration 3
Queue: [(2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Expected Memory: 62.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.03s
Memory: 59MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 60MB (+1MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.07s
Memory: 60MB (+0MB)
Solving...
Solving Time: 0.08s
Memory: 61MB (+1MB)
UNSAT
Iteration Time: 0.20s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 66.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.05s
Memory: 65MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 67MB (+2MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 67MB (+0MB)
Answer: 2
occurs(action("choose_gp_l1_l0"),1) occurs(action("initialize_gp"),2) occurs(action("choose_sp1_l2_l1"),2) occurs(action("initialize_sp1"),3) occurs(action("choose_cdk46p1_l3_l2"),3) occurs(action("choose_rpa_l4_l3"),4) occurs(action("associate_sp1_gp_sp1-gp"),4) occurs(action("initialize_cdk46p1"),4) occurs(action("synthesize_sp1-gp_cyce"),5) occurs(action("initialize_rpa"),5) occurs(action("synthesize_sp1-gp_cyca"),5) occurs(action("initialize_gp"),5) occurs(action("synthesize_sp1-gp_cycd"),5) occurs(action("synthesize_sp1-gp_p107p1"),5) occurs(action("choose_p57p1_l5_l4"),5) occurs(action("synthesize_sp1-gp_cycdp1"),5) occurs(action("initialize_sp1"),5) occurs(action("synthesize_sp1-gp_p107"),5) occurs(action("associate_rpa_cyca_rpa-cyca"),6) occurs(action("associate_sp1_p107p1_sp1-p107p1"),6) occurs(action("initialize_p57p1"),6) occurs(action("associate_cdk46p1_cycdp1_cdk46p1-cycdp1"),6) occurs(action("choose_cdk2p1_l6_l5"),6) occurs(action("dummy-action-8-2"),7) occurs(action("associate_sp1-p107p1_gp_sp1-p107p1-gp"),7) occurs(action("associate_p57p1_cdk46p1-cycdp1_p57p1-cdk46p1-cycdp1"),7) occurs(action("initialize_cdk2p1"),7) occurs(action("synthesize_sp1-gp_cyca"),7) occurs(action("choose_p57_l7_l6"),7) occurs(action("initialize_cdk46p1"),7) occurs(action("dummy-action-7-2"),8) occurs(action("dummy-action-2-1"),8) occurs(action("associate_cdk2p1_cyca_cdk2p1-cyca"),8) occurs(action("associate_cdk46p1_cycd_cdk46p1-cycd"),8) occurs(action("initialize_p57"),8) occurs(action("initialize_p57p1"),8) occurs(action("choose_dp12_l8_l7"),8) occurs(action("associate_p57_cdk2p1-cyca_p57-cdk2p1-cyca"),9) occurs(action("associate_p57p1_cdk46p1-cycd_p57p1-cdk46p1-cycd"),9) occurs(action("initialize_cdk2p1"),9) occurs(action("initialize_dp12"),9) occurs(action("choose_e2f4_l9_l8"),9) occurs(action("dummy-action-3-2"),10) occurs(action("dummy-action-5-1"),10) occurs(action("associate_cdk2p1_cyce_cdk2p1-cyce"),10) occurs(action("initialize_p57"),10) occurs(action("choose_hdac1_l10_l9"),10) occurs(action("synthesize_sp1-gp_p107"),10) occurs(action("initialize_e2f4"),10) occurs(action("initialize_dp12"),10) occurs(action("dummy-action-6-2"),11) occurs(action("initialize_hdac1"),11) occurs(action("associate_e2f4_dp12_e2f4-dp12"),11) occurs(action("associate_p57_cdk2p1-cyce_p57-cdk2p1-cyce"),12) occurs(action("associate_p107_e2f4-dp12_p107-e2f4-dp12"),12) occurs(action("dummy-action-1-1"),13) occurs(action("associate_hdac1_p107-e2f4-dp12_hdac1-p107-e2f4-dp12"),13) occurs(action("dummy-action-4-2"),14) occurs(action("dummy-action-7-2"),15)
SATISFIABLE
Models : 1+
Calls : 5
Time : 0.352s (Solving: 0.08s 1st Model: 0.01s Unsat: 0.07s)
CPU Time : 0.340s
Choices : 3113 (Domain: 2674)
Conflicts : 985 (Analyzed: 984)
Restarts : 10 (Average: 98.40 Last: 47)
Model-Level : 335.5
Problems : 5 (Average Length: 10.00 Splits: 0)
Lemmas : 984 (Deleted: 0)
Binary : 21 (Ratio: 2.13%)
Ternary : 30 (Ratio: 3.05%)
Conflict : 984 (Average Length: 23.0 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 984 (Average: 2.56 Max: 213 Sum: 2521)
Executed : 977 (Average: 2.50 Max: 213 Sum: 2461 Ratio: 97.62%)
Bounded : 7 (Average: 8.57 Max: 12 Sum: 60 Ratio: 2.38%)
Rules : 16579 (Original: 15223)
Atoms : 10980
Bodies : 4925 (Original: 3576)
Count : 150 (Original: 377)
Equivalences : 2695 (Atom=Atom: 157 Body=Body: 0 Other: 2538)
Tight : Yes
Variables : 14280 (Eliminated: 0 Frozen: 4041)
Constraints : 56660 (Binary: 89.8% Ternary: 6.9% Other: 3.2%)
Memory Peak : 67MB
Max. Length : 15 steps
Sol. Length : 15 steps
Models : 2