Add benchmark result [fd-pb-e1-sh-h | ipc-2002 | depots-strips-automatic | 11]
This commit is contained in:
parent
ab853abe61
commit
4ffb42937d
43
fd-pb-e1-sh-h/ipc-2002_depots-strips-automatic_11.env
Normal file
43
fd-pb-e1-sh-h/ipc-2002_depots-strips-automatic_11.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-2002/domains/depots-strips-automatic/domain.pddl
|
||||||
|
- /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/instances/instance-11.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: depots-strips-automatic
|
||||||
|
instance: 11
|
||||||
|
ipc: ipc-2002
|
||||||
|
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-2002_depots-strips-automatic_11.err
Normal file
18
fd-pb-e1-sh-h/ipc-2002_depots-strips-automatic_11.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-2002', 'domain': 'depots-strips-automatic', 'instance': 11}
|
||||||
|
# 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-2002/domains/depots-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/instances/instance-11.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-2002/domains/depots-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/instances/instance-11.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 15.36 MEM 30288 MAXMEM 263044 STALE 1 MAXMEM_RSS 207960
|
||||||
|
<time name="ALL">15190</time>
|
||||||
|
|
181
fd-pb-e1-sh-h/ipc-2002_depots-strips-automatic_11.out
Normal file
181
fd-pb-e1-sh-h/ipc-2002_depots-strips-automatic_11.out
Normal file
@ -0,0 +1,181 @@
|
|||||||
|
INFO Running translator.
|
||||||
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/instances/instance-11.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-2002/domains/depots-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/instances/instance-11.pddl
|
||||||
|
Parsing...
|
||||||
|
Parsing: [0.020s CPU, 0.017s wall-clock]
|
||||||
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||||||
|
Instantiating...
|
||||||
|
Generating Datalog program... [0.000s CPU, 0.007s wall-clock]
|
||||||
|
Normalizing Datalog program...
|
||||||
|
Normalizing Datalog program: [0.020s CPU, 0.019s wall-clock]
|
||||||
|
Preparing model... [0.020s CPU, 0.015s wall-clock]
|
||||||
|
Generated 43 rules.
|
||||||
|
Computing model... [0.310s CPU, 0.318s wall-clock]
|
||||||
|
2415 relevant atoms
|
||||||
|
2024 auxiliary atoms
|
||||||
|
4439 final queue length
|
||||||
|
9131 total queue pushes
|
||||||
|
Completing instantiation... [0.710s CPU, 0.711s wall-clock]
|
||||||
|
Instantiating: [1.070s CPU, 1.075s wall-clock]
|
||||||
|
Computing fact groups...
|
||||||
|
Finding invariants...
|
||||||
|
16 initial candidates
|
||||||
|
Finding invariants: [0.050s CPU, 0.051s wall-clock]
|
||||||
|
Checking invariant weight... [0.000s CPU, 0.004s wall-clock]
|
||||||
|
Instantiating groups... [0.060s CPU, 0.057s wall-clock]
|
||||||
|
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
|
||||||
|
Choosing groups...
|
||||||
|
34 uncovered facts
|
||||||
|
Choosing groups: [0.010s CPU, 0.012s wall-clock]
|
||||||
|
Building translation key... [0.000s CPU, 0.004s wall-clock]
|
||||||
|
Computing fact groups: [0.150s CPU, 0.150s wall-clock]
|
||||||
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
|
||||||
|
Building dictionary for full mutex groups... [0.000s CPU, 0.004s wall-clock]
|
||||||
|
Building mutex information...
|
||||||
|
Building mutex information: [0.010s CPU, 0.007s wall-clock]
|
||||||
|
Translating task...
|
||||||
|
Processing axioms...
|
||||||
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||||
|
Processing axioms: [0.040s CPU, 0.037s wall-clock]
|
||||||
|
Translating task: [0.800s CPU, 0.797s wall-clock]
|
||||||
|
2520 effect conditions simplified
|
||||||
|
0 implied preconditions added
|
||||||
|
Detecting unreachable propositions...
|
||||||
|
0 operators removed
|
||||||
|
0 axioms removed
|
||||||
|
46 propositions removed
|
||||||
|
Detecting unreachable propositions: [0.400s CPU, 0.395s wall-clock]
|
||||||
|
Reordering and filtering variables...
|
||||||
|
44 of 44 variables necessary.
|
||||||
|
32 of 44 mutex groups necessary.
|
||||||
|
1800 of 1800 operators necessary.
|
||||||
|
0 of 0 axiom rules necessary.
|
||||||
|
Reordering and filtering variables: [0.190s CPU, 0.191s wall-clock]
|
||||||
|
Translator variables: 44
|
||||||
|
Translator derived variables: 0
|
||||||
|
Translator facts: 356
|
||||||
|
Translator goal facts: 10
|
||||||
|
Translator mutex groups: 32
|
||||||
|
Translator total mutex groups size: 452
|
||||||
|
Translator operators: 1800
|
||||||
|
Translator axioms: 0
|
||||||
|
Translator task size: 16702
|
||||||
|
Translator peak memory: 43608 KB
|
||||||
|
Writing output... [0.260s CPU, 0.275s wall-clock]
|
||||||
|
Done! [2.930s CPU, 2.949s wall-clock]
|
||||||
|
planner.py version 0.0.1
|
||||||
|
|
||||||
|
Time: 0.60s
|
||||||
|
Memory: 86MB
|
||||||
|
|
||||||
|
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: 86MB (+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.30s
|
||||||
|
Memory: 86MB (+0MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.01s
|
||||||
|
Memory: 92MB (+6MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.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
|
||||||
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||||||
|
Grounding Time: 0.35s
|
||||||
|
Memory: 103MB (+11MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.02s
|
||||||
|
Memory: 110MB (+7MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.46s
|
||||||
|
|
||||||
|
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.32s
|
||||||
|
Memory: 119MB (+9MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.53s
|
||||||
|
Memory: 126MB (+7MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.96s
|
||||||
|
|
||||||
|
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.33s
|
||||||
|
Memory: 138MB (+12MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 7.61s
|
||||||
|
Memory: 210MB (+72MB)
|
||||||
|
UNKNOWN
|
||||||
|
Iteration Time: 8.06s
|
||||||
|
|
||||||
|
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.41s
|
||||||
|
Memory: 216MB (+6MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Answer: 1
|
||||||
|
occurs(action(("lift","hoist2","crate9","crate5","depot2")),1) occurs(action(("lift","hoist0","crate1","pallet0","depot0")),1) occurs(action(("lift","hoist1","crate3","crate0","depot1")),1) occurs(action(("lift","hoist5","crate8","crate7","distributor2")),1) occurs(action(("drive","truck1","distributor0","depot0")),1) occurs(action(("drive","truck0","depot2","distributor2")),1) occurs(action(("load","hoist5","crate8","truck0","distributor2")),2) occurs(action(("load","hoist0","crate1","truck1","depot0")),2) occurs(action(("lift","hoist5","crate7","crate6","distributor2")),3) occurs(action(("drive","truck1","depot0","distributor1")),3) occurs(action(("unload","hoist4","crate1","truck1","distributor1")),4) occurs(action(("load","hoist5","crate7","truck0","distributor2")),4) occurs(action(("drop","hoist4","crate1","pallet4","distributor1")),5) occurs(action(("lift","hoist5","crate6","pallet5","distributor2")),5) occurs(action(("drive","truck1","distributor1","distributor2")),5) occurs(action(("drive","truck0","distributor2","depot2")),5) occurs(action(("load","hoist2","crate9","truck0","depot2")),6) occurs(action(("load","hoist5","crate6","truck1","distributor2")),6) occurs(action(("lift","hoist2","crate5","crate4","depot2")),7) occurs(action(("drive","truck1","distributor2","depot2")),7) occurs(action(("load","hoist2","crate5","truck1","depot2")),8) occurs(action(("lift","hoist2","crate4","crate2","depot2")),9) occurs(action(("load","hoist2","crate4","truck0","depot2")),10) occurs(action(("lift","hoist2","crate2","pallet2","depot2")),11) occurs(action(("load","hoist2","crate2","truck0","depot2")),12) occurs(action(("unload","hoist2","crate5","truck1","depot2")),13) occurs(action(("drive","truck0","depot2","distributor2")),13) occurs(action(("drop","hoist2","crate5","pallet2","depot2")),14) occurs(action(("unload","hoist5","crate2","truck0","distributor2")),14) occurs(action(("drop","hoist5","crate2","pallet5","distributor2")),15) occurs(action(("unload","hoist2","crate6","truck1","depot2")),15) occurs(action(("drop","hoist2","crate6","crate5","depot2")),16) occurs(action(("unload","hoist5","crate9","truck0","distributor2")),16) occurs(action(("drive","truck1","depot2","depot1")),16) occurs(action(("drop","hoist5","crate9","crate2","distributor2")),17) occurs(action(("load","hoist1","crate3","truck1","depot1")),17) occurs(action(("drive","truck0","distributor2","distributor1")),17) occurs(action(("unload","hoist4","crate7","truck0","distributor1")),18) occurs(action(("lift","hoist1","crate0","pallet1","depot1")),18) occurs(action(("drop","hoist4","crate7","crate1","distributor1")),19) occurs(action(("drive","truck0","distributor1","distributor0")),19) occurs(action(("load","hoist1","crate0","truck1","depot1")),19) occurs(action(("unload","hoist3","crate8","truck0","distributor0")),20) occurs(action(("drive","truck1","depot1","distributor1")),20) occurs(action(("drop","hoist3","crate8","pallet3","distributor0")),21) occurs(action(("unload","hoist4","crate0","truck1","distributor1")),21) occurs(action(("drive","truck0","distributor0","depot0")),21) occurs(action(("drop","hoist4","crate0","crate7","distributor1")),22) occurs(action(("unload","hoist0","crate4","truck0","depot0")),22) occurs(action(("drive","truck1","distributor1","distributor2")),22) occurs(action(("drop","hoist0","crate4","pallet0","depot0")),23) occurs(action(("unload","hoist5","crate3","truck1","distributor2")),23) occurs(action(("drive","truck0","depot0","distributor2")),23) occurs(action(("drop","hoist5","crate3","crate9","distributor2")),24) occurs(action(("drive","truck1","distributor2","depot2")),24) occurs(action(("drive","truck0","distributor2","depot2")),24) occurs(action(("drive","truck0","depot2","distributor0")),25) occurs(action(("drive","truck1","depot2","distributor2")),25)
|
||||||
|
Solving Time: 0.07s
|
||||||
|
Memory: 220MB (+4MB)
|
||||||
|
SAT
|
||||||
|
SATISFIABLE
|
||||||
|
|
||||||
|
Models : 1+
|
||||||
|
Calls : 6
|
||||||
|
Time : 11.157s (Solving: 8.15s 1st Model: 0.03s Unsat: 0.52s)
|
||||||
|
CPU Time : 11.120s
|
||||||
|
|
||||||
|
Choices : 62771 (Domain: 62761)
|
||||||
|
Conflicts : 10299 (Analyzed: 10297)
|
||||||
|
Restarts : 111 (Average: 92.77 Last: 74)
|
||||||
|
Model-Level : 507.0
|
||||||
|
Problems : 6 (Average Length: 14.50 Splits: 0)
|
||||||
|
Lemmas : 10297 (Deleted: 7165)
|
||||||
|
Binary : 38 (Ratio: 0.37%)
|
||||||
|
Ternary : 18 (Ratio: 0.17%)
|
||||||
|
Conflict : 10297 (Average Length: 3571.5 Ratio: 100.00%)
|
||||||
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||||
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||||
|
Backjumps : 10297 (Average: 3.85 Max: 366 Sum: 39628)
|
||||||
|
Executed : 10258 (Average: 3.79 Max: 366 Sum: 39045 Ratio: 98.53%)
|
||||||
|
Bounded : 39 (Average: 14.95 Max: 22 Sum: 583 Ratio: 1.47%)
|
||||||
|
|
||||||
|
Rules : 54531
|
||||||
|
Atoms : 54531
|
||||||
|
Bodies : 1 (Original: 0)
|
||||||
|
Tight : Yes
|
||||||
|
Variables : 62010 (Eliminated: 0 Frozen: 50290)
|
||||||
|
Constraints : 616120 (Binary: 97.3% Ternary: 1.2% Other: 1.5%)
|
||||||
|
|
||||||
|
Memory Peak : 224MB
|
||||||
|
Max. Length : 25 steps
|
||||||
|
Sol. Length : 25 steps
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue
Block a user