Add benchmark result [gc-ta1-tt1-frumpy | ipc-2011 | parking-sequential-satisficing | 4]
This commit is contained in:
parent
fdc0d81535
commit
07409c56e1
GPG Key ID:
1F54208CE70DDF73
|
|
@ -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-4.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: 4
|
||||
ipc: ipc-2011
|
||||
planLength: 90
|
||||
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': 4, 'planLength': 90}
|
||||
# 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-4.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.11 MEM 4558552 MAXMEM 4558552 STALE 0 MAXMEM_RSS 4478340
|
||||
<time name="ALL">900050</time>
|
||||
|
||||
|
|
@ -0,0 +1,207 @@
|
|||
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-4.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-4.pddl
|
||||
Parsing...
|
||||
Parsing: [0.010s CPU, 0.020s wall-clock]
|
||||
Normalizing task... [0.010s CPU, 0.002s wall-clock]
|
||||
Instantiating...
|
||||
Generating Datalog program... [0.000s CPU, 0.007s wall-clock]
|
||||
Normalizing Datalog program...
|
||||
Normalizing Datalog program: [0.020s CPU, 0.015s wall-clock]
|
||||
Preparing model... [0.010s CPU, 0.015s wall-clock]
|
||||
Generated 32 rules.
|
||||
Computing model... [3.080s CPU, 3.084s wall-clock]
|
||||
33917 relevant atoms
|
||||
3770 auxiliary atoms
|
||||
37687 final queue length
|
||||
109987 total queue pushes
|
||||
Completing instantiation... [12.550s CPU, 12.543s wall-clock]
|
||||
Instantiating: [15.690s CPU, 15.698s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
12 initial candidates
|
||||
Finding invariants: [0.060s CPU, 0.050s wall-clock]
|
||||
Checking invariant weight... [0.000s CPU, 0.004s wall-clock]
|
||||
Instantiating groups... [0.050s CPU, 0.051s wall-clock]
|
||||
Collecting mutex groups... [0.010s CPU, 0.007s wall-clock]
|
||||
Choosing groups...
|
||||
61 uncovered facts
|
||||
Choosing groups: [0.030s CPU, 0.032s wall-clock]
|
||||
Building translation key... [0.010s CPU, 0.013s wall-clock]
|
||||
Computing fact groups: [0.220s CPU, 0.219s wall-clock]
|
||||
Building STRIPS to SAS dictionary... [0.010s CPU, 0.006s wall-clock]
|
||||
Building dictionary for full mutex groups... [0.010s CPU, 0.015s wall-clock]
|
||||
Building mutex information...
|
||||
Building mutex information: [0.020s CPU, 0.020s wall-clock]
|
||||
Translating task...
|
||||
Processing axioms...
|
||||
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||
Processing axioms: [0.620s CPU, 0.620s wall-clock]
|
||||
Translating task: [13.620s CPU, 13.610s wall-clock]
|
||||
38592 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
24 propositions removed
|
||||
Detecting unreachable propositions: [6.880s CPU, 6.881s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
85 of 85 variables necessary.
|
||||
37 of 61 mutex groups necessary.
|
||||
31104 of 31104 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [2.690s CPU, 2.693s wall-clock]
|
||||
Translator variables: 85
|
||||
Translator derived variables: 0
|
||||
Translator facts: 1010
|
||||
Translator goal facts: 24
|
||||
Translator mutex groups: 37
|
||||
Translator total mutex groups size: 925
|
||||
Translator operators: 31104
|
||||
Translator axioms: 0
|
||||
Translator task size: 253756
|
||||
Translator peak memory: 186364 KB
|
||||
Writing output... [4.430s CPU, 4.735s wall-clock]
|
||||
Done! [44.090s CPU, 44.394s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
||||
Time: 10.19s
|
||||
Memory: 650MB
|
||||
|
||||
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...
|
||||
[start: stats after solve call]
|
||||
|
||||
Models : 0
|
||||
Calls : 1
|
||||
Time : 11.528s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||||
CPU Time : 10.244s
|
||||
|
||||
Choices : 0
|
||||
Conflicts : 0 (Analyzed: 0)
|
||||
Restarts : 0
|
||||
Problems : 1 (Average Length: 2.00 Splits: 0)
|
||||
Lemmas : 0 (Deleted: 0)
|
||||
Binary : 0 (Ratio: 0.00%)
|
||||
Ternary : 0 (Ratio: 0.00%)
|
||||
Conflict : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 0 (Average: 0.00 Max: 0 Sum: 0)
|
||||
Executed : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
|
||||
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 100.00%)
|
||||
|
||||
Rules : 742110
|
||||
Atoms : 742110
|
||||
Bodies : 1 (Original: 0)
|
||||
Tight : Yes
|
||||
Variables : 0 (Eliminated: 0 Frozen: 0)
|
||||
Constraints : 0 (Binary: 0.0% Ternary: 0.0% Other: 0.0%)
|
||||
|
||||
Memory Peak : 786MB
|
||||
Max. Length : 0 steps
|
||||
Models : 0
|
||||
|
||||
[endof: stats after solve call]
|
||||
Solving Time: 0.06s
|
||||
Memory: 722MB (+72MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.06s
|
||||
|
||||
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: 722MB
|
||||
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||||
Grounding Time: 3.95s
|
||||
Memory: 722MB (+0MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
[start: stats after solve call]
|
||||
|
||||
Models : 0
|
||||
Calls : 2
|
||||
Time : 20.928s (Solving: 3.33s 1st Model: 0.00s Unsat: 3.33s)
|
||||
CPU Time : 19.648s
|
||||
|
||||
Choices : 33840 (Domain: 33840)
|
||||
Conflicts : 5480 (Analyzed: 5479)
|
||||
Restarts : 8 (Average: 684.88 Last: 555)
|
||||
Problems : 2 (Average Length: 4.50 Splits: 0)
|
||||
Lemmas : 5479 (Deleted: 0)
|
||||
Binary : 20 (Ratio: 0.37%)
|
||||
Ternary : 41 (Ratio: 0.75%)
|
||||
Conflict : 5479 (Average Length: 1919.5 Ratio: 100.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 5479 (Average: 6.18 Max: 218 Sum: 33876)
|
||||
Executed : 5412 (Average: 6.12 Max: 218 Sum: 33552 Ratio: 99.04%)
|
||||
Bounded : 67 (Average: 4.84 Max: 7 Sum: 324 Ratio: 0.96%)
|
||||
|
||||
Rules : 742110
|
||||
Atoms : 742110
|
||||
Bodies : 1 (Original: 0)
|
||||
Tight : Yes
|
||||
Variables : 133955 (Eliminated: 0 Frozen: 4625)
|
||||
Constraints : 1061911 (Binary: 99.4% Ternary: 0.3% Other: 0.3%)
|
||||
|
||||
Memory Peak : 786MB
|
||||
Max. Length : 0 steps
|
||||
Models : 0
|
||||
|
||||
[endof: stats after solve call]
|
||||
Solving Time: 3.58s
|
||||
Memory: 751MB (+29MB)
|
||||
UNSAT
|
||||
Iteration Time: 9.41s
|
||||
|
||||
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: 780.0MB
|
||||
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||||
Grounding Time: 3.78s
|
||||
Memory: 834MB (+83MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
*** Info : (planner): INTERRUPTED by signal!
|
||||
UNKNOWN
|
||||
|
||||
INTERRUPTED : 1
|
||||
|
||||
Models : 0+
|
||||
Calls : 3
|
||||
Time : 853.538s (Solving: 830.46s 1st Model: 0.00s Unsat: 3.33s)
|
||||
CPU Time : 852.596s
|
||||
|
||||
Choices : 7085111 (Domain: 7085111)
|
||||
Conflicts : 449328 (Analyzed: 449327)
|
||||
Restarts : 27 (Average: 16641.74 Last: 651)
|
||||
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||||
Lemmas : 449327 (Deleted: 393651)
|
||||
Binary : 201 (Ratio: 0.04%)
|
||||
Ternary : 202 (Ratio: 0.04%)
|
||||
Conflict : 449327 (Average Length: 8051.1 Ratio: 100.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 449327 (Average: 15.75 Max: 1331 Sum: 7077703)
|
||||
Executed : 448967 (Average: 15.75 Max: 1331 Sum: 7076966 Ratio: 99.99%)
|
||||
Bounded : 360 (Average: 2.05 Max: 12 Sum: 737 Ratio: 0.01%)
|
||||
|
||||
Rules : 742110
|
||||
Atoms : 742110
|
||||
Bodies : 1 (Original: 0)
|
||||
Tight : Yes
|
||||
Variables : 300011 (Eliminated: 0 Frozen: 9250)
|
||||
Constraints : 3008672 (Binary: 99.4% Ternary: 0.3% Other: 0.3%)
|
||||
|
||||
Memory Peak : 4414MB
|
||||
Max. Length : 5 steps
|
||||
Models : 0
|
||||
|
||||
|
||||
Loading…
Reference in New Issue