205 lines
12 KiB
Plaintext
205 lines
12 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-9.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-9.pddl
|
|
Parsing...
|
|
Parsing: [0.010s CPU, 0.017s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.020s CPU, 0.019s wall-clock]
|
|
Preparing model... [0.010s CPU, 0.015s wall-clock]
|
|
Generated 43 rules.
|
|
Computing model... [0.350s CPU, 0.344s wall-clock]
|
|
2520 relevant atoms
|
|
1935 auxiliary atoms
|
|
4455 final queue length
|
|
9269 total queue pushes
|
|
Completing instantiation... [0.810s CPU, 0.810s wall-clock]
|
|
Instantiating: [1.200s CPU, 1.199s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
16 initial candidates
|
|
Finding invariants: [0.050s CPU, 0.055s wall-clock]
|
|
Checking invariant weight... [0.010s CPU, 0.005s wall-clock]
|
|
Instantiating groups... [0.070s CPU, 0.075s wall-clock]
|
|
Collecting mutex groups... [0.010s CPU, 0.003s wall-clock]
|
|
Choosing groups...
|
|
33 uncovered facts
|
|
Choosing groups: [0.020s CPU, 0.019s wall-clock]
|
|
Building translation key... [0.010s CPU, 0.006s wall-clock]
|
|
Computing fact groups: [0.200s CPU, 0.196s wall-clock]
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.003s wall-clock]
|
|
Building dictionary for full mutex groups... [0.010s CPU, 0.007s wall-clock]
|
|
Building mutex information...
|
|
Building mutex information: [0.010s CPU, 0.011s wall-clock]
|
|
Translating task...
|
|
Processing axioms...
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
|
Processing axioms: [0.040s CPU, 0.043s wall-clock]
|
|
Translating task: [0.930s CPU, 0.935s wall-clock]
|
|
2610 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
50 propositions removed
|
|
Detecting unreachable propositions: [0.450s CPU, 0.454s wall-clock]
|
|
Reordering and filtering variables...
|
|
56 of 56 variables necessary.
|
|
39 of 56 mutex groups necessary.
|
|
1812 of 1812 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.260s CPU, 0.254s wall-clock]
|
|
Translator variables: 56
|
|
Translator derived variables: 0
|
|
Translator facts: 489
|
|
Translator goal facts: 13
|
|
Translator mutex groups: 39
|
|
Translator total mutex groups size: 564
|
|
Translator operators: 1812
|
|
Translator axioms: 0
|
|
Translator task size: 17538
|
|
Translator peak memory: 43864 KB
|
|
Writing output... [0.320s CPU, 0.333s wall-clock]
|
|
Done! [3.420s CPU, 3.446s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.58s
|
|
Memory: 87MB
|
|
|
|
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: 87MB (+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.23s
|
|
Memory: 87MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 89MB (+2MB)
|
|
UNSAT
|
|
Iteration Time: 0.33s
|
|
|
|
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.28s
|
|
Memory: 102MB (+13MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 107MB (+5MB)
|
|
UNSAT
|
|
Iteration Time: 0.38s
|
|
|
|
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.24s
|
|
Memory: 115MB (+8MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.05s
|
|
Memory: 121MB (+6MB)
|
|
UNSAT
|
|
Iteration Time: 0.40s
|
|
|
|
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.25s
|
|
Memory: 130MB (+9MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 2.51s
|
|
Memory: 136MB (+6MB)
|
|
UNKNOWN
|
|
Iteration Time: 2.87s
|
|
|
|
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.33s
|
|
Memory: 152MB (+16MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 2.63s
|
|
Memory: 163MB (+11MB)
|
|
UNKNOWN
|
|
Iteration Time: 3.09s
|
|
|
|
Iteration 7
|
|
Queue: [(6,30,0,True)]
|
|
Grounded Until: 25
|
|
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
|
|
Grounding Time: 0.25s
|
|
Memory: 169MB (+6MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 3.33s
|
|
Memory: 173MB (+4MB)
|
|
UNKNOWN
|
|
Iteration Time: 3.71s
|
|
|
|
Iteration 8
|
|
Queue: [(4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
|
|
Grounded Until: 30
|
|
Blocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("lift","hoist2","crate13","crate4","distributor1")),1) occurs(action(("drive","truck1","distributor0","distributor1")),1) occurs(action(("lift","hoist1","crate14","crate9","distributor0")),1) occurs(action(("lift","hoist0","crate8","pallet5","depot0")),2) occurs(action(("load","hoist1","crate14","truck0","distributor0")),2) occurs(action(("load","hoist2","crate13","truck1","distributor1")),2) occurs(action(("drive","truck1","distributor1","depot0")),2) occurs(action(("drive","truck0","distributor0","distributor1")),2) occurs(action(("lift","hoist1","crate9","crate7","distributor0")),3) occurs(action(("lift","hoist2","crate4","crate0","distributor1")),3) occurs(action(("load","hoist0","crate8","truck1","depot0")),3) occurs(action(("drive","truck1","depot0","distributor0")),3) occurs(action(("lift","hoist0","crate2","crate1","depot0")),4) occurs(action(("load","hoist1","crate9","truck1","distributor0")),4) occurs(action(("load","hoist2","crate4","truck0","distributor1")),4) occurs(action(("drive","truck0","distributor1","depot0")),4) occurs(action(("drive","truck1","distributor0","distributor1")),4) occurs(action(("lift","hoist1","crate7","crate6","distributor0")),5) occurs(action(("lift","hoist2","crate0","pallet2","distributor1")),5) occurs(action(("load","hoist0","crate2","truck0","depot0")),5) occurs(action(("drive","truck0","depot0","distributor1")),5) occurs(action(("drive","truck1","distributor1","distributor0")),5) occurs(action(("lift","hoist0","crate1","pallet0","depot0")),6) occurs(action(("drive","truck0","distributor1","depot0")),6) occurs(action(("load","hoist2","crate0","truck0","distributor1")),6) occurs(action(("load","hoist1","crate7","truck1","distributor0")),6) occurs(action(("lift","hoist1","crate6","crate3","distributor0")),7) occurs(action(("lift","hoist2","crate10","crate5","distributor1")),7) occurs(action(("drive","truck1","distributor0","depot0")),7) occurs(action(("drive","truck0","depot0","distributor0")),7) occurs(action(("drop","hoist2","crate10","pallet2","distributor1")),8) occurs(action(("load","hoist1","crate6","truck0","distributor0")),8) occurs(action(("load","hoist0","crate1","truck1","depot0")),8) occurs(action(("drive","truck0","distributor0","distributor1")),8) occurs(action(("unload","hoist2","crate2","truck0","distributor1")),9) occurs(action(("lift","hoist1","crate3","pallet1","distributor0")),9) occurs(action(("unload","hoist0","crate1","truck1","depot0")),9) occurs(action(("drive","truck0","distributor1","distributor0")),9) occurs(action(("drop","hoist2","crate2","crate10","distributor1")),10) occurs(action(("load","hoist1","crate3","truck0","distributor0")),10) occurs(action(("load","hoist0","crate1","truck1","depot0")),10) occurs(action(("drive","truck0","distributor0","depot0")),10) occurs(action(("drive","truck1","depot0","distributor0")),10) occurs(action(("unload","hoist0","crate3","truck0","depot0")),11) occurs(action(("lift","hoist2","crate5","pallet3","distributor1")),11) occurs(action(("lift","hoist1","crate12","crate11","distributor0")),11) occurs(action(("drive","truck0","depot0","distributor1")),11) occurs(action(("drop","hoist0","crate3","pallet0","depot0")),12) occurs(action(("load","hoist2","crate5","truck0","distributor1")),12) occurs(action(("load","hoist1","crate12","truck1","distributor0")),12) occurs(action(("drive","truck0","distributor1","depot0")),12) occurs(action(("drive","truck1","distributor0","distributor1")),12) occurs(action(("lift","hoist1","crate11","pallet4","distributor0")),13) occurs(action(("unload","hoist0","crate5","truck0","depot0")),13) occurs(action(("unload","hoist2","crate1","truck1","distributor1")),13) occurs(action(("drive","truck0","depot0","distributor0")),13) occurs(action(("drive","truck1","distributor1","distributor0")),13) occurs(action(("drop","hoist1","crate11","pallet1","distributor0")),14) occurs(action(("drop","hoist2","crate1","crate2","distributor1")),14) occurs(action(("drive","truck1","distributor0","distributor1")),14) occurs(action(("drop","hoist0","crate5","pallet5","depot0")),15) occurs(action(("unload","hoist2","crate9","truck1","distributor1")),15) occurs(action(("unload","hoist1","crate6","truck0","distributor0")),15) occurs(action(("drive","truck1","distributor1","depot0")),15) occurs(action(("drive","truck0","distributor0","distributor1")),15) occurs(action(("drop","hoist2","crate9","crate1","distributor1")),16) occurs(action(("drop","hoist1","crate6","pallet4","distributor0")),16) occurs(action(("unload","hoist0","crate13","truck1","depot0")),16) occurs(action(("drive","truck1","depot0","distributor0")),16) occurs(action(("drop","hoist0","crate13","crate3","depot0")),17) occurs(action(("unload","hoist2","crate14","truck0","distributor1")),17) occurs(action(("unload","hoist1","crate12","truck1","distributor0")),17) occurs(action(("drive","truck0","distributor1","depot0")),17) occurs(action(("drop","hoist2","crate14","pallet3","distributor1")),18) occurs(action(("unload","hoist0","crate0","truck0","depot0")),18) occurs(action(("load","hoist1","crate12","truck1","distributor0")),18) occurs(action(("drive","truck1","distributor0","distributor1")),18) occurs(action(("drive","truck0","depot0","distributor0")),18) occurs(action(("unload","hoist1","crate4","truck0","distributor0")),19) occurs(action(("unload","hoist2","crate12","truck1","distributor1")),19) occurs(action(("drive","truck0","distributor0","distributor1")),19) occurs(action(("drop","hoist1","crate4","crate6","distributor0")),20) occurs(action(("drop","hoist2","crate12","crate14","distributor1")),20) occurs(action(("drop","hoist0","crate0","crate5","depot0")),20) occurs(action(("drive","truck0","distributor1","depot0")),20) occurs(action(("drive","truck1","distributor1","distributor0")),20)
|
|
Solving Time: 1.03s
|
|
Memory: 173MB (+0MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 8
|
|
Time : 12.442s (Solving: 9.47s 1st Model: 1.02s Unsat: 0.04s)
|
|
CPU Time : 12.400s
|
|
|
|
Choices : 70277
|
|
Conflicts : 32038 (Analyzed: 32036)
|
|
Restarts : 336 (Average: 95.35 Last: 91)
|
|
Model-Level : 81.0
|
|
Problems : 8 (Average Length: 18.88 Splits: 0)
|
|
Lemmas : 32036 (Deleted: 20071)
|
|
Binary : 1846 (Ratio: 5.76%)
|
|
Ternary : 1390 (Ratio: 4.34%)
|
|
Conflict : 32036 (Average Length: 165.2 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 32036 (Average: 2.63 Max: 69 Sum: 84369)
|
|
Executed : 31402 (Average: 2.15 Max: 69 Sum: 68946 Ratio: 81.72%)
|
|
Bounded : 634 (Average: 24.33 Max: 32 Sum: 15423 Ratio: 18.28%)
|
|
|
|
Rules : 51804
|
|
Atoms : 51804
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 80010 (Eliminated: 0 Frozen: 13142)
|
|
Constraints : 652453 (Binary: 96.3% Ternary: 1.9% Other: 1.8%)
|
|
|
|
Memory Peak : 180MB
|
|
Max. Length : 30 steps
|
|
Sol. Length : 20 steps
|
|
|
|
|