143 lines
6.9 KiB
Plaintext
143 lines
6.9 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-12.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/driverlog-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-12.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.030s CPU, 0.038s wall-clock]
|
||
|
|
Normalizing task... [0.010s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.012s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.020s CPU, 0.026s wall-clock]
|
||
|
|
Preparing model... [0.030s CPU, 0.027s wall-clock]
|
||
|
|
Generated 35 rules.
|
||
|
|
Computing model... [0.180s CPU, 0.189s wall-clock]
|
||
|
|
1376 relevant atoms
|
||
|
|
903 auxiliary atoms
|
||
|
|
2279 final queue length
|
||
|
|
3128 total queue pushes
|
||
|
|
Completing instantiation... [0.180s CPU, 0.187s wall-clock]
|
||
|
|
Instantiating: [0.430s CPU, 0.445s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
11 initial candidates
|
||
|
|
Finding invariants: [0.020s CPU, 0.022s wall-clock]
|
||
|
|
Checking invariant weight... [0.010s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating groups... [0.010s CPU, 0.018s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
3 uncovered facts
|
||
|
|
Choosing groups: [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Computing fact groups: [0.060s CPU, 0.055s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.010s CPU, 0.011s wall-clock]
|
||
|
|
Translating task: [0.200s CPU, 0.200s wall-clock]
|
||
|
|
60 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
11 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.110s CPU, 0.109s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
14 of 14 variables necessary.
|
||
|
|
3 of 14 mutex groups necessary.
|
||
|
|
948 of 948 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.030s CPU, 0.029s wall-clock]
|
||
|
|
Translator variables: 14
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 176
|
||
|
|
Translator goal facts: 10
|
||
|
|
Translator mutex groups: 3
|
||
|
|
Translator total mutex groups size: 9
|
||
|
|
Translator operators: 948
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 4037
|
||
|
|
Translator peak memory: 39116 KB
|
||
|
|
Writing output... [0.070s CPU, 0.086s wall-clock]
|
||
|
|
Done! [0.960s CPU, 0.976s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.18s
|
||
|
|
Memory: 59MB
|
||
|
|
|
||
|
|
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: 59MB (+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.04s
|
||
|
|
Memory: 59MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 60MB (+1MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.06s
|
||
|
|
|
||
|
|
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.05s
|
||
|
|
Memory: 62MB (+2MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("load-truck","package4","truck1","s7")),1) occurs(action(("walk","driver2","s3","p3-9")),1) occurs(action(("walk","driver1","s1","p9-1")),1) occurs(action(("walk","driver2","p3-9","s9")),2) occurs(action(("walk","driver1","p9-1","s9")),2) occurs(action(("walk","driver2","s9","p7-9")),3) occurs(action(("board-truck","driver1","truck2","s9")),3) occurs(action(("drive-truck","truck2","s9","s4","driver1")),4) occurs(action(("walk","driver2","p7-9","s7")),4) occurs(action(("load-truck","package2","truck2","s4")),5) occurs(action(("board-truck","driver2","truck1","s7")),5) occurs(action(("drive-truck","truck2","s4","s2","driver1")),5) occurs(action(("unload-truck","package2","truck2","s2")),6) occurs(action(("drive-truck","truck2","s2","s5","driver1")),6) occurs(action(("drive-truck","truck1","s7","s1","driver2")),6) occurs(action(("disembark-truck","driver1","truck2","s2")),6) occurs(action(("unload-truck","package4","truck1","s1")),7) occurs(action(("load-truck","package6","truck1","s1")),7) occurs(action(("board-truck","driver1","truck3","s2")),7) occurs(action(("drive-truck","truck1","s1","s3","driver2")),7) occurs(action(("load-truck","package1","truck1","s3")),8) occurs(action(("drive-truck","truck1","s3","s9","driver2")),8) occurs(action(("drive-truck","truck3","s2","s4","driver1")),8) occurs(action(("disembark-truck","driver2","truck1","s9")),9) occurs(action(("disembark-truck","driver1","truck3","s4")),9) occurs(action(("drive-truck","truck3","s4","s0","driver1")),9) occurs(action(("load-truck","package5","truck3","s4")),9) occurs(action(("drive-truck","truck1","s9","s2","driver2")),9) occurs(action(("unload-truck","package1","truck1","s2")),10) occurs(action(("unload-truck","package5","truck3","s0")),10) occurs(action(("unload-truck","package6","truck1","s2")),10)
|
||
|
|
Solving Time: 0.02s
|
||
|
|
Memory: 64MB (+2MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 0.344s (Solving: 0.02s 1st Model: 0.02s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.336s
|
||
|
|
|
||
|
|
Choices : 777 (Domain: 777)
|
||
|
|
Conflicts : 223 (Analyzed: 223)
|
||
|
|
Restarts : 2 (Average: 111.50 Last: 55)
|
||
|
|
Model-Level : 57.0
|
||
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 223 (Deleted: 0)
|
||
|
|
Binary : 4 (Ratio: 1.79%)
|
||
|
|
Ternary : 2 (Ratio: 0.90%)
|
||
|
|
Conflict : 223 (Average Length: 114.1 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 223 (Average: 3.05 Max: 59 Sum: 680)
|
||
|
|
Executed : 221 (Average: 3.04 Max: 59 Sum: 678 Ratio: 99.71%)
|
||
|
|
Bounded : 2 (Average: 1.00 Max: 1 Sum: 2 Ratio: 0.29%)
|
||
|
|
|
||
|
|
Rules : 13237
|
||
|
|
Atoms : 13237
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 10858 (Eliminated: 0 Frozen: 1414)
|
||
|
|
Constraints : 29627 (Binary: 93.5% Ternary: 4.1% Other: 2.4%)
|
||
|
|
|
||
|
|
Memory Peak : 65MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
|
||
|
|
|