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

Add benchmark result [fd-pc-e1-sh | ipc-2002 | depots-strips-automatic | 4]

Browse Source
This commit is contained in:
Potassco Bot
2017-11-23 21:42:58 +01:00
parent 7265c30cd0
commit 5c95234e8a
3 changed files with 219 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

159
fd-pc-e1-sh/ipc-2002_depots-strips-automatic_4.out Normal file
View File

@@ -0,0 +1,159 @@
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-4.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-4.pddl
Parsing...
Parsing: [0.020s CPU, 0.015s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.005s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.018s wall-clock]
Preparing model... [0.010s CPU, 0.011s wall-clock]
Generated 43 rules.
Computing model... [0.120s CPU, 0.115s wall-clock]
860 relevant atoms
750 auxiliary atoms
1610 final queue length
3016 total queue pushes
Completing instantiation... [0.200s CPU, 0.208s wall-clock]
Instantiating: [0.350s CPU, 0.359s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.050s CPU, 0.046s wall-clock]
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
Instantiating groups... [0.030s CPU, 0.024s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.001s wall-clock]
Choosing groups...
20 uncovered facts
Choosing groups: [0.000s CPU, 0.006s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.100s CPU, 0.092s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.002s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.004s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.012s wall-clock]
Translating task: [0.240s CPU, 0.235s wall-clock]
720 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
30 propositions removed
Detecting unreachable propositions: [0.120s CPU, 0.118s wall-clock]
Reordering and filtering variables...
32 of 32 variables necessary.
22 of 32 mutex groups necessary.
540 of 540 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.060s CPU, 0.062s wall-clock]
Translator variables: 32
Translator derived variables: 0
Translator facts: 186
Translator goal facts: 6
Translator mutex groups: 22
Translator total mutex groups size: 222
Translator operators: 540
Translator axioms: 0
Translator task size: 5114
Translator peak memory: 36184 KB
Writing output... [0.080s CPU, 0.087s wall-clock]
Done! [0.980s CPU, 0.987s wall-clock]
planner.py version 0.0.1
Time: 0.21s
Memory: 57MB
Iteration 1
Queue: [5]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.08s
Memory: 60MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 62MB (+2MB)
UNSAT
Iteration Time: 0.11s
Iteration 2
Queue: [7]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('check', [7])]
Grounding Time: 0.04s
Memory: 63MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 64MB (+1MB)
UNSAT
Iteration Time: 0.06s
Iteration 3
Queue: [9]
Grounded Until: 7
Grounding... [('step', [8]), ('step', [9]), ('check', [9])]
Grounding Time: 0.04s
Memory: 64MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 65MB (+1MB)
UNSAT
Iteration Time: 0.05s
Iteration 4
Queue: [14]
Grounded Until: 9
Grounding... [('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('check', [14])]
Grounding Time: 0.09s
Memory: 69MB (+4MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("lift","hoist0","crate7","crate4","depot0")),1) occurs(action(("drive","truck0","distributor1","depot0")),1) occurs(action(("lift","hoist2","crate6","crate5","distributor1")),1) occurs(action(("lift","hoist1","crate2","pallet1","distributor0")),2) occurs(action(("load","hoist0","crate7","truck0","depot0")),2) occurs(action(("load","hoist2","crate6","truck1","distributor1")),2) occurs(action(("lift","hoist2","crate5","crate3","distributor1")),3) occurs(action(("lift","hoist0","crate4","crate1","depot0")),3) occurs(action(("load","hoist2","crate5","truck1","distributor1")),4) occurs(action(("load","hoist0","crate4","truck0","depot0")),4) occurs(action(("lift","hoist2","crate3","pallet2","distributor1")),5) occurs(action(("drive","truck1","distributor1","depot0")),5) occurs(action(("lift","hoist0","crate1","crate0","depot0")),5) occurs(action(("drop","hoist1","crate2","pallet1","distributor0")),5) occurs(action(("drive","truck0","depot0","distributor1")),5) occurs(action(("lift","hoist1","crate2","pallet1","distributor0")),6) occurs(action(("load","hoist0","crate1","truck1","depot0")),6) occurs(action(("load","hoist2","crate3","truck0","distributor1")),6) occurs(action(("lift","hoist0","crate0","pallet0","depot0")),7) occurs(action(("drive","truck0","distributor1","depot0")),7) occurs(action(("drive","truck1","depot0","distributor1")),7) occurs(action(("unload","hoist2","crate5","truck1","distributor1")),8) occurs(action(("load","hoist0","crate0","truck0","depot0")),8) occurs(action(("drop","hoist1","crate2","pallet1","distributor0")),8) occurs(action(("drop","hoist2","crate5","pallet2","distributor1")),9) occurs(action(("unload","hoist0","crate7","truck0","depot0")),9) occurs(action(("lift","hoist1","crate2","pallet1","distributor0")),9) occurs(action(("drive","truck1","distributor1","distributor0")),9) occurs(action(("drop","hoist0","crate7","pallet0","depot0")),10) occurs(action(("load","hoist1","crate2","truck1","distributor0")),10) occurs(action(("unload","hoist1","crate6","truck1","distributor0")),11) occurs(action(("unload","hoist0","crate4","truck0","depot0")),11) occurs(action(("drop","hoist1","crate6","pallet1","distributor0")),12) occurs(action(("drop","hoist0","crate4","crate7","depot0")),12) occurs(action(("unload","hoist1","crate2","truck1","distributor0")),13) occurs(action(("unload","hoist0","crate0","truck0","depot0")),13) occurs(action(("drop","hoist1","crate2","crate6","distributor0")),14) occurs(action(("drop","hoist0","crate0","crate4","depot0")),14) occurs(action(("drive","truck0","depot0","distributor0")),14)
Solving Time: 0.06s
Memory: 71MB (+2MB)
SAT
SATISFIABLE
Models : 1+
Calls : 4
Time : 0.634s (Solving: 0.06s 1st Model: 0.06s Unsat: 0.00s)
CPU Time : 0.620s
Choices : 1100
Conflicts : 423 (Analyzed: 420)
Restarts : 5 (Average: 84.00 Last: 47)
Model-Level : 40.0
Problems : 4 (Average Length: 10.75 Splits: 0)
Lemmas : 420 (Deleted: 0)
Binary : 16 (Ratio: 3.81%)
Ternary : 13 (Ratio: 3.10%)
Conflict : 420 (Average Length: 78.3 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 420 (Average: 3.36 Max: 38 Sum: 1410)
Executed : 396 (Average: 2.56 Max: 38 Sum: 1076 Ratio: 76.31%)
Bounded : 24 (Average: 13.92 Max: 16 Sum: 334 Ratio: 23.69%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 15523 (Eliminated: 0 Frozen: 8544)
Constraints : 97204 (Binary: 94.2% Ternary: 3.1% Other: 2.7%)
Memory Peak : 71MB
Max. Length : 14 steps
Sol. Length : 14 steps