134 lines
7.5 KiB
Plaintext
134 lines
7.5 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-2.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-2.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.030s CPU, 0.024s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.000s CPU, 0.007s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.030s CPU, 0.029s wall-clock]
|
||
|
|
Preparing model... [0.030s CPU, 0.019s wall-clock]
|
||
|
|
Generated 51 rules.
|
||
|
|
Computing model... [0.200s CPU, 0.202s wall-clock]
|
||
|
|
1448 relevant atoms
|
||
|
|
1112 auxiliary atoms
|
||
|
|
2560 final queue length
|
||
|
|
3389 total queue pushes
|
||
|
|
Completing instantiation... [0.220s CPU, 0.217s wall-clock]
|
||
|
|
Instantiating: [0.480s CPU, 0.478s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
6 initial candidates
|
||
|
|
Finding invariants: [0.010s CPU, 0.012s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating groups... [0.030s CPU, 0.021s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
0 uncovered facts
|
||
|
|
Choosing groups: [0.010s CPU, 0.004s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Computing fact groups: [0.050s CPU, 0.054s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.010s CPU, 0.001s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.010s CPU, 0.010s wall-clock]
|
||
|
|
Translating task: [0.170s CPU, 0.174s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
19 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.100s CPU, 0.096s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
19 of 19 variables necessary.
|
||
|
|
0 of 19 mutex groups necessary.
|
||
|
|
980 of 980 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.020s CPU, 0.024s wall-clock]
|
||
|
|
Translator variables: 19
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 230
|
||
|
|
Translator goal facts: 5
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 980
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 3794
|
||
|
|
Translator peak memory: 35928 KB
|
||
|
|
Writing output... [0.070s CPU, 0.078s wall-clock]
|
||
|
|
Done! [0.940s CPU, 0.942s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.18s
|
||
|
|
Memory: 54MB
|
||
|
|
|
||
|
|
Iteration 1
|
||
|
|
Queue: [5]
|
||
|
|
Grounded Until: 0
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.06s
|
||
|
|
Memory: 56MB (+2MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 59MB (+3MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.09s
|
||
|
|
|
||
|
|
Iteration 2
|
||
|
|
Queue: [7]
|
||
|
|
Grounded Until: 5
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('check', [7])]
|
||
|
|
Grounding Time: 0.03s
|
||
|
|
Memory: 59MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("fly-airplane","plane1","city6-2","city2-2")),1) occurs(action(("fly-airplane","plane2","city3-2","city1-2")),1) occurs(action(("load-truck","package2","truck10","city10-1")),1) occurs(action(("load-airplane","package3","plane4","city3-2")),1) occurs(action(("load-airplane","package4","plane3","city7-2")),1) occurs(action(("load-airplane","package5","plane2","city1-2")),2) occurs(action(("fly-airplane","plane3","city7-2","city6-2")),2) occurs(action(("fly-airplane","plane4","city3-2","city1-2")),2) occurs(action(("load-airplane","package1","plane1","city2-2")),2) occurs(action(("unload-airplane","package3","plane4","city1-2")),3) occurs(action(("drive-truck","truck1","city1-1","city1-2","city1")),3) occurs(action(("unload-airplane","package4","plane3","city6-2")),3) occurs(action(("drive-truck","truck6","city6-1","city6-2","city6")),3) occurs(action(("fly-airplane","plane1","city2-2","city3-2")),3) occurs(action(("fly-airplane","plane2","city1-2","city6-2")),3) occurs(action(("drive-truck","truck10","city10-1","city10-2","city10")),3) occurs(action(("load-truck","package3","truck1","city1-2")),4) occurs(action(("load-truck","package4","truck6","city6-2")),4) occurs(action(("fly-airplane","plane2","city6-2","city4-2")),4) occurs(action(("unload-airplane","package1","plane1","city3-2")),4) occurs(action(("drive-truck","truck3","city3-1","city3-2","city3")),4) occurs(action(("unload-truck","package2","truck10","city10-2")),4) occurs(action(("fly-airplane","plane3","city6-2","city10-2")),4) occurs(action(("unload-airplane","package5","plane2","city4-2")),5) occurs(action(("load-truck","package1","truck3","city3-2")),5) occurs(action(("load-airplane","package2","plane3","city10-2")),5) occurs(action(("fly-airplane","plane1","city3-2","city4-2")),5) occurs(action(("fly-airplane","plane4","city1-2","city8-2")),5) occurs(action(("drive-truck","truck1","city1-2","city1-1","city1")),5) occurs(action(("drive-truck","truck6","city6-2","city6-1","city6")),5) occurs(action(("drive-truck","truck10","city10-2","city10-1","city10")),5) occurs(action(("unload-truck","package3","truck1","city1-1")),6) occurs(action(("fly-airplane","plane3","city10-2","city9-2")),6) occurs(action(("load-airplane","package5","plane1","city4-2")),6) occurs(action(("fly-airplane","plane2","city4-2","city1-2")),6) occurs(action(("drive-truck","truck3","city3-2","city3-1","city3")),6) occurs(action(("unload-truck","package1","truck3","city3-1")),7) occurs(action(("unload-airplane","package2","plane3","city9-2")),7) occurs(action(("unload-truck","package4","truck6","city6-1")),7) occurs(action(("unload-airplane","package5","plane1","city4-2")),7) occurs(action(("drive-truck","truck1","city1-1","city1-2","city1")),7) occurs(action(("drive-truck","truck5","city5-1","city5-2","city5")),7) occurs(action(("drive-truck","truck8","city8-1","city8-2","city8")),7)
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 60MB (+1MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 2
|
||
|
|
Time : 0.323s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.310s
|
||
|
|
|
||
|
|
Choices : 314
|
||
|
|
Conflicts : 39 (Analyzed: 38)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 100.0
|
||
|
|
Problems : 2 (Average Length: 8.00 Splits: 0)
|
||
|
|
Lemmas : 38 (Deleted: 0)
|
||
|
|
Binary : 2 (Ratio: 5.26%)
|
||
|
|
Ternary : 6 (Ratio: 15.79%)
|
||
|
|
Conflict : 38 (Average Length: 13.5 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 38 (Average: 8.00 Max: 31 Sum: 304)
|
||
|
|
Executed : 29 (Average: 5.87 Max: 31 Sum: 223 Ratio: 73.36%)
|
||
|
|
Bounded : 9 (Average: 9.00 Max: 9 Sum: 81 Ratio: 26.64%)
|
||
|
|
|
||
|
|
Rules : 0
|
||
|
|
Atoms : 0
|
||
|
|
Bodies : 0
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 10526 (Eliminated: 0 Frozen: 6265)
|
||
|
|
Constraints : 40891 (Binary: 93.8% Ternary: 4.4% Other: 1.9%)
|
||
|
|
|
||
|
|
Memory Peak : 61MB
|
||
|
|
Max. Length : 7 steps
|
||
|
|
Sol. Length : 7 steps
|
||
|
|
|
||
|
|
|