160 lines
7.6 KiB
Plaintext
160 lines
7.6 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-13.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-13.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.010s CPU, 0.022s wall-clock]
|
||
|
|
Normalizing task... [0.010s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.010s CPU, 0.015s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.020s wall-clock]
|
||
|
|
Generated 35 rules.
|
||
|
|
Computing model... [0.180s CPU, 0.182s wall-clock]
|
||
|
|
1675 relevant atoms
|
||
|
|
1119 auxiliary atoms
|
||
|
|
2794 final queue length
|
||
|
|
3819 total queue pushes
|
||
|
|
Completing instantiation... [0.200s CPU, 0.200s wall-clock]
|
||
|
|
Instantiating: [0.420s CPU, 0.427s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
11 initial candidates
|
||
|
|
Finding invariants: [0.020s CPU, 0.021s wall-clock]
|
||
|
|
Checking invariant weight... [0.010s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating groups... [0.020s CPU, 0.020s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
3 uncovered facts
|
||
|
|
Choosing groups: [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Computing fact groups: [0.060s CPU, 0.059s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.010s 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.210s CPU, 0.214s wall-clock]
|
||
|
|
72 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
11 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.120s CPU, 0.119s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
13 of 14 variables necessary.
|
||
|
|
3 of 14 mutex groups necessary.
|
||
|
|
1076 of 1148 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.030s CPU, 0.030s wall-clock]
|
||
|
|
Translator variables: 13
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 197
|
||
|
|
Translator goal facts: 8
|
||
|
|
Translator mutex groups: 3
|
||
|
|
Translator total mutex groups size: 9
|
||
|
|
Translator operators: 1076
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 4547
|
||
|
|
Translator peak memory: 36440 KB
|
||
|
|
Writing output... [0.090s CPU, 0.092s wall-clock]
|
||
|
|
Done! [0.970s CPU, 0.978s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.19s
|
||
|
|
Memory: 56MB
|
||
|
|
|
||
|
|
Iteration 1
|
||
|
|
Queue: [5]
|
||
|
|
Grounded Until: 0
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.07s
|
||
|
|
Memory: 58MB (+2MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 61MB (+3MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.10s
|
||
|
|
|
||
|
|
Iteration 2
|
||
|
|
Queue: [7]
|
||
|
|
Grounded Until: 5
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('check', [7])]
|
||
|
|
Grounding Time: 0.03s
|
||
|
|
Memory: 61MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 62MB (+1MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.05s
|
||
|
|
|
||
|
|
Iteration 3
|
||
|
|
Queue: [9]
|
||
|
|
Grounded Until: 7
|
||
|
|
Grounding... [('step', [8]), ('step', [9]), ('check', [9])]
|
||
|
|
Grounding Time: 0.04s
|
||
|
|
Memory: 64MB (+2MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 65MB (+1MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.06s
|
||
|
|
|
||
|
|
Iteration 4
|
||
|
|
Queue: [14]
|
||
|
|
Grounded Until: 9
|
||
|
|
Grounding... [('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('check', [14])]
|
||
|
|
Grounding Time: 0.07s
|
||
|
|
Memory: 68MB (+3MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("load-truck","package6","truck3","s2")),1) occurs(action(("board-truck","driver2","truck2","s9")),1) occurs(action(("walk","driver1","s0","p0-2")),1) occurs(action(("drive-truck","truck2","s9","s11","driver2")),2) occurs(action(("walk","driver1","p0-2","s2")),2) occurs(action(("board-truck","driver1","truck3","s2")),3) occurs(action(("drive-truck","truck2","s11","s6","driver2")),3) occurs(action(("load-truck","package2","truck2","s6")),4) occurs(action(("load-truck","package4","truck2","s6")),4) occurs(action(("drive-truck","truck3","s2","s5","driver1")),4) occurs(action(("load-truck","package3","truck3","s5")),5) occurs(action(("drive-truck","truck2","s6","s10","driver2")),5) occurs(action(("drive-truck","truck2","s10","s0","driver2")),6) occurs(action(("drive-truck","truck3","s5","s2","driver1")),6) occurs(action(("unload-truck","package2","truck2","s0")),7) occurs(action(("unload-truck","package4","truck2","s0")),7) occurs(action(("drive-truck","truck3","s2","s0","driver1")),7) occurs(action(("load-truck","package2","truck3","s0")),8) occurs(action(("unload-truck","package3","truck3","s0")),8) occurs(action(("unload-truck","package6","truck3","s0")),8) occurs(action(("disembark-truck","driver2","truck2","s0")),8) occurs(action(("disembark-truck","driver1","truck3","s0")),8) occurs(action(("unload-truck","package2","truck3","s0")),9) occurs(action(("load-truck","package3","truck3","s0")),9) occurs(action(("load-truck","package6","truck3","s0")),9) occurs(action(("board-truck","driver2","truck3","s0")),9) occurs(action(("board-truck","driver1","truck2","s0")),9) occurs(action(("drive-truck","truck3","s0","s4","driver2")),10) occurs(action(("drive-truck","truck2","s0","s7","driver1")),10) occurs(action(("unload-truck","package3","truck3","s4")),11) occurs(action(("drive-truck","truck2","s7","s8","driver1")),11) occurs(action(("load-truck","package1","truck3","s4")),11) occurs(action(("drive-truck","truck3","s4","s5","driver2")),12) occurs(action(("disembark-truck","driver1","truck2","s8")),12) occurs(action(("unload-truck","package1","truck3","s5")),13) occurs(action(("unload-truck","package6","truck3","s5")),13) occurs(action(("walk","driver1","s8","p8-11")),13) occurs(action(("walk","driver1","p8-11","s11")),14) occurs(action(("drive-truck","truck3","s5","s4","driver2")),14)
|
||
|
|
Solving Time: 0.31s
|
||
|
|
Memory: 71MB (+3MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 4
|
||
|
|
Time : 0.846s (Solving: 0.31s 1st Model: 0.31s Unsat: 0.01s)
|
||
|
|
CPU Time : 0.820s
|
||
|
|
|
||
|
|
Choices : 4088
|
||
|
|
Conflicts : 1925 (Analyzed: 1922)
|
||
|
|
Restarts : 22 (Average: 87.36 Last: 40)
|
||
|
|
Model-Level : 34.0
|
||
|
|
Problems : 4 (Average Length: 10.75 Splits: 0)
|
||
|
|
Lemmas : 1922 (Deleted: 0)
|
||
|
|
Binary : 88 (Ratio: 4.58%)
|
||
|
|
Ternary : 51 (Ratio: 2.65%)
|
||
|
|
Conflict : 1922 (Average Length: 53.3 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 1922 (Average: 2.43 Max: 52 Sum: 4669)
|
||
|
|
Executed : 1869 (Average: 2.09 Max: 52 Sum: 4013 Ratio: 85.95%)
|
||
|
|
Bounded : 53 (Average: 12.38 Max: 16 Sum: 656 Ratio: 14.05%)
|
||
|
|
|
||
|
|
Rules : 0
|
||
|
|
Atoms : 0
|
||
|
|
Bodies : 0
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 21160 (Eliminated: 0 Frozen: 15617)
|
||
|
|
Constraints : 92093 (Binary: 94.8% Ternary: 3.1% Other: 2.1%)
|
||
|
|
|
||
|
|
Memory Peak : 72MB
|
||
|
|
Max. Length : 14 steps
|
||
|
|
Sol. Length : 14 steps
|
||
|
|
|
||
|
|
|