143 lines
7.1 KiB
Plaintext
143 lines
7.1 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-7.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-7.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.010s CPU, 0.024s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.010s CPU, 0.014s wall-clock]
|
||
|
|
Preparing model... [0.010s CPU, 0.008s wall-clock]
|
||
|
|
Generated 35 rules.
|
||
|
|
Computing model... [0.050s CPU, 0.044s wall-clock]
|
||
|
|
412 relevant atoms
|
||
|
|
273 auxiliary atoms
|
||
|
|
685 final queue length
|
||
|
|
904 total queue pushes
|
||
|
|
Completing instantiation... [0.040s CPU, 0.045s wall-clock]
|
||
|
|
Instantiating: [0.110s CPU, 0.116s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
11 initial candidates
|
||
|
|
Finding invariants: [0.020s CPU, 0.018s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating groups... [0.010s CPU, 0.008s 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.003s wall-clock]
|
||
|
|
Translating task: [0.050s CPU, 0.049s wall-clock]
|
||
|
|
27 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
12 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.020s CPU, 0.027s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
15 of 15 variables necessary.
|
||
|
|
3 of 15 mutex groups necessary.
|
||
|
|
252 of 252 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.010s CPU, 0.009s wall-clock]
|
||
|
|
Translator variables: 15
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 78
|
||
|
|
Translator goal facts: 10
|
||
|
|
Translator mutex groups: 3
|
||
|
|
Translator total mutex groups size: 12
|
||
|
|
Translator operators: 252
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 1168
|
||
|
|
Translator peak memory: 33624 KB
|
||
|
|
Writing output... [0.040s CPU, 0.040s wall-clock]
|
||
|
|
Done! [0.280s CPU, 0.302s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.06s
|
||
|
|
Memory: 48MB
|
||
|
|
|
||
|
|
Iteration 1
|
||
|
|
Queue: [0]
|
||
|
|
Grounded Until: 0
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 48MB (+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.02s
|
||
|
|
Memory: 48MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 49MB (+1MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.03s
|
||
|
|
|
||
|
|
Iteration 3
|
||
|
|
Queue: [10]
|
||
|
|
Grounded Until: 5
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 0.02s
|
||
|
|
Memory: 50MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("load-truck","package4","truck3","s1")),1) occurs(action(("load-truck","package5","truck2","s1")),1) occurs(action(("walk","driver1","s1","p0-1")),1) occurs(action(("walk","driver2","s2","p2-1")),1) occurs(action(("walk","driver3","s2","p2-1")),1) occurs(action(("walk","driver2","p2-1","s1")),2) occurs(action(("walk","driver3","p2-1","s1")),2) occurs(action(("walk","driver1","p0-1","s1")),2) occurs(action(("board-truck","driver2","truck3","s1")),3) occurs(action(("board-truck","driver1","truck1","s1")),3) occurs(action(("board-truck","driver3","truck2","s1")),3) occurs(action(("drive-truck","truck2","s1","s0","driver3")),4) occurs(action(("drive-truck","truck3","s1","s2","driver2")),4) occurs(action(("drive-truck","truck1","s1","s0","driver1")),4) occurs(action(("disembark-truck","driver1","truck1","s0")),5) occurs(action(("disembark-truck","driver3","truck2","s0")),5) occurs(action(("disembark-truck","driver2","truck3","s2")),5) occurs(action(("unload-truck","package4","truck3","s2")),6) occurs(action(("unload-truck","package5","truck2","s0")),6) occurs(action(("load-truck","package2","truck3","s2")),6) occurs(action(("board-truck","driver2","truck3","s2")),6) occurs(action(("board-truck","driver1","truck2","s0")),6) occurs(action(("board-truck","driver3","truck1","s0")),6) occurs(action(("disembark-truck","driver1","truck2","s0")),7) occurs(action(("load-truck","package5","truck2","s0")),7) occurs(action(("drive-truck","truck1","s0","s1","driver3")),7) occurs(action(("drive-truck","truck3","s2","s1","driver2")),7) occurs(action(("unload-truck","package5","truck2","s0")),8) occurs(action(("drive-truck","truck1","s1","s2","driver3")),8) occurs(action(("board-truck","driver1","truck2","s0")),8) occurs(action(("disembark-truck","driver2","truck3","s1")),8) occurs(action(("disembark-truck","driver1","truck2","s0")),9) occurs(action(("load-truck","package5","truck2","s0")),9) occurs(action(("walk","driver2","s1","p0-1")),9) occurs(action(("drive-truck","truck1","s2","s0","driver3")),9) occurs(action(("unload-truck","package2","truck3","s1")),10) occurs(action(("unload-truck","package5","truck2","s0")),10) occurs(action(("walk","driver2","p0-1","s0")),10) occurs(action(("drive-truck","truck1","s0","s1","driver3")),10)
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 50MB (+0MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 0.132s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.130s
|
||
|
|
|
||
|
|
Choices : 214
|
||
|
|
Conflicts : 54 (Analyzed: 53)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 56.0
|
||
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 53 (Deleted: 0)
|
||
|
|
Binary : 4 (Ratio: 7.55%)
|
||
|
|
Ternary : 3 (Ratio: 5.66%)
|
||
|
|
Conflict : 53 (Average Length: 14.0 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 53 (Average: 3.42 Max: 18 Sum: 181)
|
||
|
|
Executed : 48 (Average: 3.21 Max: 18 Sum: 170 Ratio: 93.92%)
|
||
|
|
Bounded : 5 (Average: 2.20 Max: 7 Sum: 11 Ratio: 6.08%)
|
||
|
|
|
||
|
|
Rules : 3983
|
||
|
|
Atoms : 3983
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 3347 (Eliminated: 0 Frozen: 2145)
|
||
|
|
Constraints : 15230 (Binary: 91.4% Ternary: 4.1% Other: 4.5%)
|
||
|
|
|
||
|
|
Memory Peak : 50MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
|
||
|
|
|