Add benchmark result [gc-ta1-tt1-frumpy | ipc-2011 | parking-sequential-satisficing | 7]
This commit is contained in:
parent
731c328852
commit
b57d4e73fc
@ -0,0 +1,59 @@
|
||||
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-2011/domains/parking-sequential-satisficing/domain.pddl
|
||||
- /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parking-sequential-satisficing/instances/instance-7.pddl
|
||||
- --stats
|
||||
- --stats-iter
|
||||
- --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=frumpy
|
||||
- -i 0
|
||||
configuration:
|
||||
id: gc-ta1-tt1-frumpy
|
||||
instanceSets:
|
||||
- rintanen-aij-2012-interesting
|
||||
options:
|
||||
- --stats
|
||||
- --stats-iter
|
||||
- --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=frumpy
|
||||
- -i 0
|
||||
exitCode: 0
|
||||
instance:
|
||||
domain: parking-sequential-satisficing
|
||||
instance: 7
|
||||
ipc: ipc-2011
|
||||
planLength: 105
|
||||
versions:
|
||||
clingo: 5.2.2
|
||||
fastDownward: 10997:847cdf0069cab0c8841a9958e783d1a7340fe2e9 (2017-11-02 15:10 +0100)
|
||||
planner: f090434475c02dbccc3811039498f2a63a357ddc (2018-02-01 18:15:39 +0100)
|
||||
plasp: 3.1.1
|
||||
python: 3.6.3
|
||||
workingDirectory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner
|
||||
|
@ -0,0 +1,8 @@
|
||||
# configuration: {'id': 'gc-ta1-tt1-frumpy', 'options': ['--stats', '--stats-iter', '--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=frumpy', '-i 0'], 'instanceSets': ['rintanen-aij-2012-interesting']}
|
||||
# instance: {'ipc': 'ipc-2011', 'domain': 'parking-sequential-satisficing', 'instance': 7, 'planLength': 105}
|
||||
# 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-2011/domains/parking-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parking-sequential-satisficing/instances/instance-7.pddl', '--stats', '--stats-iter', '--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=frumpy', '-i 0']
|
||||
# working directory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner
|
||||
# exit code: 0
|
||||
TIMEOUT CPU 900.10 MEM 4635608 MAXMEM 4635608 STALE 0 MAXMEM_RSS 4503804
|
||||
<time name="ALL">899990</time>
|
||||
|
@ -0,0 +1,69 @@
|
||||
INFO Running translator.
|
||||
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parking-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parking-sequential-satisficing/instances/instance-7.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-2011/domains/parking-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parking-sequential-satisficing/instances/instance-7.pddl
|
||||
Parsing...
|
||||
Parsing: [0.020s CPU, 0.021s 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.015s wall-clock]
|
||||
Preparing model... [0.020s CPU, 0.015s wall-clock]
|
||||
Generated 32 rules.
|
||||
Computing model... [3.910s CPU, 3.900s wall-clock]
|
||||
42827 relevant atoms
|
||||
4396 auxiliary atoms
|
||||
47223 final queue length
|
||||
138834 total queue pushes
|
||||
Completing instantiation... [15.990s CPU, 15.985s wall-clock]
|
||||
Instantiating: [19.980s CPU, 19.964s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
12 initial candidates
|
||||
Finding invariants: [0.050s CPU, 0.058s wall-clock]
|
||||
Checking invariant weight... [0.000s CPU, 0.004s wall-clock]
|
||||
Instantiating groups... [0.060s CPU, 0.061s wall-clock]
|
||||
Collecting mutex groups... [0.010s CPU, 0.008s wall-clock]
|
||||
Choosing groups...
|
||||
66 uncovered facts
|
||||
Choosing groups: [0.040s CPU, 0.040s wall-clock]
|
||||
Building translation key... [0.020s CPU, 0.014s wall-clock]
|
||||
Computing fact groups: [0.250s CPU, 0.251s wall-clock]
|
||||
Building STRIPS to SAS dictionary... [0.000s CPU, 0.006s wall-clock]
|
||||
Building dictionary for full mutex groups... [0.020s CPU, 0.014s wall-clock]
|
||||
Building mutex information...
|
||||
Building mutex information: [0.020s CPU, 0.025s wall-clock]
|
||||
Translating task...
|
||||
Processing axioms...
|
||||
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||
Processing axioms: [0.790s CPU, 0.788s wall-clock]
|
||||
Translating task: [17.280s CPU, 17.268s wall-clock]
|
||||
49010 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
26 propositions removed
|
||||
Detecting unreachable propositions: [8.730s CPU, 8.734s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
92 of 92 variables necessary.
|
||||
40 of 66 mutex groups necessary.
|
||||
39546 of 39546 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [3.440s CPU, 3.435s wall-clock]
|
||||
Translator variables: 92
|
||||
Translator derived variables: 0
|
||||
Translator facts: 1172
|
||||
Translator goal facts: 26
|
||||
Translator mutex groups: 40
|
||||
Translator total mutex groups size: 1080
|
||||
Translator operators: 39546
|
||||
Translator axioms: 0
|
||||
Translator task size: 322456
|
||||
Translator peak memory: 226608 KB
|
||||
Writing output... [5.640s CPU, 6.034s wall-clock]
|
||||
Done! [56.020s CPU, 56.390s wall-clock]
|
||||
|
Loading…
Reference in New Issue
Block a user