156 lines
12 KiB
Plaintext
156 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-20.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-20.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.030s CPU, 0.026s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.013s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.020s CPU, 0.024s wall-clock]
|
||
|
|
Preparing model... [0.030s CPU, 0.024s wall-clock]
|
||
|
|
Generated 43 rules.
|
||
|
|
Computing model... [1.000s CPU, 1.000s wall-clock]
|
||
|
|
7130 relevant atoms
|
||
|
|
5437 auxiliary atoms
|
||
|
|
12567 final queue length
|
||
|
|
27375 total queue pushes
|
||
|
|
Completing instantiation... [2.480s CPU, 2.489s wall-clock]
|
||
|
|
Instantiating: [3.560s CPU, 3.562s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
16 initial candidates
|
||
|
|
Finding invariants: [0.070s CPU, 0.062s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.007s wall-clock]
|
||
|
|
Instantiating groups... [0.140s CPU, 0.140s wall-clock]
|
||
|
|
Collecting mutex groups... [0.010s CPU, 0.006s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
51 uncovered facts
|
||
|
|
Choosing groups: [0.030s CPU, 0.032s wall-clock]
|
||
|
|
Building translation key... [0.010s CPU, 0.010s wall-clock]
|
||
|
|
Computing fact groups: [0.310s CPU, 0.304s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.110s CPU, 0.106s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.020s CPU, 0.018s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.130s CPU, 0.134s wall-clock]
|
||
|
|
Translating task: [2.980s CPU, 2.980s wall-clock]
|
||
|
|
8070 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
70 propositions removed
|
||
|
|
Detecting unreachable propositions: [1.390s CPU, 1.389s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
67 of 67 variables necessary.
|
||
|
|
48 of 67 mutex groups necessary.
|
||
|
|
5894 of 5894 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.650s CPU, 0.655s wall-clock]
|
||
|
|
Translator variables: 67
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 773
|
||
|
|
Translator goal facts: 14
|
||
|
|
Translator mutex groups: 48
|
||
|
|
Translator total mutex groups size: 993
|
||
|
|
Translator operators: 5894
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 52919
|
||
|
|
Translator peak memory: 69068 KB
|
||
|
|
Writing output... [0.890s CPU, 0.953s wall-clock]
|
||
|
|
Done! [10.060s CPU, 10.112s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 2.12s
|
||
|
|
Memory: 187MB
|
||
|
|
|
||
|
|
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.01s
|
||
|
|
Memory: 188MB (+1MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.01s
|
||
|
|
|
||
|
|
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.78s
|
||
|
|
Memory: 188MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.05s
|
||
|
|
Memory: 194MB (+6MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 1.15s
|
||
|
|
|
||
|
|
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.73s
|
||
|
|
Memory: 210MB (+16MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.04s
|
||
|
|
Memory: 229MB (+19MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 1.07s
|
||
|
|
|
||
|
|
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.94s
|
||
|
|
Memory: 261MB (+32MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("lift","hoist5","crate9","crate1","distributor1")),1) occurs(action(("lift","hoist3","crate5","crate2","depot3")),1) occurs(action(("lift","hoist7","crate10","crate0","distributor3")),1) occurs(action(("lift","hoist1","crate14","crate12","depot1")),1) occurs(action(("lift","hoist0","crate13","crate4","depot0")),1) occurs(action(("drive","truck1","depot0","depot1")),1) occurs(action(("drive","truck3","distributor1","distributor2")),1) occurs(action(("drive","truck2","depot1","distributor3")),1) occurs(action(("drive","truck0","distributor2","depot3")),1) occurs(action(("lift","hoist6","crate8","crate7","distributor2")),1) occurs(action(("load","hoist6","crate8","truck3","distributor2")),2) occurs(action(("load","hoist3","crate5","truck0","depot3")),2) occurs(action(("load","hoist1","crate14","truck1","depot1")),2) occurs(action(("load","hoist7","crate10","truck2","distributor3")),2) occurs(action(("lift","hoist7","crate0","pallet7","distributor3")),3) occurs(action(("lift","hoist6","crate7","pallet6","distributor2")),3) occurs(action(("lift","hoist3","crate2","pallet3","depot3")),3) occurs(action(("lift","hoist1","crate12","crate6","depot1")),3) occurs(action(("load","hoist6","crate7","truck3","distributor2")),4) occurs(action(("load","hoist3","crate2","truck0","depot3")),4) occurs(action(("load","hoist7","crate0","truck2","distributor3")),4) occurs(action(("drive","truck2","distributor3","depot3")),4) occurs(action(("load","hoist1","crate12","truck1","depot1")),4) occurs(action(("drive","truck0","depot3","distributor2")),4) occurs(action(("drive","truck3","distributor2","distributor1")),4) occurs(action(("unload","hoist6","crate2","truck0","distributor2")),5) occurs(action(("lift","hoist1","crate6","pallet1","depot1")),5) occurs(action(("unload","hoist3","crate0","truck2","depot3")),5) occurs(action(("load","hoist5","crate9","truck3","distributor1")),5) occurs(action(("drive","truck0","distributor2","depot1")),5) occurs(action(("drive","truck3","distributor1","distributor3")),5) occurs(action(("drive","truck2","depot3","depot1")),5) occurs(action(("drop","hoist6","crate2","pallet6","distributor2")),6) occurs(action(("drop","hoist3","crate0","pallet3","depot3")),6) occurs(action(("unload","hoist7","crate8","truck3","distributor3")),6) occurs(action(("lift","hoist5","crate1","pallet5","distributor1")),6) occurs(action(("load","hoist1","crate6","truck2","depot1")),6) occurs(action(("drive","truck2","depot1","distributor0")),6) occurs(action(("drive","truck3","distributor3","distributor1")),6) occurs(action(("drop","hoist7","crate8","pallet7","distributor3")),7) occurs(action(("unload","hoist4","crate6","truck2","distributor0")),7) occurs(action(("unload","hoist1","crate14","truck1","depot1")),7) occurs(action(("drive","truck2","distributor0","depot0")),7) occurs(action(("drive","truck3","distributor1","depot0")),7) occurs(action(("load","hoist5","crate1","truck3","distributor1")),7) occurs(action(("drop","hoist4","crate6","pallet4","distributor0")),8) occurs(action(("drop","hoist1","crate14","pallet1","depot1")),8) occurs(action(("load","hoist0","crate13","truck3","depot0")),8) occurs(action(("drive","truck3","depot0","distributor2")),8) occurs(action(("lift","hoist0","crate4","crate3","depot0")),9) occurs(action(("unload","hoist6","crate13","truck3","distributor2")),9) occurs(action(("lift","hoist1","crate11","pallet8","depot1")),9) occurs(action(("drive","truck3","distributor2","depot2")),9) occurs(action(("drop","hoist6","crate13","crate2","distributor2")),10) occurs(action(("unload","hoist2","crate7","truck3","depot2")),10) occurs(action(("load","hoist0","crate4","truck2","depot0")),10) occurs(action(("load","hoist1","crate11","truck1","depot1")),10) occurs(action(("drive","truck1","depot1","distributor1")),10) occurs(action(("drive","truck2","depot0","distributor3")),10) occurs(action(("drive","truck3","depot2","distributor1")),10) occurs(action(("drop","hoist2","crate7","pallet2","depot2")),11) occurs(action(("unload","hoist1","crate5","truck0","depot1")),11) occurs(action(("unload","hoist7","crate4","
|
||
|
|
Solving Time: 0.23s
|
||
|
|
Memory: 287MB (+26MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 4
|
||
|
|
Time : 5.989s (Solving: 0.19s 1st Model: 0.18s Unsat: 0.01s)
|
||
|
|
CPU Time : 5.844s
|
||
|
|
|
||
|
|
Choices : 3349 (Domain: 3320)
|
||
|
|
Conflicts : 332 (Analyzed: 331)
|
||
|
|
Restarts : 2 (Average: 165.50 Last: 19)
|
||
|
|
Model-Level : 715.0
|
||
|
|
Problems : 4 (Average Length: 9.50 Splits: 0)
|
||
|
|
Lemmas : 331 (Deleted: 0)
|
||
|
|
Binary : 2 (Ratio: 0.60%)
|
||
|
|
Ternary : 3 (Ratio: 0.91%)
|
||
|
|
Conflict : 331 (Average Length: 1600.3 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 331 (Average: 7.70 Max: 306 Sum: 2549)
|
||
|
|
Executed : 319 (Average: 7.24 Max: 306 Sum: 2397 Ratio: 94.04%)
|
||
|
|
Bounded : 12 (Average: 12.67 Max: 17 Sum: 152 Ratio: 5.96%)
|
||
|
|
|
||
|
|
Rules : 156440
|
||
|
|
Atoms : 156440
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 103289 (Eliminated: 0 Frozen: 10813)
|
||
|
|
Constraints : 888673 (Binary: 98.0% Ternary: 1.0% Other: 1.0%)
|
||
|
|
|
||
|
|
Memory Peak : 287MB
|
||
|
|
Max. Length : 15 steps
|
||
|
|
Sol. Length : 15 steps
|
||
|
|
|
||
|
|
|