Add benchmark result [fd-pb-e1-sh-h | ipc-1998 | grid-round-2-strips | 1]
This commit is contained in:
parent
25d4016b4f
commit
8f3e69cdcb
43
fd-pb-e1-sh-h/ipc-1998_grid-round-2-strips_1.env
Normal file
43
fd-pb-e1-sh-h/ipc-1998_grid-round-2-strips_1.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-1998/domains/grid-round-2-strips/domain.pddl
|
||||||
|
- /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/grid-round-2-strips/instances/instance-1.pddl
|
||||||
|
- --stats
|
||||||
|
- --verbose
|
||||||
|
- --print-call
|
||||||
|
- --translate
|
||||||
|
- -B 0.9
|
||||||
|
- --parallel=1
|
||||||
|
- --shallow
|
||||||
|
- --use-heuristic
|
||||||
|
configuration:
|
||||||
|
id: fd-pb-e1-sh-h
|
||||||
|
instanceSets:
|
||||||
|
- lpnmr-hard-instances
|
||||||
|
- lpnmr-easy-instances
|
||||||
|
options:
|
||||||
|
- --stats
|
||||||
|
- --verbose
|
||||||
|
- --print-call
|
||||||
|
- --translate
|
||||||
|
- -B 0.9
|
||||||
|
- --parallel=1
|
||||||
|
- --shallow
|
||||||
|
- --use-heuristic
|
||||||
|
exitCode: 0
|
||||||
|
instance:
|
||||||
|
domain: grid-round-2-strips
|
||||||
|
instance: 1
|
||||||
|
ipc: ipc-1998
|
||||||
|
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-1998_grid-round-2-strips_1.err
Normal file
18
fd-pb-e1-sh-h/ipc-1998_grid-round-2-strips_1.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': ['lpnmr-hard-instances', 'lpnmr-easy-instances']}
|
||||||
|
# instance: {'ipc': 'ipc-1998', 'domain': 'grid-round-2-strips', 'instance': 1}
|
||||||
|
# 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-1998/domains/grid-round-2-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/grid-round-2-strips/instances/instance-1.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-1998/domains/grid-round-2-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/grid-round-2-strips/instances/instance-1.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 6.07 MEM 0 MAXMEM 152804 STALE 1 MAXMEM_RSS 97960
|
||||||
|
<time name="ALL">5920</time>
|
||||||
|
|
155
fd-pb-e1-sh-h/ipc-1998_grid-round-2-strips_1.out
Normal file
155
fd-pb-e1-sh-h/ipc-1998_grid-round-2-strips_1.out
Normal file
@ -0,0 +1,155 @@
|
|||||||
|
INFO Running translator.
|
||||||
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/grid-round-2-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/grid-round-2-strips/instances/instance-1.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-1998/domains/grid-round-2-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/grid-round-2-strips/instances/instance-1.pddl
|
||||||
|
Parsing...
|
||||||
|
Parsing: [0.030s CPU, 0.030s 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.020s CPU, 0.026s wall-clock]
|
||||||
|
Preparing model... [0.030s CPU, 0.023s wall-clock]
|
||||||
|
Generated 46 rules.
|
||||||
|
Computing model... [0.320s CPU, 0.324s wall-clock]
|
||||||
|
3114 relevant atoms
|
||||||
|
1522 auxiliary atoms
|
||||||
|
4636 final queue length
|
||||||
|
9238 total queue pushes
|
||||||
|
Completing instantiation... [0.790s CPU, 0.792s wall-clock]
|
||||||
|
Instantiating: [1.170s CPU, 1.177s wall-clock]
|
||||||
|
Computing fact groups...
|
||||||
|
Finding invariants...
|
||||||
|
12 initial candidates
|
||||||
|
Finding invariants: [0.020s CPU, 0.016s wall-clock]
|
||||||
|
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
|
||||||
|
Instantiating groups... [0.010s CPU, 0.006s wall-clock]
|
||||||
|
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
|
||||||
|
Choosing groups...
|
||||||
|
1 uncovered facts
|
||||||
|
Choosing groups: [0.010s CPU, 0.006s wall-clock]
|
||||||
|
Building translation key... [0.000s CPU, 0.003s wall-clock]
|
||||||
|
Computing fact groups: [0.050s CPU, 0.047s wall-clock]
|
||||||
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
||||||
|
Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||||||
|
Building mutex information...
|
||||||
|
Building mutex information: [0.000s CPU, 0.002s wall-clock]
|
||||||
|
Translating task...
|
||||||
|
Processing axioms...
|
||||||
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||||
|
Processing axioms: [0.040s CPU, 0.036s wall-clock]
|
||||||
|
Translating task: [0.640s CPU, 0.638s wall-clock]
|
||||||
|
225 effect conditions simplified
|
||||||
|
0 implied preconditions added
|
||||||
|
Detecting unreachable propositions...
|
||||||
|
0 operators removed
|
||||||
|
0 axioms removed
|
||||||
|
69 propositions removed
|
||||||
|
Detecting unreachable propositions: [0.320s CPU, 0.311s wall-clock]
|
||||||
|
Reordering and filtering variables...
|
||||||
|
19 of 19 variables necessary.
|
||||||
|
1 of 19 mutex groups necessary.
|
||||||
|
2384 of 2384 operators necessary.
|
||||||
|
0 of 0 axiom rules necessary.
|
||||||
|
Reordering and filtering variables: [0.100s CPU, 0.101s wall-clock]
|
||||||
|
Translator variables: 19
|
||||||
|
Translator derived variables: 0
|
||||||
|
Translator facts: 277
|
||||||
|
Translator goal facts: 1
|
||||||
|
Translator mutex groups: 1
|
||||||
|
Translator total mutex groups size: 10
|
||||||
|
Translator operators: 2384
|
||||||
|
Translator axioms: 0
|
||||||
|
Translator task size: 14119
|
||||||
|
Translator peak memory: 42584 KB
|
||||||
|
Writing output... [0.220s CPU, 0.241s wall-clock]
|
||||||
|
Done! [2.560s CPU, 2.580s wall-clock]
|
||||||
|
planner.py version 0.0.1
|
||||||
|
|
||||||
|
Time: 0.56s
|
||||||
|
Memory: 78MB
|
||||||
|
|
||||||
|
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: 78MB (+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.36s
|
||||||
|
Memory: 80MB (+2MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.02s
|
||||||
|
Memory: 86MB (+6MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.52s
|
||||||
|
|
||||||
|
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.36s
|
||||||
|
Memory: 91MB (+5MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.02s
|
||||||
|
Memory: 98MB (+7MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.54s
|
||||||
|
|
||||||
|
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.41s
|
||||||
|
Memory: 106MB (+8MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Answer: 1
|
||||||
|
occurs(action(("move","node2-4","node1-4")),1) occurs(action(("move","node1-4","node0-4")),2) occurs(action(("move","node0-4","node0-3")),3) occurs(action(("move","node0-3","node0-2")),4) occurs(action(("pickup","node0-2","key3")),5) occurs(action(("move","node0-2","node0-3")),6) occurs(action(("move","node0-3","node1-3")),7) occurs(action(("unlock","node1-3","node2-3","key3","square")),8) occurs(action(("move","node1-3","node2-3")),9) occurs(action(("pickup-and-loose","node2-3","key0","key3")),10) occurs(action(("move","node2-3","node1-3")),11) occurs(action(("move","node1-3","node1-2")),12) occurs(action(("move","node1-2","node1-1")),13) occurs(action(("putdown","node1-1","key0")),14) occurs(action(("move","node1-1","node1-0")),15)
|
||||||
|
Solving Time: 0.04s
|
||||||
|
Memory: 114MB (+8MB)
|
||||||
|
SAT
|
||||||
|
SATISFIABLE
|
||||||
|
|
||||||
|
Models : 1+
|
||||||
|
Calls : 4
|
||||||
|
Time : 2.257s (Solving: 0.03s 1st Model: 0.03s Unsat: 0.00s)
|
||||||
|
CPU Time : 2.220s
|
||||||
|
|
||||||
|
Choices : 154 (Domain: 150)
|
||||||
|
Conflicts : 61 (Analyzed: 60)
|
||||||
|
Restarts : 0
|
||||||
|
Model-Level : 35.0
|
||||||
|
Problems : 4 (Average Length: 9.50 Splits: 0)
|
||||||
|
Lemmas : 60 (Deleted: 0)
|
||||||
|
Binary : 22 (Ratio: 36.67%)
|
||||||
|
Ternary : 9 (Ratio: 15.00%)
|
||||||
|
Conflict : 60 (Average Length: 119.9 Ratio: 100.00%)
|
||||||
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||||
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||||
|
Backjumps : 60 (Average: 3.72 Max: 24 Sum: 223)
|
||||||
|
Executed : 54 (Average: 2.27 Max: 24 Sum: 136 Ratio: 60.99%)
|
||||||
|
Bounded : 6 (Average: 14.50 Max: 17 Sum: 87 Ratio: 39.01%)
|
||||||
|
|
||||||
|
Rules : 47429
|
||||||
|
Atoms : 47429
|
||||||
|
Bodies : 1 (Original: 0)
|
||||||
|
Tight : Yes
|
||||||
|
Variables : 39742 (Eliminated: 0 Frozen: 31872)
|
||||||
|
Constraints : 165898 (Binary: 97.3% Ternary: 1.3% Other: 1.4%)
|
||||||
|
|
||||||
|
Memory Peak : 115MB
|
||||||
|
Max. Length : 15 steps
|
||||||
|
Sol. Length : 15 steps
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue
Block a user