143 lines
16 KiB
Plaintext
143 lines
16 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/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-1998/domains/logistics-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/instances/instance-17.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.030s CPU, 0.028s 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.027s wall-clock]
|
||
|
|
Preparing model... [0.030s CPU, 0.025s wall-clock]
|
||
|
|
Generated 51 rules.
|
||
|
|
Computing model... [0.630s CPU, 0.627s wall-clock]
|
||
|
|
6480 relevant atoms
|
||
|
|
3325 auxiliary atoms
|
||
|
|
9805 final queue length
|
||
|
|
13920 total queue pushes
|
||
|
|
Completing instantiation... [1.140s CPU, 1.135s wall-clock]
|
||
|
|
Instantiating: [1.830s CPU, 1.832s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
6 initial candidates
|
||
|
|
Finding invariants: [0.020s CPU, 0.019s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Instantiating groups... [0.120s CPU, 0.118s wall-clock]
|
||
|
|
Collecting mutex groups... [0.010s CPU, 0.006s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
0 uncovered facts
|
||
|
|
Choosing groups: [0.020s CPU, 0.018s wall-clock]
|
||
|
|
Building translation key... [0.010s CPU, 0.012s wall-clock]
|
||
|
|
Computing fact groups: [0.240s CPU, 0.242s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.010s CPU, 0.005s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.007s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.010s CPU, 0.006s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.050s CPU, 0.049s wall-clock]
|
||
|
|
Translating task: [0.970s CPU, 0.967s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
65 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.490s CPU, 0.496s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
58 of 65 variables necessary.
|
||
|
|
0 of 65 mutex groups necessary.
|
||
|
|
2810 of 4980 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.110s CPU, 0.104s wall-clock]
|
||
|
|
Translator variables: 58
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 651
|
||
|
|
Translator goal facts: 8
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 2810
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 11627
|
||
|
|
Translator peak memory: 47960 KB
|
||
|
|
Writing output... [0.210s CPU, 0.233s wall-clock]
|
||
|
|
Done! [3.930s CPU, 3.960s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.41s
|
||
|
|
Memory: 72MB
|
||
|
|
|
||
|
|
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: 72MB (+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.15s
|
||
|
|
Memory: 72MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 79MB (+7MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.22s
|
||
|
|
|
||
|
|
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.17s
|
||
|
|
Memory: 86MB (+7MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("load-airplane","package11","plane2","city3-3")),1) occurs(action(("load-truck","package13","truck22","city1-1")),1) occurs(action(("drive-truck","truck10","city1-2","city1-1","city1")),1) occurs(action(("drive-truck","truck11","city1-1","city1-2","city1")),1) occurs(action(("drive-truck","truck18","city1-2","city1-1","city1")),1) occurs(action(("drive-truck","truck2","city1-3","city1-2","city1")),1) occurs(action(("drive-truck","truck42","city1-1","city1-2","city1")),1) occurs(action(("drive-truck","truck7","city1-2","city1-1","city1")),1) occurs(action(("drive-truck","truck8","city1-1","city1-2","city1")),1) occurs(action(("drive-truck","truck9","city1-2","city1-1","city1")),1) occurs(action(("drive-truck","truck15","city3-2","city3-1","city3")),1) occurs(action(("drive-truck","truck21","city3-2","city3-1","city3")),1) occurs(action(("drive-truck","truck26","city3-2","city3-1","city3")),1) occurs(action(("drive-truck","truck31","city3-1","city3-2","city3")),1) occurs(action(("drive-truck","truck36","city3-2","city3-1","city3")),1) occurs(action(("drive-truck","truck40","city3-2","city3-1","city3")),1) occurs(action(("drive-truck","truck44","city3-2","city3-1","city3")),1) occurs(action(("drive-truck","truck5","city3-1","city3-2","city3")),1) occurs(action(("load-truck","package12","truck22","city1-1")),1) occurs(action(("load-truck","package14","truck16","city3-1")),1) occurs(action(("load-truck","package9","truck30","city3-2")),1) occurs(action(("fly-airplane","plane2","city3-3","city4-3")),2) occurs(action(("fly-airplane","plane1","city4-3","city3-3")),2) occurs(action(("fly-airplane","plane3","city4-3","city2-3")),2) occurs(action(("fly-airplane","plane4","city4-3","city3-3")),2) occurs(action(("drive-truck","truck22","city1-1","city1-3","city1")),2) occurs(action(("drive-truck","truck16","city3-1","city3-3","city3")),2) occurs(action(("drive-truck","truck30","city3-2","city3-3","city3")),2) occurs(action(("drive-truck","truck41","city1-3","city1-1","city1")),2) occurs(action(("drive-truck","truck19","city3-3","city3-1","city3")),2) occurs(action(("drive-truck","truck33","city3-3","city3-1","city3")),2) occurs(action(("drive-truck","truck34","city3-3","city3-2","city3")),2) occurs(action(("drive-truck","truck5","city3-2","city3-1","city3")),2) occurs(action(("drive-truck","truck44","city3-1","city3-2","city3")),2) occurs(action(("drive-truck","truck40","city3-1","city3-2","city3")),2) occurs(action(("drive-truck","truck36","city3-1","city3-2","city3")),2) occurs(action(("drive-truck","truck31","city3-2","city3-1","city3")),2) occurs(action(("drive-truck","truck26","city3-1","city3-2","city3")),2) occurs(action(("drive-truck","truck21","city3-1","city3-2","city3")),2) occurs(action(("drive-truck","truck15","city3-1","city3-2","city3")),2) occurs(action(("drive-truck","truck9","city1-1","city1-2","city1")),2) occurs(action(("drive-truck","truck8","city1-2","city1-1","city1")),2) occurs(action(("drive-truck","truck7","city1-1","city1-2","city1")),2) occurs(action(("drive-truck","truck42","city1-2","city1-1","city1")),2) occurs(action(("drive-truck","truck18","city1-1","city1-2","city1")),2) occurs(action(("drive-truck","truck11","city1-2","city1-1","city1")),2) occurs(action(("drive-truck","truck10","city1-1","city1-2","city1")),2) occurs(action(("load-truck","package15","truck2","city1-2")),2) occurs(action(("fly-airplane","plane1","city3-3","city2-3")),3) occurs(action(("fly-airplane","plane2","city4-3","city2-3")),3) occurs(action(("fly-airplane","plane3","city2-3","city3-3")),3) occurs(action(("fly-airplane","plane5","city1-3","city3-3")),3) occurs(action(("drive-truck","truck10","city1-2","city1-3","city1")),3) occurs(action(("drive-truck","truck11","city1-1","city1-3","city1")),3) occurs(action(("drive-truck","truck18","city1-2","city1-3","city1")),3) occurs(action(("unload-truck","package12","truck22","city1-3")),3) occurs(action(("drive-truck","truck44","city3-2","city3-1","city3")),3) occurs(action(("unload-truck","package14","truck16","city3-3")),3) occurs(action(("unload-truck","package9","tr
|
||
|
|
Solving Time: 0.09s
|
||
|
|
Memory: 93MB (+7MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 1.005s (Solving: 0.08s 1st Model: 0.08s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.990s
|
||
|
|
|
||
|
|
Choices : 11797
|
||
|
|
Conflicts : 275 (Analyzed: 275)
|
||
|
|
Restarts : 4 (Average: 68.75 Last: 18)
|
||
|
|
Model-Level : 932.0
|
||
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 275 (Deleted: 0)
|
||
|
|
Binary : 35 (Ratio: 12.73%)
|
||
|
|
Ternary : 6 (Ratio: 2.18%)
|
||
|
|
Conflict : 275 (Average Length: 7.9 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 275 (Average: 43.53 Max: 696 Sum: 11970)
|
||
|
|
Executed : 183 (Average: 39.55 Max: 684 Sum: 10877 Ratio: 90.87%)
|
||
|
|
Bounded : 92 (Average: 11.88 Max: 12 Sum: 1093 Ratio: 9.13%)
|
||
|
|
|
||
|
|
Rules : 40097
|
||
|
|
Atoms : 40097
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 37223 (Eliminated: 0 Frozen: 20449)
|
||
|
|
Constraints : 147119 (Binary: 89.7% Ternary: 7.9% Other: 2.4%)
|
||
|
|
|
||
|
|
Memory Peak : 93MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
|
||
|
|
|