1
0
Fork 0

Add benchmark result [gc-ta5-tt0 | ipc-2002 | driverlog-strips-automatic | 9]

This commit is contained in:
Potassco Bot 2017-11-27 10:13:31 +01:00
parent a10cacadab
commit 7309dbe1c3
Signed by: potassco-bot
GPG Key ID: 1F54208CE70DDF73
3 changed files with 262 additions and 0 deletions

View File

@ -0,0 +1,50 @@
command:
- timeout
- -m=8000000
- -t=900
- python3
- /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/runplanner.py
- --domain=/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/domain.pddl
- /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-9.pddl
- --stats
- --verbose
- --print-call
- --translate
- -B 0.9
- --parallel=0
- --shallow
- --use-heuristic
- --test-until-not-sat
- --test=0
- --test-add=5
- --test-times=0
configuration:
id: gc-ta5-tt0
instanceSets:
- lpnmr-first-plan-not-serializable
options:
- --stats
- --verbose
- --print-call
- --translate
- -B 0.9
- --parallel=0
- --shallow
- --use-heuristic
- --test-until-not-sat
- --test=0
- --test-add=5
- --test-times=0
exitCode: 0
instance:
domain: driverlog-strips-automatic
instance: 9
ipc: ipc-2002
versions:
clingo: 5.2.2
fastDownward: 10997:847cdf0069cab0c8841a9958e783d1a7340fe2e9 (2017-11-02 15:10 +0100)
planner: 517f2c0422a36582df17ecebb08e879b170cdfe2 (2017-11-21 02:23:06 +0100)
plasp: 3.1.1
python: 3.6.3
workingDirectory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner

View File

@ -0,0 +1,18 @@
# configuration: {'id': 'gc-ta5-tt0', 'options': ['--stats', '--verbose', '--print-call', '--translate', '-B 0.9', '--parallel=0', '--shallow', '--use-heuristic', '--test-until-not-sat', '--test=0', '--test-add=5', '--test-times=0'], 'instanceSets': ['lpnmr-first-plan-not-serializable']}
# instance: {'ipc': 'ipc-2002', 'domain': 'driverlog-strips-automatic', 'instance': 9}
# command: ['timeout', '-m=8000000', '-t=900', 'python3', '/home/pluehne/Documents/ASP/plasp-javier/encodings/planner/runplanner.py', '--domain=/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-9.pddl', '--stats', '--verbose', '--print-call', '--translate', '-B 0.9', '--parallel=0', '--shallow', '--use-heuristic', '--test-until-not-sat', '--test=0', '--test-add=5', '--test-times=0']
# 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))
# planner call: /home/wv/bin/linux/64/fast-downward/fast-downward.py --translate --build=release64 /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-9.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 -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_sequential_1.lp --heuristic=Domain /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/heuristic.lp -c _shallow=1 -c _closure=3 -c _parallel=0
FINISHED CPU 2.48 MEM 33476 MAXMEM 117968 STALE 1 MAXMEM_RSS 44808
<time name="ALL">2430</time>

View File

