Add benchmark result [fd-pa-e1-sh | ipc-2002 | depots-strips-automatic | 17]
This commit is contained in:
142
fd-pa-e1-sh/ipc-2002_depots-strips-automatic_17.out
Normal file
142
fd-pa-e1-sh/ipc-2002_depots-strips-automatic_17.out
Normal file
@@ -0,0 +1,142 @@
|
||||
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-17.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-17.pddl
|
||||
Parsing...
|
||||
Parsing: [0.020s CPU, 0.020s 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.022s wall-clock]
|
||||
Preparing model... [0.020s CPU, 0.018s wall-clock]
|
||||
Generated 43 rules.
|
||||
Computing model... [0.410s CPU, 0.407s wall-clock]
|
||||
3667 relevant atoms
|
||||
1884 auxiliary atoms
|
||||
5551 final queue length
|
||||
12993 total queue pushes
|
||||
Completing instantiation... [1.100s CPU, 1.097s wall-clock]
|
||||
Instantiating: [1.560s CPU, 1.559s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
16 initial candidates
|
||||
Finding invariants: [0.060s CPU, 0.052s wall-clock]
|
||||
Checking invariant weight... [0.000s CPU, 0.005s wall-clock]
|
||||
Instantiating groups... [0.070s CPU, 0.070s wall-clock]
|
||||
Collecting mutex groups... [0.000s CPU, 0.003s wall-clock]
|
||||
Choosing groups...
|
||||
42 uncovered facts
|
||||
Choosing groups: [0.020s CPU, 0.016s wall-clock]
|
||||
Building translation key... [0.010s CPU, 0.005s wall-clock]
|
||||
Computing fact groups: [0.180s CPU, 0.174s wall-clock]
|
||||
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
|
||||
Building dictionary for full mutex groups... [0.000s CPU, 0.006s wall-clock]
|
||||
Building mutex information...
|
||||
Building mutex information: [0.010s CPU, 0.009s wall-clock]
|
||||
Translating task...
|
||||
Processing axioms...
|
||||
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||
Processing axioms: [0.060s CPU, 0.060s wall-clock]
|
||||
Translating task: [1.310s CPU, 1.318s wall-clock]
|
||||
3930 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
56 propositions removed
|
||||
Detecting unreachable propositions: [0.620s CPU, 0.616s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
50 of 50 variables necessary.
|
||||
36 of 50 mutex groups necessary.
|
||||
2938 of 2938 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.280s CPU, 0.285s wall-clock]
|
||||
Translator variables: 50
|
||||
Translator derived variables: 0
|
||||
Translator facts: 408
|
||||
Translator goal facts: 7
|
||||
Translator mutex groups: 36
|
||||
Translator total mutex groups size: 556
|
||||
Translator operators: 2938
|
||||
Translator axioms: 0
|
||||
Translator task size: 26125
|
||||
Translator peak memory: 49496 KB
|
||||
Writing output... [0.400s CPU, 0.433s wall-clock]
|
||||
Done! [4.440s CPU, 4.476s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
||||
Time: 0.90s
|
||||
Memory: 109MB
|
||||
|
||||
Iteration 1
|
||||
Queue: [0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75]
|
||||
Grounded Until: 0
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 109MB (+0MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.00s
|
||||
|
||||
Iteration 2
|
||||
Queue: [5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80]
|
||||
Grounded Until: 0
|
||||
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||||
Grounding Time: 0.50s
|
||||
Memory: 111MB (+2MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.03s
|
||||
Memory: 119MB (+8MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.69s
|
||||
|
||||
Iteration 3
|
||||
Queue: [10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85]
|
||||
Grounded Until: 5
|
||||
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||||
Grounding Time: 0.49s
|
||||
Memory: 132MB (+13MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Answer: 1
|
||||
occurs(action(("lift","hoist4","crate3","pallet6","depot0")),1) occurs(action(("lift","hoist3","crate7","crate5","distributor1")),1) occurs(action(("drive","truck1","distributor1","depot1")),1) occurs(action(("drive","truck3","depot0","depot1")),1) occurs(action(("drive","truck2","depot1","depot0")),1) occurs(action(("lift","hoist7","crate1","pallet5","distributor1")),2) occurs(action(("drive","truck0","depot1","distributor0")),2) occurs(action(("lift","hoist2","crate2","pallet4","distributor0")),2) occurs(action(("drive","truck1","depot1","depot0")),2) occurs(action(("load","hoist4","crate3","truck2","depot0")),2) occurs(action(("drive","truck3","depot1","depot0")),2) occurs(action(("lift","hoist1","crate4","pallet1","depot1")),3) occurs(action(("unload","hoist0","crate3","truck2","depot0")),3) occurs(action(("drive","truck1","depot0","depot1")),3) occurs(action(("drop","hoist3","crate7","crate5","distributor1")),3) occurs(action(("load","hoist2","crate2","truck0","distributor0")),3) occurs(action(("drop","hoist7","crate1","pallet5","distributor1")),3) occurs(action(("lift","hoist7","crate7","crate5","distributor1")),4) occurs(action(("drive","truck2","depot0","distributor0")),4) occurs(action(("load","hoist0","crate3","truck3","depot0")),4) occurs(action(("lift","hoist3","crate8","crate6","distributor1")),4) occurs(action(("drop","hoist1","crate4","pallet1","depot1")),4) occurs(action(("drive","truck1","depot1","distributor1")),4) occurs(action(("unload","hoist6","crate3","truck3","depot0")),5) occurs(action(("load","hoist3","crate8","truck1","distributor1")),5) occurs(action(("load","hoist7","crate7","truck1","distributor1")),5) occurs(action(("drive","truck2","distributor0","depot0")),5) occurs(action(("unload","hoist2","crate2","truck0","distributor0")),5) occurs(action(("lift","hoist1","crate4","pallet1","depot1")),6) occurs(action(("lift","hoist7","crate6","pallet7","distributor1")),6) occurs(action(("drive","truck1","distributor1","depot0")),6) occurs(action(("load","hoist6","crate3","truck2","depot0")),6) occurs(action(("drive","truck3","depot0","distributor1")),6) occurs(action(("lift","hoist3","crate5","crate0","distributor1")),6) occurs(action(("drop","hoist2","crate2","pallet4","distributor0")),6) occurs(action(("drive","truck0","distributor0","depot1")),6) occurs(action(("unload","hoist5","crate8","truck1","depot0")),7) occurs(action(("unload","hoist6","crate7","truck1","depot0")),7) occurs(action(("unload","hoist0","crate3","truck2","depot0")),7) occurs(action(("load","hoist7","crate6","truck3","distributor1")),7) occurs(action(("load","hoist1","crate4","truck0","depot1")),7) occurs(action(("lift","hoist2","crate2","pallet4","distributor0")),7) occurs(action(("drop","hoist3","crate5","pallet7","distributor1")),7) occurs(action(("drop","hoist5","crate8","pallet6","depot0")),8) occurs(action(("lift","hoist7","crate1","pallet5","distributor1")),8) occurs(action(("lift","hoist3","crate5","pallet7","distributor1")),8) occurs(action(("drop","hoist6","crate7","pallet0","depot0")),8) occurs(action(("drive","truck3","distributor1","depot1")),8) occurs(action(("drive","truck0","depot1","depot0")),8) occurs(action(("drop","hoist2","crate2","pallet4","distributor0")),8) occurs(action(("drop","hoist0","crate3","crate8","depot0")),9) occurs(action(("drop","hoist7","crate1","pallet7","distributor1")),9) occurs(action(("lift","hoist6","crate7","pallet0","depot0")),9) occurs(action(("unload","hoist1","crate6","truck3","depot1")),9) occurs(action(("unload","hoist4","crate4","truck0","depot0")),9) occurs(action(("drive","truck1","depot0","depot1")),9) occurs(action(("drive","truck2","depot0","distributor0")),9) occurs(action(("lift","hoist2","crate9","pallet2","distributor0")),9) occurs(action(("drop","hoist6","crate7","crate3","depot0")),10) occurs(action(("drop","hoist1","crate6","pallet1","depot1")),10) occurs(action(("drop","hoist4","crate4","pallet0","depot0")),10) occurs(action(("drive","truck3","depot1","distributor0")),10) occurs(action(("drop","hoist3","crate5","crate1","distributor1")),10) occurs(action(("load","hoist2","crate9","truck2","distributor0")),10) occurs(action(("drive","truck0","depot0","depot1")),10)
|
||||
Solving Time: 0.21s
|
||||
Memory: 142MB (+10MB)
|
||||
SAT
|
||||
SATISFIABLE
|
||||
|
||||
Models : 1+
|
||||
Calls : 3
|
||||
Time : 2.575s (Solving: 0.20s 1st Model: 0.19s Unsat: 0.00s)
|
||||
CPU Time : 2.480s
|
||||
|
||||
Choices : 2819
|
||||
Conflicts : 499 (Analyzed: 498)
|
||||
Restarts : 6 (Average: 83.00 Last: 75)
|
||||
Model-Level : 140.0
|
||||
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||||
Lemmas : 498 (Deleted: 0)
|
||||
Binary : 36 (Ratio: 7.23%)
|
||||
Ternary : 25 (Ratio: 5.02%)
|
||||
Conflict : 498 (Average Length: 66.4 Ratio: 100.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 498 (Average: 5.67 Max: 121 Sum: 2822)
|
||||
Executed : 474 (Average: 5.24 Max: 121 Sum: 2611 Ratio: 92.52%)
|
||||
Bounded : 24 (Average: 8.79 Max: 12 Sum: 211 Ratio: 7.48%)
|
||||
|
||||
Rules : 85544
|
||||
Atoms : 85544
|
||||
Bodies : 1 (Original: 0)
|
||||
Tight : Yes
|
||||
Variables : 35259 (Eliminated: 0 Frozen: 29011)
|
||||
Constraints : 317489 (Binary: 97.7% Ternary: 1.1% Other: 1.2%)
|
||||
|
||||
Memory Peak : 142MB
|
||||
Max. Length : 10 steps
|
||||
Sol. Length : 10 steps
|
||||
|
||||
|
Reference in New Issue
Block a user