143 lines
6.3 KiB
Plaintext
143 lines
6.3 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-9.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-9.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.020s CPU, 0.020s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.000s CPU, 0.005s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.020s CPU, 0.017s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.013s wall-clock]
|
||
|
|
Generated 35 rules.
|
||
|
|
Computing model... [0.070s CPU, 0.078s wall-clock]
|
||
|
|
596 relevant atoms
|
||
|
|
404 auxiliary atoms
|
||
|
|
1000 final queue length
|
||
|
|
1334 total queue pushes
|
||
|
|
Completing instantiation... [0.070s CPU, 0.070s wall-clock]
|
||
|
|
Instantiating: [0.180s CPU, 0.185s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
11 initial candidates
|
||
|
|
Finding invariants: [0.020s CPU, 0.016s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating groups... [0.010s CPU, 0.009s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
3 uncovered facts
|
||
|
|
Choosing groups: [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Computing fact groups: [0.040s CPU, 0.033s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.000s 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.000s CPU, 0.004s wall-clock]
|
||
|
|
Translating task: [0.070s CPU, 0.075s wall-clock]
|
||
|
|
30 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
11 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.050s CPU, 0.042s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
14 of 14 variables necessary.
|
||
|
|
3 of 14 mutex groups necessary.
|
||
|
|
384 of 384 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.010s CPU, 0.011s wall-clock]
|
||
|
|
Translator variables: 14
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 97
|
||
|
|
Translator goal facts: 10
|
||
|
|
Translator mutex groups: 3
|
||
|
|
Translator total mutex groups size: 9
|
||
|
|
Translator operators: 384
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 1708
|
||
|
|
Translator peak memory: 34136 KB
|
||
|
|
Writing output... [0.030s CPU, 0.036s wall-clock]
|
||
|
|
Done! [0.400s CPU, 0.409s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.09s
|
||
|
|
Memory: 49MB
|
||
|
|
|
||
|
|
Iteration 1
|
||
|
|
Queue: [0]
|
||
|
|
Grounded Until: 0
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 49MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
Iteration 2
|
||
|
|
Queue: [5]
|
||
|
|
Grounded Until: 0
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.03s
|
||
|
|
Memory: 49MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 50MB (+1MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.04s
|
||
|
|
|
||
|
|
Iteration 3
|
||
|
|
Queue: [10]
|
||
|
|
Grounded Until: 5
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 0.03s
|
||
|
|
Memory: 51MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("load-truck","package1","truck1","s2")),1) occurs(action(("load-truck","package3","truck3","s3")),1) occurs(action(("walk","driver1","s4","p4-0")),1) occurs(action(("walk","driver2","s1","p1-3")),1) occurs(action(("walk","driver1","p4-0","s0")),2) occurs(action(("walk","driver2","p1-3","s3")),2) occurs(action(("board-truck","driver2","truck3","s3")),3) occurs(action(("board-truck","driver1","truck2","s0")),3) occurs(action(("drive-truck","truck2","s0","s3","driver1")),4) occurs(action(("drive-truck","truck3","s3","s0","driver2")),4) occurs(action(("disembark-truck","driver1","truck2","s3")),5) occurs(action(("drive-truck","truck3","s0","s1","driver2")),5) occurs(action(("unload-truck","package3","truck3","s1")),6) occurs(action(("load-truck","package2","truck3","s1")),6) occurs(action(("walk","driver1","s3","p3-2")),6) occurs(action(("drive-truck","truck3","s1","s2","driver2")),7) occurs(action(("walk","driver1","p3-2","s2")),7) occurs(action(("unload-truck","package2","truck3","s2")),8) occurs(action(("board-truck","driver1","truck1","s2")),8) occurs(action(("drive-truck","truck1","s2","s3","driver1")),9) occurs(action(("drive-truck","truck3","s2","s4","driver2")),9) occurs(action(("unload-truck","package1","truck1","s3")),10) occurs(action(("disembark-truck","driver2","truck3","s4")),10) occurs(action(("disembark-truck","driver1","truck1","s3")),10)
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 52MB (+1MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 0.186s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.180s
|
||
|
|
|
||
|
|
Choices : 355
|
||
|
|
Conflicts : 114 (Analyzed: 114)
|
||
|
|
Restarts : 1 (Average: 114.00 Last: 48)
|
||
|
|
Model-Level : 30.0
|
||
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 114 (Deleted: 0)
|
||
|
|
Binary : 9 (Ratio: 7.89%)
|
||
|
|
Ternary : 3 (Ratio: 2.63%)
|
||
|
|
Conflict : 114 (Average Length: 12.3 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 114 (Average: 3.71 Max: 33 Sum: 423)
|
||
|
|
Executed : 105 (Average: 2.96 Max: 33 Sum: 337 Ratio: 79.67%)
|
||
|
|
Bounded : 9 (Average: 9.56 Max: 12 Sum: 86 Ratio: 20.33%)
|
||
|
|
|
||
|
|
Rules : 5815
|
||
|
|
Atoms : 5815
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 4377 (Eliminated: 0 Frozen: 3114)
|
||
|
|
Constraints : 16253 (Binary: 92.6% Ternary: 3.7% Other: 3.8%)
|
||
|
|
|
||
|
|
Memory Peak : 52MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
|
||
|
|
|