@ -0,0 +1,194 @@
INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-9.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-2002/domains/driverlog-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-9.pddl
Parsing...
Parsing: [0.030s CPU, 0.024s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.021s wall-clock]
Preparing model... [0.020s CPU, 0.017s wall-clock]
Generated 35 rules.
Computing model... [0.100s CPU, 0.097s wall-clock]
596 relevant atoms
404 auxiliary atoms
1000 final queue length
1334 total queue pushes
Completing instantiation... [0.080s CPU, 0.082s wall-clock]
Instantiating: [0.220s CPU, 0.226s wall-clock]
Computing fact groups...
Finding invariants...
11 initial candidates
Finding invariants: [0.020s CPU, 0.016s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.010s CPU, 0.011s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
3 uncovered facts
Choosing groups: [0.000s CPU, 0.002s wall-clock]
Building translation key... [0.000s CPU, 0.001s wall-clock]
Computing fact groups: [0.040s CPU, 0.036s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.001s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.000s CPU, 0.005s wall-clock]
Translating task: [0.080s CPU, 0.081s wall-clock]
30 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
11 propositions removed
Detecting unreachable propositions: [0.050s CPU, 0.048s wall-clock]
Reordering and filtering variables...
14 of 14 variables necessary.
3 of 14 mutex groups necessary.
384 of 384 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.013s wall-clock]
Translator variables: 14
Translator derived variables: 0
Translator facts: 97
Translator goal facts: 10
Translator mutex groups: 3
Translator total mutex groups size: 9
Translator operators: 384
Translator axioms: 0
Translator task size: 1708
Translator peak memory: 37324 KB
Writing output... [0.040s CPU, 0.037s wall-clock]
Done! [0.470s CPU, 0.473s wall-clock]
planner.py version 0.0.1
Time: 0.08s
Memory: 53MB
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: 53MB (+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
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.02s
Memory: 53MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 53MB (+0MB)
UNSAT
Iteration Time: 0.03s
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
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.02s
Memory: 55MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 55MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.05s
Memory: 58MB (+3MB)
Solving...
Solving Time: 0.01s
Memory: 58MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.05s
Memory: 58MB (+0MB)
Solving...
Solving Time: 0.13s
Memory: 58MB (+0MB)
UNSAT
Iteration Time: 0.28s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.02s
Memory: 58MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 58MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.06s
Memory: 60MB (+2MB)
Solving...
Solving Time: 0.01s
Memory: 58MB (+-2MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.05s
Memory: 61MB (+3MB)
Solving...
Solving Time: 0.01s
Memory: 61MB (+0MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.05s
Memory: 61MB (+0MB)
Answer: 5
occurs(action(("load-truck","package1","truck1","s2")),1) occurs(action(("load-truck","package3","truck3","s3")),1) occurs(action(("walk","driver1","s4","p4-0")),1) occurs(action(("walk","driver2","s1","p1-2")),1) occurs(action(("walk","driver1","p4-0","s0")),2) occurs(action(("walk","driver2","p1-2","s2")),2) occurs(action(("board-truck","driver1","truck2","s0")),3) occurs(action(("board-truck","driver2","truck1","s2")),3) occurs(action(("drive-truck","truck1","s2","s3","driver2")),4) occurs(action(("disembark-truck","driver2","truck1","s3")),5) occurs(action(("drive-truck","truck2","s0","s1","driver1")),6) occurs(action(("load-truck","package2","truck2","s1")),7) occurs(action(("drive-truck","truck2","s1","s2","driver1")),8) occurs(action(("unload-truck","package2","truck2","s2")),9) occurs(action(("board-truck","driver2","truck3","s3")),10) occurs(action(("unload-truck","package1","truck1","s3")),11) occurs(action(("drive-truck","truck2","s2","s3","driver1")),11) occurs(action(("drive-truck","truck3","s3","s0","driver2")),11) occurs(action(("drive-truck","truck3","s0","s1","driver2")),12) occurs(action(("unload-truck","package3","truck3","s1")),13) occurs(action(("disembark-truck","driver1","truck2","s3")),13) occurs(action(("drive-truck","truck3","s1","s2","driver2")),13) occurs(action(("drive-truck","truck3","s2","s4","driver2")),14) occurs(action(("disembark-truck","driver2","truck3","s4")),15)
SATISFIABLE
Models : 1+
Calls : 8
Time : 0.350s (Solving: 0.16s 1st Model: 0.03s Unsat: 0.13s)
CPU Time : 0.344s
Choices : 8317 (Domain: 8314)
Conflicts : 3241 (Analyzed: 3240)
Restarts : 39 (Average: 83.08 Last: 64)
Model-Level : 105.6
Problems : 8 (Average Length: 12.00 Splits: 0)
Lemmas : 3240 (Deleted: 1128)
Binary : 26 (Ratio: 0.80%)
Ternary : 53 (Ratio: 1.64%)
Conflict : 3240 (Average Length: 68.6 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 3240 (Average: 2.23 Max: 102 Sum: 7221)
Executed : 3232 (Average: 2.21 Max: 102 Sum: 7158 Ratio: 99.13%)
Bounded : 8 (Average: 7.88 Max: 12 Sum: 63 Ratio: 0.87%)
Rules : 5590
Atoms : 5581
Bodies : 60 (Original: 59)
Count : 9
Equivalences : 150 (Atom=Atom: 50 Body=Body: 0 Other: 100)
Tight : Yes
Variables : 6453 (Eliminated: 0 Frozen: 3034)
Constraints : 22962 (Binary: 92.0% Ternary: 4.4% Other: 3.6%)
Memory Peak : 61MB
Max. Length : 15 steps
Sol. Length : 15 steps
Models : 5