patrick/tplp-planning-benchmark
1
0
Fork 0
Code Issues Releases Activity

Add benchmark result [fd-ps-e1-sh | ipc-2002 | depots-strips-automatic | 11]

Browse Source
This commit is contained in:
Potassco Bot 2017-11-24 07:14:19 +01:00
parent 88595928e0
commit c79276a6c4
Signed by: potassco-bot
GPG Key ID: 1F54208CE70DDF73
3 changed files with 577 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

40
fd-ps-e1-sh/ipc-2002_depots-strips-automatic_11.env Normal file
View File

@ -0,0 +1,40 @@
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
- -A 1
- --parallel=1
- --shallow
configuration:
id: fd-ps-e1-sh
instanceSets:
- lnpmr-hard-instances
options:
- --stats
- --verbose
- --print-call
- --translate
- -A 1
- --parallel=1
- --shallow
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-ps-e1-sh/ipc-2002_depots-strips-automatic_11.err Normal file
View File

@ -0,0 +1,18 @@
# configuration: {'id': 'fd-ps-e1-sh', 'options': ['--stats', '--verbose', '--print-call', '--translate', '-A 1', '--parallel=1', '--shallow'], 'instanceSets': ['lnpmr-hard-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', '-A 1', '--parallel=1', '--shallow']
# 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 -A 1 --query-at-last --check-at-last --forbid-actions --force-actions -c planner_on=1 -c _shallow=1 -c _closure=3 -c _parallel=1
FINISHED CPU 250.68 MEM 30288 MAXMEM 181060 STALE 1 MAXMEM_RSS 125996
<time name="ALL">250470</time>

519
fd-ps-e1-sh/ipc-2002_depots-strips-automatic_11.out Normal file
View File

