Add benchmark result [gc-ta1-tt1-frumpy | ipc-2011 | parking-sequential-satisficing | 10]
This commit is contained in:
parent
e33d95ce3a
commit
cbf64fa4ff
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-10.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: 10
|
||||
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': 10, '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-10.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.09 MEM 3897928 MAXMEM 3897928 STALE 1 MAXMEM_RSS 3812740
|
||||
<time name="ALL">900060</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-10.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-10.pddl
|
||||
Parsing...
|
||||
Parsing: [0.020s CPU, 0.024s wall-clock]
|
||||
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||||
Instantiating...
|
||||
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
|
||||
Normalizing Datalog program...
|
||||
Normalizing Datalog program: [0.020s CPU, 0.017s wall-clock]
|
||||
Preparing model... [0.010s CPU, 0.017s wall-clock]
|
||||
Generated 32 rules.
|
||||
Computing model... [3.870s CPU, 3.876s wall-clock]
|
||||
42827 relevant atoms
|
||||
4396 auxiliary atoms
|
||||
47223 final queue length
|
||||
138834 total queue pushes
|
||||
Completing instantiation... [15.860s CPU, 15.857s wall-clock]
|
||||
Instantiating: [19.820s CPU, 19.817s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
12 initial candidates
|
||||
Finding invariants: [0.060s CPU, 0.058s wall-clock]
|
||||
Checking invariant weight... [0.000s CPU, 0.004s wall-clock]
|
||||
Instantiating groups... [0.060s CPU, 0.062s wall-clock]
|
||||
Collecting mutex groups... [0.010s CPU, 0.008s wall-clock]
|
||||
Choosing groups...
|
||||
66 uncovered facts
|
||||
Choosing groups: [0.040s CPU, 0.038s wall-clock]
|
||||
Building translation key... [0.010s CPU, 0.015s wall-clock]
|
||||
Computing fact groups: [0.240s CPU, 0.245s wall-clock]
|
||||
Building STRIPS to SAS dictionary... [0.010s CPU, 0.006s wall-clock]
|
||||
Building dictionary for full mutex groups... [0.010s CPU, 0.014s wall-clock]
|
||||
Building mutex information...
|
||||
Building mutex information: [0.030s CPU, 0.025s wall-clock]
|
||||
Translating task...
|
||||
Processing axioms...
|
||||
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||
Processing axioms: [0.790s CPU, 0.784s wall-clock]
|
||||
Translating task: [17.210s CPU, 17.204s 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.740s CPU, 8.733s 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.430s CPU, 3.433s 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.570s CPU, 5.968s wall-clock]
|
||||
Done! [55.710s CPU, 56.103s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
||||
Time: 12.93s
|
||||
Memory: 810MB
|
||||
|
||||
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 : 14.863s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||||
CPU Time : 13.004s
|
||||
|
||||
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 : 942843
|
||||
Atoms : 942843
|
||||
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 : 946MB
|
||||
Max. Length : 0 steps
|
||||
Models : 0
|
||||
|
||||
[endof: stats after solve call]
|
||||
Solving Time: 0.08s
|
||||
Memory: 882MB (+72MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.08s
|
||||
|
||||
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: 882MB
|
||||
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||||
Grounding Time: 4.94s
|
||||
Memory: 882MB (+0MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
[start: stats after solve call]
|
||||
|
||||
Models : 0
|
||||
Calls : 2
|
||||
Time : 35.972s (Solving: 13.20s 1st Model: 0.00s Unsat: 13.20s)
|
||||
CPU Time : 34.120s
|
||||
|
||||
Choices : 84448 (Domain: 84448)
|
||||
Conflicts : 12606 (Analyzed: 12605)
|
||||
Restarts : 10 (Average: 1260.50 Last: 1275)
|
||||
Problems : 2 (Average Length: 4.50 Splits: 0)
|
||||
Lemmas : 12605 (Deleted: 0)
|
||||
Binary : 42 (Ratio: 0.33%)
|
||||
Ternary : 34 (Ratio: 0.27%)
|
||||
Conflict : 12605 (Average Length: 4479.5 Ratio: 100.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 12605 (Average: 6.66 Max: 272 Sum: 83976)
|
||||
Executed : 12474 (Average: 6.62 Max: 272 Sum: 83444 Ratio: 99.37%)
|
||||
Bounded : 131 (Average: 4.06 Max: 7 Sum: 532 Ratio: 0.63%)
|
||||
|
||||
Rules : 942843
|
||||
Atoms : 942843
|
||||
Bodies : 1 (Original: 0)
|
||||
Tight : Yes
|
||||
Variables : 169217 (Eliminated: 0 Frozen: 5400)
|
||||
Constraints : 1347467 (Binary: 99.4% Ternary: 0.3% Other: 0.3%)
|
||||
|
||||
Memory Peak : 1167MB
|
||||
Max. Length : 0 steps
|
||||
Models : 0
|
||||
|
||||
[endof: stats after solve call]
|
||||
Solving Time: 13.57s
|
||||
Memory: 1103MB (+221MB)
|
||||
UNSAT
|
||||
Iteration Time: 21.13s
|
||||
|
||||
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: 1324.0MB
|
||||
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||||
Grounding Time: 5.63s
|
||||
Memory: 1275MB (+172MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
*** Info : (planner): INTERRUPTED by signal!
|
||||
UNKNOWN
|
||||
|
||||
INTERRUPTED : 1
|
||||
|
||||
Models : 0+
|
||||
Calls : 3
|
||||
Time : 841.456s (Solving: 810.79s 1st Model: 0.00s Unsat: 13.20s)
|
||||
CPU Time : 839.936s
|
||||
|
||||
Choices : 7571816 (Domain: 7571816)
|
||||
Conflicts : 383042 (Analyzed: 383041)
|
||||
Restarts : 28 (Average: 13680.04 Last: 75055)
|
||||
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||||
Lemmas : 383041 (Deleted: 357867)
|
||||
Binary : 315 (Ratio: 0.08%)
|
||||
Ternary : 228 (Ratio: 0.06%)
|
||||
Conflict : 383041 (Average Length: 8745.0 Ratio: 100.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 383041 (Average: 19.75 Max: 1508 Sum: 7564682)
|
||||
Executed : 382642 (Average: 19.75 Max: 1508 Sum: 7563638 Ratio: 99.99%)
|
||||
Bounded : 399 (Average: 2.62 Max: 12 Sum: 1044 Ratio: 0.01%)
|
||||
|
||||
Rules : 942843
|
||||
Atoms : 942843
|
||||
Bodies : 1 (Original: 0)
|
||||
Tight : Yes
|
||||
Variables : 379138 (Eliminated: 0 Frozen: 10800)
|
||||
Constraints : 3814720 (Binary: 99.5% Ternary: 0.2% Other: 0.3%)
|
||||
|
||||
Memory Peak : 3833MB
|
||||
Max. Length : 5 steps
|
||||
Models : 0
|
||||
|
||||
|
||||
Loading…
Reference in New Issue