Add benchmark result [fd-pb-e1-sh-h | ipc-2000 | blocks-strips-typed | 31]
This commit is contained in:
parent
ba78630a45
commit
3126e7c5dd
GPG Key ID:
1F54208CE70DDF73
43
fd-pb-e1-sh-h/ipc-2000_blocks-strips-typed_31.env
Normal file
43
fd-pb-e1-sh-h/ipc-2000_blocks-strips-typed_31.env
Normal file
@ -0,0 +1,43 @@
|
||||
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-2000/domains/blocks-strips-typed/domain.pddl
|
||||
- /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-31.pddl
|
||||
- --stats
|
||||
- --verbose
|
||||
- --print-call
|
||||
- --translate
|
||||
- -B 0.9
|
||||
- --parallel=1
|
||||
- --shallow
|
||||
- --use-heuristic
|
||||
configuration:
|
||||
id: fd-pb-e1-sh-h
|
||||
instanceSets:
|
||||
- lnpmr-hard-instances
|
||||
- lpnmr-easy-instances
|
||||
options:
|
||||
- --stats
|
||||
- --verbose
|
||||
- --print-call
|
||||
- --translate
|
||||
- -B 0.9
|
||||
- --parallel=1
|
||||
- --shallow
|
||||
- --use-heuristic
|
||||
exitCode: 0
|
||||
instance:
|
||||
domain: blocks-strips-typed
|
||||
instance: 31
|
||||
ipc: ipc-2000
|
||||
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.0
|
||||
python: 3.6.3
|
||||
workingDirectory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner
|
||||
|
||||
18
fd-pb-e1-sh-h/ipc-2000_blocks-strips-typed_31.err
Normal file
18
fd-pb-e1-sh-h/ipc-2000_blocks-strips-typed_31.err
Normal file
@ -0,0 +1,18 @@
|
||||
# configuration: {'id': 'fd-pb-e1-sh-h', 'options': ['--stats', '--verbose', '--print-call', '--translate', '-B 0.9', '--parallel=1', '--shallow', '--use-heuristic'], 'instanceSets': ['lnpmr-hard-instances', 'lpnmr-easy-instances']}
|
||||
# instance: {'ipc': 'ipc-2000', 'domain': 'blocks-strips-typed', 'instance': 31}
|
||||
# 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-2000/domains/blocks-strips-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-31.pddl', '--stats', '--verbose', '--print-call', '--translate', '-B 0.9', '--parallel=1', '--shallow', '--use-heuristic']
|
||||
# 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-2000/domains/blocks-strips-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-31.pddl && plasp-3.1.0 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 --query-at-last --check-at-last --forbid-actions --force-actions -c planner_on=1 --heuristic=Domain /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/heuristic.lp -c _shallow=1 -c _closure=3 -c _parallel=1
|
||||
FINISHED CPU 2.86 MEM 30288 MAXMEM 130556 STALE 0 MAXMEM_RSS 75876
|
||||
<time name="ALL">2800</time>
|
||||
|
||||
220
fd-pb-e1-sh-h/ipc-2000_blocks-strips-typed_31.out
Normal file
220
fd-pb-e1-sh-h/ipc-2000_blocks-strips-typed_31.out
Normal file
@ -0,0 +1,220 @@
|
||||
INFO Running translator.
|
||||
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-31.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-2000/domains/blocks-strips-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-31.pddl
|
||||
Parsing...
|
||||
Parsing: [0.010s CPU, 0.012s wall-clock]
|
||||
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||||
Instantiating...
|
||||
Generating Datalog program... [0.000s CPU, 0.003s wall-clock]
|
||||
Normalizing Datalog program...
|
||||
Normalizing Datalog program: [0.010s CPU, 0.009s wall-clock]
|
||||
Preparing model... [0.010s CPU, 0.006s wall-clock]
|
||||
Generated 21 rules.
|
||||
Computing model... [0.090s CPU, 0.096s wall-clock]
|
||||
797 relevant atoms
|
||||
525 auxiliary atoms
|
||||
1322 final queue length
|
||||
2257 total queue pushes
|
||||
Completing instantiation... [0.140s CPU, 0.138s wall-clock]
|
||||
Instantiating: [0.250s CPU, 0.254s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
10 initial candidates
|
||||
Finding invariants: [0.030s CPU, 0.025s wall-clock]
|
||||
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
|
||||
Instantiating groups... [0.010s CPU, 0.008s wall-clock]
|
||||
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
|
||||
Choosing groups...
|
||||
16 uncovered facts
|
||||
Choosing groups: [0.010s CPU, 0.009s wall-clock]
|
||||
Building translation key... [0.010s CPU, 0.003s wall-clock]
|
||||
Computing fact groups: [0.070s CPU, 0.067s wall-clock]
|
||||
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
||||
Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock]
|
||||
Building mutex information...
|
||||
Building mutex information: [0.010s CPU, 0.005s 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.160s CPU, 0.157s wall-clock]
|
||||
660 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
30 propositions removed
|
||||
Detecting unreachable propositions: [0.080s CPU, 0.087s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
31 of 31 variables necessary.
|
||||
16 of 31 mutex groups necessary.
|
||||
450 of 450 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.050s CPU, 0.050s wall-clock]
|
||||
Translator variables: 31
|
||||
Translator derived variables: 0
|
||||
Translator facts: 272
|
||||
Translator goal facts: 14
|
||||
Translator mutex groups: 16
|
||||
Translator total mutex groups size: 256
|
||||
Translator operators: 450
|
||||
Translator axioms: 0
|
||||
Translator task size: 3903
|
||||
Translator peak memory: 35416 KB
|
||||
Writing output... [0.060s CPU, 0.068s wall-clock]
|
||||
Done! [0.700s CPU, 0.713s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
||||
Time: 0.15s
|
||||
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.07s
|
||||
Memory: 55MB (+2MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 57MB (+2MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.09s
|
||||
|
||||
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.08s
|
||||
Memory: 60MB (+3MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 62MB (+2MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.10s
|
||||
|
||||
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.08s
|
||||
Memory: 65MB (+3MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.01s
|
||||
Memory: 67MB (+2MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.10s
|
||||
|
||||
Iteration 5
|
||||
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||||
Grounded Until: 15
|
||||
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||||
Grounding Time: 0.07s
|
||||
Memory: 69MB (+2MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.01s
|
||||
Memory: 72MB (+3MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.11s
|
||||
|
||||
Iteration 6
|
||||
Queue: [(5,25,0,True), (6,30,0,True)]
|
||||
Grounded Until: 20
|
||||
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
|
||||
Grounding Time: 0.09s
|
||||
Memory: 76MB (+4MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.01s
|
||||
Memory: 78MB (+2MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.13s
|
||||
|
||||
Iteration 7
|
||||
Queue: [(6,30,0,True)]
|
||||
Grounded Until: 25
|
||||
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
|
||||
Grounding Time: 0.07s
|
||||
Memory: 81MB (+3MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.02s
|
||||
Memory: 82MB (+1MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.12s
|
||||
|
||||
Iteration 8
|
||||
Queue: [(7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True)]
|
||||
Grounded Until: 30
|
||||
Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])]
|
||||
Grounding Time: 0.08s
|
||||
Memory: 85MB (+3MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.03s
|
||||
Memory: 88MB (+3MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.14s
|
||||
|
||||
Iteration 9
|
||||
Queue: [(8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True)]
|
||||
Grounded Until: 35
|
||||
Grounding... [('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])]
|
||||
Grounding Time: 0.08s
|
||||
Memory: 90MB (+2MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Answer: 1
|
||||
occurs(action(("unstack","e","j")),1) occurs(action(("put-down","e")),2) occurs(action(("unstack","j","d")),3) occurs(action(("put-down","j")),4) occurs(action(("unstack","d","l")),5) occurs(action(("put-down","d")),6) occurs(action(("unstack","l","c")),7) occurs(action(("put-down","l")),8) occurs(action(("unstack","c","g")),9) occurs(action(("put-down","c")),10) occurs(action(("unstack","i","h")),11) occurs(action(("stack","i","c")),12) occurs(action(("unstack","m","n")),13) occurs(action(("put-down","m")),14) occurs(action(("pick-up","n")),15) occurs(action(("stack","n","i")),16) occurs(action(("pick-up","d")),17) occurs(action(("stack","d","n")),18) occurs(action(("pick-up","j")),19) occurs(action(("stack","j","d")),20) occurs(action(("pick-up","l")),21) occurs(action(("stack","l","j")),22) occurs(action(("unstack","b","a")),23) occurs(action(("stack","b","l")),24) occurs(action(("unstack","a","o")),25) occurs(action(("stack","a","b")),26) occurs(action(("pick-up","e")),27) occurs(action(("stack","e","a")),28) occurs(action(("unstack","f","k")),29) occurs(action(("stack","f","e")),30) occurs(action(("pick-up","m")),31) occurs(action(("stack","m","f")),32) occurs(action(("pick-up","k")),33) occurs(action(("stack","k","m")),34) occurs(action(("pick-up","h")),35) occurs(action(("stack","h","k")),36) occurs(action(("pick-up","o")),37) occurs(action(("stack","o","h")),38) occurs(action(("pick-up","g")),39) occurs(action(("stack","g","o")),40)
|
||||
Solving Time: 0.02s
|
||||
Memory: 93MB (+3MB)
|
||||
SAT
|
||||
SATISFIABLE
|
||||
|
||||
Models : 1+
|
||||
Calls : 9
|
||||
Time : 1.061s (Solving: 0.06s 1st Model: 0.01s Unsat: 0.05s)
|
||||
CPU Time : 1.060s
|
||||
|
||||
Choices : 696 (Domain: 696)
|
||||
Conflicts : 44 (Analyzed: 38)
|
||||
Restarts : 0
|
||||
Model-Level : 251.0
|
||||
Problems : 9 (Average Length: 22.00 Splits: 0)
|
||||
Lemmas : 38 (Deleted: 0)
|
||||
Binary : 18 (Ratio: 47.37%)
|
||||
Ternary : 0 (Ratio: 0.00%)
|
||||
Conflict : 38 (Average Length: 30.9 Ratio: 100.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 38 (Average: 20.58 Max: 123 Sum: 782)
|
||||
Executed : 23 (Average: 12.82 Max: 123 Sum: 487 Ratio: 62.28%)
|
||||
Bounded : 15 (Average: 19.67 Max: 32 Sum: 295 Ratio: 37.72%)
|
||||
|
||||
Rules : 13116
|
||||
Atoms : 13116
|
||||
Bodies : 1 (Original: 0)
|
||||
Tight : Yes
|
||||
Variables : 33951 (Eliminated: 0 Frozen: 28593)
|
||||
Constraints : 245162 (Binary: 93.7% Ternary: 3.9% Other: 2.4%)
|
||||
|
||||
Memory Peak : 95MB
|
||||
Max. Length : 40 steps
|
||||
Sol. Length : 40 steps
|
||||
|
||||
|
||||
Loading…
Reference in New Issue
Block a user