@ -0,0 +1,519 @@
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.023s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.009s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.025s wall-clock]
Preparing model... [0.020s CPU, 0.018s wall-clock]
Generated 43 rules.
Computing model... [0.340s CPU, 0.337s wall-clock]
2415 relevant atoms
2024 auxiliary atoms
4439 final queue length
9131 total queue pushes
Completing instantiation... [0.720s CPU, 0.717s wall-clock]
Instantiating: [1.110s CPU, 1.110s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.040s CPU, 0.042s wall-clock]
Checking invariant weight... [0.000s CPU, 0.004s wall-clock]
Instantiating groups... [0.060s CPU, 0.055s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
Choosing groups...
34 uncovered facts
Choosing groups: [0.010s CPU, 0.013s wall-clock]
Building translation key... [0.010s CPU, 0.005s wall-clock]
Computing fact groups: [0.140s CPU, 0.139s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.003s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.005s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.008s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.040s CPU, 0.038s wall-clock]
Translating task: [0.800s CPU, 0.791s 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.394s 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.193s 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.278s wall-clock]
Done! [2.960s CPU, 2.978s wall-clock]
planner.py version 0.0.1
Time: 0.63s
Memory: 86MB
Iteration 1
Queue: [0]
Grounded Until: 0
Solving...
Solving Time: 0.00s
Memory: 86MB (+0MB)
UNSAT
Iteration Time: 0.00s
Iteration 2
Queue: [5]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.29s
Memory: 86MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 91MB (+5MB)
UNSAT
Iteration Time: 0.41s
Iteration 3
Queue: [10]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.34s
Memory: 103MB (+12MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 109MB (+6MB)
UNSAT
Iteration Time: 0.45s
Iteration 4
Queue: [15]
Grounded Until: 10
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.32s
Memory: 119MB (+10MB)
Unblocking actions...
Solving...
Solving Time: 0.96s
Memory: 125MB (+6MB)
UNSAT
Iteration Time: 1.38s
Iteration 5
Queue: [20]
Grounded Until: 15
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 0.32s
Memory: 135MB (+10MB)
Unblocking actions...
Solving...
Solving Time: 4.66s
Memory: 142MB (+7MB)
UNKNOWN
Iteration Time: 5.11s
Iteration 6
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 4.58s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 4.58s
Iteration 7
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 4.84s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 4.84s
Iteration 8
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 5.20s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 5.20s
Iteration 9
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 5.23s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 5.23s
Iteration 10
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 5.24s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 5.24s
Iteration 11
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 5.47s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 5.47s
Iteration 12
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 5.48s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 5.48s
Iteration 13
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 5.30s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 5.30s
Iteration 14
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 5.71s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 5.71s
Iteration 15
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 5.23s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 5.23s
Iteration 16
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 6.05s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 6.05s
Iteration 17
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 5.85s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 5.85s
Iteration 18
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 6.06s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 6.06s
Iteration 19
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 5.64s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 5.64s
Iteration 20
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 5.96s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 5.96s
Iteration 21
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 6.08s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 6.08s
Iteration 22
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 6.01s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 6.01s
Iteration 23
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 5.68s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 5.68s
Iteration 24
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 6.19s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 6.19s
Iteration 25
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 6.47s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 6.47s
Iteration 26
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 6.18s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 6.18s
Iteration 27
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 6.32s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 6.32s
Iteration 28
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 6.53s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 6.53s
Iteration 29
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 6.51s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 6.51s
Iteration 30
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 6.45s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 6.45s
Iteration 31
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 6.18s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 6.18s
Iteration 32
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 6.87s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 6.87s
Iteration 33
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 7.14s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 7.14s
Iteration 34
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 6.51s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 6.51s
Iteration 35
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 6.68s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 6.68s
Iteration 36
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 6.58s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 6.58s
Iteration 37
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 6.20s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 6.20s
Iteration 38
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 7.02s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 7.02s
Iteration 39
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 7.21s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 7.21s
Iteration 40
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 6.65s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 6.65s
Iteration 41
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 6.71s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 6.71s
Iteration 42
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 7.05s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 7.05s
Iteration 43
Queue: [20]
Grounded Until: 20
Solving...
Solving Time: 6.94s
Memory: 142MB (+0MB)
UNKNOWN
Iteration Time: 6.94s
Iteration 44
Queue: [20]
Grounded Until: 20
Solving...
Answer: 1
occurs(action(("lift","hoist2","crate9","crate5","depot2")),1) occurs(action(("lift","hoist1","crate3","crate0","depot1")),1) occurs(action(("drive","truck1","distributor0","depot1")),1) occurs(action(("lift","hoist5","crate8","crate7","distributor2")),2) occurs(action(("load","hoist2","crate9","truck0","depot2")),2) occurs(action(("load","hoist1","crate3","truck1","depot1")),2) occurs(action(("lift","hoist2","crate5","crate4","depot2")),3) occurs(action(("lift","hoist0","crate1","pallet0","depot0")),3) occurs(action(("lift","hoist1","crate0","pallet1","depot1")),3) occurs(action(("drive","truck0","depot2","depot1")),3) occurs(action(("drive","truck1","depot1","depot2")),3) occurs(action(("drop","hoist0","crate1","pallet0","depot0")),4) occurs(action(("load","hoist2","crate5","truck1","depot2")),4) occurs(action(("load","hoist1","crate0","truck0","depot1")),4) occurs(action(("lift","hoist2","crate4","crate2","depot2")),5) occurs(action(("drive","truck0","depot1","distributor2")),5) occurs(action(("lift","hoist0","crate1","pallet0","depot0")),6) occurs(action(("load","hoist5","crate8","truck0","distributor2")),6) occurs(action(("load","hoist2","crate4","truck1","depot2")),6) occurs(action(("lift","hoist5","crate7","crate6","distributor2")),7) occurs(action(("lift","hoist2","crate2","pallet2","depot2")),7) occurs(action(("drive","truck1","depot2","distributor2")),7) occurs(action(("drive","truck0","distributor2","depot2")),7) occurs(action(("drop","hoist0","crate1","pallet0","depot0")),8) occurs(action(("load","hoist5","crate7","truck1","distributor2")),8) occurs(action(("load","hoist2","crate2","truck0","depot2")),8) occurs(action(("lift","hoist5","crate6","pallet5","distributor2")),9) occurs(action(("drive","truck1","distributor2","depot2")),9) occurs(action(("drive","truck0","depot2","distributor2")),9) occurs(action(("unload","hoist2","crate5","truck1","depot2")),10) occurs(action(("lift","hoist0","crate1","pallet0","depot0")),10) occurs(action(("load","hoist5","crate6","truck0","distributor2")),10) occurs(action(("unload","hoist5","crate2","truck0","distributor2")),11) occurs(action(("drive","truck1","depot2","depot0")),11) occurs(action(("drop","hoist2","crate5","pallet2","depot2")),12) occurs(action(("drop","hoist5","crate2","pallet5","distributor2")),12) occurs(action(("load","hoist0","crate1","truck1","depot0")),12) occurs(action(("unload","hoist5","crate9","truck0","distributor2")),13) occurs(action(("lift","hoist2","crate5","pallet2","depot2")),13) occurs(action(("unload","hoist0","crate4","truck1","depot0")),13) occurs(action(("drop","hoist5","crate9","crate2","distributor2")),14) occurs(action(("drop","hoist2","crate5","pallet2","depot2")),14) occurs(action(("drop","hoist0","crate4","pallet0","depot0")),14) occurs(action(("drive","truck0","distributor2","distributor0")),14) occurs(action(("drive","truck1","depot0","distributor1")),14) occurs(action(("unload","hoist3","crate8","truck0","distributor0")),15) occurs(action(("lift","hoist2","crate5","pallet2","depot2")),15) occurs(action(("lift","hoist0","crate4","pallet0","depot0")),15) occurs(action(("unload","hoist4","crate1","truck1","distributor1")),15) occurs(action(("drop","hoist3","crate8","pallet3","distributor0")),16) occurs(action(("drop","hoist2","crate5","pallet2","depot2")),16) occurs(action(("drop","hoist0","crate4","pallet0","depot0")),16) occurs(action(("drop","hoist4","crate1","pallet4","distributor1")),16) occurs(action(("drive","truck0","distributor0","depot2")),16) occurs(action(("lift","hoist3","crate8","pallet3","distributor0")),17) occurs(action(("unload","hoist4","crate7","truck1","distributor1")),17) occurs(action(("unload","hoist2","crate6","truck0","depot2")),17) occurs(action(("drop","hoist3","crate8","pallet3","distributor0")),18) occurs(action(("drop","hoist4","crate7","crate1","distributor1")),18) occurs(action(("drop","hoist2","crate6","crate5","depot2")),18) occurs(action(("lift","hoist0","crate4","pallet0","depot0")),18) occurs(action(("drive","truck0","depot2","distributor1")),18) occurs(action(("drive","truck1","distributor1","distributor2")),18) occurs(action(("drop","hoist0","crate4","pallet0","depot0")),19) occurs(action(("unload","hoist5","crate3","truck1","distributor2")),19) occurs(action(("unload","hoist4","crate0","truck0","distributor1")),19) occurs(action(("drop","hoist5","crate3","crate9","distributor2")),20) occurs(action(("drop","hoist4","crate0","crate7","distributor1")),20) occurs(action(("drive","truck1","distributor2","depot2")),20)
Solving Time: 6.38s
Memory: 142MB (+0MB)
SAT
SATISFIABLE
Models : 1+
Calls : 44
Time : 246.325s (Solving: 243.36s 1st Model: 6.36s Unsat: 0.95s)
CPU Time : 246.370s
Choices : 583812
Conflicts : 374197 (Analyzed: 374195)
Restarts : 4018 (Average: 93.13 Last: 157)
Model-Level : 74.0
Problems : 44 (Average Length: 20.86 Splits: 0)
Lemmas : 374195 (Deleted: 339702)
Binary : 4410 (Ratio: 1.18%)
Ternary : 4252 (Ratio: 1.14%)
Conflict : 374195 (Average Length: 301.2 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 374195 (Average: 1.58 Max: 56 Sum: 589609)
Executed : 371655 (Average: 1.50 Max: 56 Sum: 562971 Ratio: 95.48%)
Bounded : 2540 (Average: 10.49 Max: 22 Sum: 26638 Ratio: 4.52%)
Rules : 54531
Atoms : 54531
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 49079 (Eliminated: 0 Frozen: 39460)
Constraints : 407166 (Binary: 97.0% Ternary: 1.3% Other: 1.7%)
Memory Peak : 143MB
Max. Length : 20 steps
Sol. Length : 20 steps