143 lines
14 KiB
Plaintext
143 lines
14 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-4.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-4.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.030s CPU, 0.032s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.012s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.030s CPU, 0.027s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.031s wall-clock]
|
||
|
|
Generated 51 rules.
|
||
|
|
Computing model... [0.560s CPU, 0.562s wall-clock]
|
||
|
|
4494 relevant atoms
|
||
|
|
3252 auxiliary atoms
|
||
|
|
7746 final queue length
|
||
|
|
10475 total queue pushes
|
||
|
|
Completing instantiation... [0.750s CPU, 0.748s wall-clock]
|
||
|
|
Instantiating: [1.380s CPU, 1.388s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
6 initial candidates
|
||
|
|
Finding invariants: [0.020s CPU, 0.015s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Instantiating groups... [0.080s CPU, 0.077s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
0 uncovered facts
|
||
|
|
Choosing groups: [0.020s CPU, 0.012s wall-clock]
|
||
|
|
Building translation key... [0.010s CPU, 0.008s wall-clock]
|
||
|
|
Computing fact groups: [0.170s CPU, 0.162s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.010s CPU, 0.004s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.030s CPU, 0.031s wall-clock]
|
||
|
|
Translating task: [0.570s CPU, 0.573s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
35 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.320s CPU, 0.316s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
35 of 35 variables necessary.
|
||
|
|
0 of 35 mutex groups necessary.
|
||
|
|
3254 of 3254 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.070s CPU, 0.077s wall-clock]
|
||
|
|
Translator variables: 35
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 717
|
||
|
|
Translator goal facts: 7
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 3254
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 12719
|
||
|
|
Translator peak memory: 42584 KB
|
||
|
|
Writing output... [0.240s CPU, 0.263s wall-clock]
|
||
|
|
Done! [2.820s CPU, 2.852s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.47s
|
||
|
|
Memory: 75MB
|
||
|
|
|
||
|
|
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: 75MB (+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.17s
|
||
|
|
Memory: 76MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 83MB (+7MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.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: 0.17s
|
||
|
|
Memory: 91MB (+8MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("load-truck","package5","truck20","city10-1")),1) occurs(action(("fly-airplane","plane5","city12-4","city1-4")),2) occurs(action(("drive-truck","truck15","city5-2","city5-4","city5")),2) occurs(action(("drive-truck","truck11","city1-1","city1-4","city1")),2) occurs(action(("drive-truck","truck10","city10-3","city10-4","city10")),2) occurs(action(("drive-truck","truck20","city10-1","city10-4","city10")),2) occurs(action(("drive-truck","truck21","city11-3","city11-4","city11")),2) occurs(action(("drive-truck","truck12","city2-1","city2-4","city2")),2) occurs(action(("load-truck","package4","truck1","city5-4")),2) occurs(action(("drive-truck","truck13","city3-3","city3-1","city3")),2) occurs(action(("load-truck","package2","truck21","city11-3")),2) occurs(action(("fly-airplane","plane4","city8-4","city13-4")),3) occurs(action(("fly-airplane","plane2","city13-4","city11-4")),3) occurs(action(("fly-airplane","plane3","city6-4","city10-4")),3) occurs(action(("fly-airplane","plane5","city1-4","city10-4")),3) occurs(action(("drive-truck","truck18","city8-2","city8-1","city8")),3) occurs(action(("drive-truck","truck2","city8-1","city8-2","city8")),3) occurs(action(("drive-truck","truck5","city8-2","city8-1","city8")),3) occurs(action(("load-airplane","package7","plane5","city1-4")),3) occurs(action(("unload-truck","package2","truck21","city11-4")),3) occurs(action(("unload-truck","package5","truck20","city10-4")),3) occurs(action(("drive-truck","truck13","city3-1","city3-3","city3")),3) occurs(action(("drive-truck","truck12","city2-4","city2-1","city2")),3) occurs(action(("drive-truck","truck21","city11-4","city11-3","city11")),3) occurs(action(("drive-truck","truck20","city10-4","city10-1","city10")),3) occurs(action(("drive-truck","truck10","city10-4","city10-3","city10")),3) occurs(action(("drive-truck","truck11","city1-4","city1-1","city1")),3) occurs(action(("drive-truck","truck15","city5-4","city5-2","city5")),3) occurs(action(("drive-truck","truck23","city13-2","city13-4","city13")),4) occurs(action(("drive-truck","truck18","city8-1","city8-4","city8")),4) occurs(action(("fly-airplane","plane2","city11-4","city7-4")),4) occurs(action(("drive-truck","truck2","city8-2","city8-3","city8")),4) occurs(action(("drive-truck","truck9","city8-1","city8-3","city8")),4) occurs(action(("drive-truck","truck7","city9-4","city9-2","city9")),4) occurs(action(("fly-airplane","plane4","city13-4","city8-4")),4) occurs(action(("fly-airplane","plane5","city10-4","city12-4")),4) occurs(action(("unload-truck","package4","truck1","city5-4")),4) occurs(action(("fly-airplane","plane3","city10-4","city6-4")),4) occurs(action(("load-airplane","package2","plane2","city11-4")),4) occurs(action(("drive-truck","truck12","city2-1","city2-4","city2")),4) occurs(action(("drive-truck","truck13","city3-3","city3-4","city3")),4) occurs(action(("drive-truck","truck16","city6-3","city6-4","city6")),4) occurs(action(("load-airplane","package5","plane5","city10-4")),4) occurs(action(("drive-truck","truck1","city5-4","city5-3","city5")),4) occurs(action(("drive-truck","truck15","city5-2","city5-3","city5")),4) occurs(action(("drive-truck","truck11","city1-1","city1-3","city1")),4) occurs(action(("drive-truck","truck10","city10-3","city10-2","city10")),4) occurs(action(("drive-truck","truck20","city10-1","city10-3","city10")),4) occurs(action(("drive-truck","truck21","city11-3","city11-1","city11")),4) occurs(action(("drive-truck","truck8","city2-2","city2-3","city2")),4) occurs(action(("drive-truck","truck14","city4-1","city4-2","city4")),4) occurs(action(("drive-truck","truck17","city7-3","city7-2","city7")),5) occurs(action(("drive-truck","truck3","city7-1","city7-4","city7")),5) occurs(action(("unload-airplane","package2","plane2","city7-4")),5) occurs(action(("drive-truck","truck23","city13-4","city13-3","city13")),5) occurs(action(("fly-airplane","plane4","city8-4","city5-4")),5) occurs(action(("unload-airplane","package5","plane5","city12-4")),5) occurs(action(("unload-airplane","package7","plane5","city12-4")),5) occurs(action(("drive-truck",
|
||
|
|
Solving Time: 0.02s
|
||
|
|
Memory: 100MB (+9MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 1.087s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
|
||
|
|
CPU Time : 1.050s
|
||
|
|
|
||
|
|
Choices : 2170
|
||
|
|
Conflicts : 8 (Analyzed: 8)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 1101.0
|
||
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 8 (Deleted: 0)
|
||
|
|
Binary : 0 (Ratio: 0.00%)
|
||
|
|
Ternary : 0 (Ratio: 0.00%)
|
||
|
|
Conflict : 8 (Average Length: 39.0 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 8 (Average: 135.12 Max: 483 Sum: 1081)
|
||
|
|
Executed : 8 (Average: 135.12 Max: 483 Sum: 1081 Ratio: 100.00%)
|
||
|
|
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
|
||
|
|
|
||
|
|
Rules : 43241
|
||
|
|
Atoms : 43241
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 41343 (Eliminated: 0 Frozen: 5582)
|
||
|
|
Constraints : 129959 (Binary: 93.7% Ternary: 3.5% Other: 2.8%)
|
||
|
|
|
||
|
|
Memory Peak : 100MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
|
||
|
|
|