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-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.030s CPU, 0.034s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.020s CPU, 0.012s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.020s CPU, 0.020s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.028s wall-clock]
|
||
|
|
Generated 35 rules.
|
||
|
|
Computing model... [0.210s CPU, 0.201s 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.470s CPU, 0.465s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
11 initial candidates
|
||
|
|
Finding invariants: [0.020s CPU, 0.020s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating groups... [0.020s CPU, 0.019s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
3 uncovered facts
|
||
|
|
Choosing groups: [0.010s CPU, 0.003s wall-clock]
|
||
|
|
Building translation key... [0.010s CPU, 0.002s wall-clock]
|
||
|
|
Computing fact groups: [0.060s CPU, 0.056s 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.220s CPU, 0.216s 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.110s CPU, 0.117s 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.080s CPU, 0.089s wall-clock]
|
||
|
|
Done! [1.010s CPU, 1.024s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.18s
|
||
|
|
Memory: 56MB
|
||
|
|
|
||
|
|
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: 56MB (+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.05s
|
||
|
|
Memory: 56MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 58MB (+2MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.08s
|
||
|
|
|
||
|
|
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.06s
|
||
|
|
Memory: 62MB (+4MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("board-truck","driver2","truck2","s9")),1) occurs(action(("drive-truck","truck2","s9","s11","driver2")),2) occurs(action(("walk","driver1","s0","p0-2")),2) occurs(action(("walk","driver1","p0-2","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(("board-truck","driver1","truck3","s2")),4) occurs(action(("drive-truck","truck2","s6","s4","driver2")),4) occurs(action(("load-truck","package1","truck2","s4")),5) occurs(action(("drive-truck","truck2","s4","s5","driver2")),5) occurs(action(("unload-truck","package1","truck2","s5")),6) occurs(action(("load-truck","package3","truck2","s5")),6) occurs(action(("load-truck","package6","truck3","s2")),6) occurs(action(("drive-truck","truck3","s2","s0","driver1")),6) occurs(action(("drive-truck","truck2","s5","s3","driver2")),6) occurs(action(("drive-truck","truck3","s0","s4","driver1")),7) occurs(action(("drive-truck","truck2","s3","s0","driver2")),7) occurs(action(("unload-truck","package2","truck2","s0")),8) occurs(action(("unload-truck","package4","truck2","s0")),8) occurs(action(("drive-truck","truck2","s0","s4","driver2")),8) occurs(action(("unload-truck","package6","truck3","s4")),8) occurs(action(("disembark-truck","driver1","truck3","s4")),8) occurs(action(("unload-truck","package3","truck2","s4")),9) occurs(action(("load-truck","package6","truck2","s4")),9) occurs(action(("walk","driver1","s4","p11-4")),9) occurs(action(("drive-truck","truck2","s4","s5","driver2")),9) occurs(action(("unload-truck","package6","truck2","s5")),10) occurs(action(("walk","driver1","p11-4","s11")),10) occurs(action(("drive-truck","truck2","s5","s8","driver2")),10)
|
||
|
|
Solving Time: 0.03s
|
||
|
|
Memory: 64MB (+2MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 0.398s (Solving: 0.03s 1st Model: 0.03s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.390s
|
||
|
|
|
||
|
|
Choices : 1301
|
||
|
|
Conflicts : 468 (Analyzed: 467)
|
||
|
|
Restarts : 4 (Average: 116.75 Last: 53)
|
||
|
|
Model-Level : 44.0
|
||
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 467 (Deleted: 0)
|
||
|
|
Binary : 44 (Ratio: 9.42%)
|
||
|
|
Ternary : 17 (Ratio: 3.64%)
|
||
|
|
Conflict : 467 (Average Length: 40.0 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 467 (Average: 2.79 Max: 31 Sum: 1305)
|
||
|
|
Executed : 460 (Average: 2.69 Max: 31 Sum: 1254 Ratio: 96.09%)
|
||
|
|
Bounded : 7 (Average: 7.29 Max: 12 Sum: 51 Ratio: 3.91%)
|
||
|
|
|
||
|
|
Rules : 15047
|
||
|
|
Atoms : 15047
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 13434 (Eliminated: 0 Frozen: 1730)
|
||
|
|
Constraints : 40955 (Binary: 93.9% Ternary: 3.8% Other: 2.3%)
|
||
|
|
|
||
|
|
Memory Peak : 64MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
|
||
|
|
|