156 lines
15 KiB
Plaintext
156 lines
15 KiB
Plaintext
|
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-18.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-18.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.020s CPU, 0.020s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.010s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.020s CPU, 0.020s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.020s wall-clock]
|
||
|
|
Generated 43 rules.
|
||
|
|
Computing model... [0.720s CPU, 0.721s wall-clock]
|
||
|
|
6652 relevant atoms
|
||
|
|
3059 auxiliary atoms
|
||
|
|
9711 final queue length
|
||
|
|
24313 total queue pushes
|
||
|
|
Completing instantiation... [2.130s CPU, 2.127s wall-clock]
|
||
|
|
Instantiating: [2.900s CPU, 2.906s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
16 initial candidates
|
||
|
|
Finding invariants: [0.070s CPU, 0.061s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.005s wall-clock]
|
||
|
|
Instantiating groups... [0.100s CPU, 0.103s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
47 uncovered facts
|
||
|
|
Choosing groups: [0.030s CPU, 0.025s wall-clock]
|
||
|
|
Building translation key... [0.010s CPU, 0.008s wall-clock]
|
||
|
|
Computing fact groups: [0.250s CPU, 0.248s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.020s CPU, 0.009s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.010s CPU, 0.017s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.120s CPU, 0.115s wall-clock]
|
||
|
|
Translating task: [2.520s CPU, 2.515s wall-clock]
|
||
|
|
7680 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
66 propositions removed
|
||
|
|
Detecting unreachable propositions: [1.310s CPU, 1.308s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
65 of 65 variables necessary.
|
||
|
|
46 of 65 mutex groups necessary.
|
||
|
|
5568 of 5568 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.560s CPU, 0.563s wall-clock]
|
||
|
|
Translator variables: 65
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 663
|
||
|
|
Translator goal facts: 13
|
||
|
|
Translator mutex groups: 46
|
||
|
|
Translator total mutex groups size: 901
|
||
|
|
Translator operators: 5568
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 50506
|
||
|
|
Translator peak memory: 64088 KB
|
||
|
|
Writing output... [0.770s CPU, 0.836s wall-clock]
|
||
|
|
Done! [8.460s CPU, 8.523s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 40.96s
|
||
|
|
Memory: 1924MB
|
||
|
|
|
||
|
|
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.17s
|
||
|
|
Memory: 1924MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.18s
|
||
|
|
|
||
|
|
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: 4.91s
|
||
|
|
Memory: 2037MB (+113MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.13s
|
||
|
|
Memory: 2153MB (+116MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 6.28s
|
||
|
|
|
||
|
|
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: 5.11s
|
||
|
|
Memory: 2291MB (+138MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.18s
|
||
|
|
Memory: 2373MB (+82MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 6.85s
|
||
|
|
|
||
|
|
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: 5.16s
|
||
|
|
Memory: 2496MB (+123MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("lift","hoist1","crate11","crate1","depot1")),1) occurs(action(("lift","hoist2","crate8","crate6","distributor0")),1) occurs(action(("lift","hoist4","crate14","crate12","distributor0")),1) occurs(action(("drive","truck1","distributor0","depot1")),1) occurs(action(("drive","truck2","depot0","depot1")),1) occurs(action(("drive","truck0","depot1","distributor0")),1) occurs(action(("lift","hoist5","crate13","crate7","depot0")),1) occurs(action(("lift","hoist3","crate10","crate9","distributor1")),1) occurs(action(("drive","truck3","depot1","distributor1")),1) occurs(action(("lift","hoist7","crate9","pallet3","distributor1")),2) occurs(action(("lift","hoist0","crate7","crate4","depot0")),2) occurs(action(("lift","hoist6","crate12","crate2","distributor0")),2) occurs(action(("load","hoist4","crate14","truck0","distributor0")),2) occurs(action(("drop","hoist5","crate13","pallet4","depot0")),2) occurs(action(("load","hoist1","crate11","truck2","depot1")),2) occurs(action(("load","hoist3","crate10","truck3","distributor1")),2) occurs(action(("drive","truck2","depot1","distributor0")),2) occurs(action(("drive","truck0","distributor0","depot1")),2) occurs(action(("drive","truck1","depot1","distributor0")),2) occurs(action(("lift","hoist5","crate4","crate0","depot0")),3) occurs(action(("lift","hoist4","crate6","pallet5","distributor0")),3) occurs(action(("lift","hoist1","crate1","pallet1","depot1")),3) occurs(action(("lift","hoist3","crate3","pallet6","distributor1")),3) occurs(action(("load","hoist2","crate8","truck2","distributor0")),3) occurs(action(("load","hoist6","crate12","truck1","distributor0")),3) occurs(action(("drive","truck2","distributor0","depot1")),3) occurs(action(("drive","truck3","distributor1","depot0")),3) occurs(action(("drive","truck0","depot1","distributor0")),3) occurs(action(("drop","hoist0","crate7","crate13","depot0")),3) occurs(action(("drop","hoist7","crate9","pallet3","distributor1")),3) occurs(action(("drive","truck1","distributor0","distributor1")),3) occurs(action(("lift","hoist7","crate9","pallet3","distributor1")),4) occurs(action(("lift","hoist2","crate2","pallet2","distributor0")),4) occurs(action(("lift","hoist0","crate0","pallet0","depot0")),4) occurs(action(("load","hoist4","crate6","truck0","distributor0")),4) occurs(action(("load","hoist5","crate4","truck3","depot0")),4) occurs(action(("load","hoist1","crate1","truck2","depot1")),4) occurs(action(("drive","truck1","distributor1","depot0")),4) occurs(action(("drive","truck2","depot1","distributor0")),4) occurs(action(("drive","truck0","distributor0","distributor1")),4) occurs(action(("drive","truck3","depot0","distributor1")),4) occurs(action(("load","hoist3","crate3","truck1","distributor1")),4) occurs(action(("unload","hoist6","crate14","truck0","distributor0")),4) occurs(action(("lift","hoist1","crate5","pallet7","depot1")),5) occurs(action(("unload","hoist4","crate1","truck2","distributor0")),5) occurs(action(("load","hoist7","crate9","truck3","distributor1")),5) occurs(action(("unload","hoist3","crate4","truck3","distributor1")),5) occurs(action(("load","hoist2","crate2","truck2","distributor0")),5) occurs(action(("drive","truck0","distributor1","distributor0")),5) occurs(action(("load","hoist0","crate0","truck1","depot0")),5) occurs(action(("drive","truck2","distributor0","distributor1")),5) occurs(action(("unload","hoist5","crate3","truck1","depot0")),5) occurs(action(("drive","truck1","depot0","distributor0")),5) occurs(action(("drive","truck3","distributor1","depot1")),5) occurs(action(("drop","hoist4","crate1","pallet5","distributor0")),6) occurs(action(("unload","hoist7","crate8","truck2","distributor1")),6) occurs(action(("drop","hoist3","crate4","pallet3","distributor1")),6) occurs(action(("unload","hoist2","crate0","truck1","distributor0")),6) occurs(action(("load","hoist1","crate5","truck3","depot1")),6) occurs(action(("drop","hoist6","crate14","pallet2","distributor0")),6) occurs(action(("drop","hoist5","crate3","pallet0","depot0")),6) occurs(action(("drive","truck0","distributor0","distributor1")),6) occurs(ac
|
||
|
|
Solving Time: 0.81s
|
||
|
|
Memory: 2655MB (+159MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 4
|
||
|
|
Time : 61.923s (Solving: 0.73s 1st Model: 0.66s Unsat: 0.06s)
|
||
|
|
CPU Time : 61.830s
|
||
|
|
|
||
|
|
Choices : 21360
|
||
|
|
Conflicts : 1190 (Analyzed: 1188)
|
||
|
|
Restarts : 11 (Average: 108.00 Last: 43)
|
||
|
|
Model-Level : 1591.0
|
||
|
|
Problems : 4 (Average Length: 9.50 Splits: 0)
|
||
|
|
Lemmas : 1188 (Deleted: 0)
|
||
|
|
Binary : 32 (Ratio: 2.69%)
|
||
|
|
Ternary : 38 (Ratio: 3.20%)
|
||
|
|
Conflict : 1188 (Average Length: 269.1 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 1188 (Average: 15.67 Max: 2067 Sum: 18612)
|
||
|
|
Executed : 1172 (Average: 15.50 Max: 2067 Sum: 18413 Ratio: 98.93%)
|
||
|
|
Bounded : 16 (Average: 12.44 Max: 17 Sum: 199 Ratio: 1.07%)
|
||
|
|
|
||
|
|
Rules : 15889473
|
||
|
|
Atoms : 15889473
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 96971 (Eliminated: 0 Frozen: 75819)
|
||
|
|
Constraints : 854343 (Binary: 98.1% Ternary: 1.0% Other: 0.9%)
|
||
|
|
|
||
|
|
Memory Peak : 2726MB
|
||
|
|
Max. Length : 15 steps
|
||
|
|
Sol. Length : 15 steps
|
||
|
|
|
||
|
|
|