171 lines
6.7 KiB
Plaintext
171 lines
6.7 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.020s CPU, 0.020s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.006s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.020s CPU, 0.021s wall-clock]
|
||
|
|
Preparing model... [0.010s CPU, 0.013s wall-clock]
|
||
|
|
Generated 35 rules.
|
||
|
|
Computing model... [0.070s CPU, 0.067s wall-clock]
|
||
|
|
412 relevant atoms
|
||
|
|
273 auxiliary atoms
|
||
|
|
685 final queue length
|
||
|
|
904 total queue pushes
|
||
|
|
Completing instantiation... [0.060s CPU, 0.058s wall-clock]
|
||
|
|
Instantiating: [0.170s CPU, 0.167s 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.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.030s CPU, 0.036s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.010s 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.056s 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.030s CPU, 0.030s 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.010s 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: 36812 KB
|
||
|
|
Writing output... [0.020s CPU, 0.026s wall-clock]
|
||
|
|
Done! [0.350s CPU, 0.352s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.05s
|
||
|
|
Memory: 51MB
|
||
|
|
|
||
|
|
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: 52MB (+1MB)
|
||
|
|
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.01s
|
||
|
|
Memory: 52MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 52MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.04s
|
||
|
|
Memory: 54MB (+2MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 54MB (+0MB)
|
||
|
|
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.01s
|
||
|
|
Memory: 54MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.40s
|
||
|
|
Memory: 54MB (+0MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 0.42s
|
||
|
|
|
||
|
|
Iteration 4
|
||
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 10
|
||
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||
|
|
Grounding Time: 0.02s
|
||
|
|
Memory: 55MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.06s
|
||
|
|
Memory: 56MB (+1MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 56MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action(("board-truck","driver1","truck2","s1")),1) occurs(action(("load-truck","package4","truck2","s1")),2) occurs(action(("drive-truck","truck2","s1","s2","driver1")),3) occurs(action(("unload-truck","package4","truck2","s2")),4) occurs(action(("walk","driver2","s2","p0-2")),5) occurs(action(("walk","driver2","p0-2","s0")),6) occurs(action(("load-truck","package2","truck2","s2")),7) occurs(action(("drive-truck","truck2","s2","s1","driver1")),8) occurs(action(("unload-truck","package2","truck2","s1")),9) occurs(action(("load-truck","package5","truck2","s1")),10) occurs(action(("drive-truck","truck2","s1","s0","driver1")),11) occurs(action(("unload-truck","package5","truck2","s0")),12) occurs(action(("disembark-truck","driver1","truck2","s0")),13) occurs(action(("walk","driver3","s2","p2-1")),14) occurs(action(("walk","driver3","p2-1","s1")),15)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 5
|
||
|
|
Time : 0.582s (Solving: 0.46s 1st Model: 0.06s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.572s
|
||
|
|
|
||
|
|
Choices : 30777 (Domain: 30774)
|
||
|
|
Conflicts : 10385 (Analyzed: 10384)
|
||
|
|
Restarts : 117 (Average: 88.75 Last: 91)
|
||
|
|
Model-Level : 81.5
|
||
|
|
Problems : 5 (Average Length: 9.00 Splits: 0)
|
||
|
|
Lemmas : 10384 (Deleted: 6242)
|
||
|
|
Binary : 188 (Ratio: 1.81%)
|
||
|
|
Ternary : 120 (Ratio: 1.16%)
|
||
|
|
Conflict : 10384 (Average Length: 49.8 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 10384 (Average: 2.73 Max: 79 Sum: 28365)
|
||
|
|
Executed : 10347 (Average: 2.71 Max: 79 Sum: 28118 Ratio: 99.13%)
|
||
|
|
Bounded : 37 (Average: 6.68 Max: 17 Sum: 247 Ratio: 0.87%)
|
||
|
|
|
||
|
|
Rules : 3775
|
||
|
|
Atoms : 3770
|
||
|
|
Bodies : 11 (Original: 10)
|
||
|
|
Count : 5
|
||
|
|
Equivalences : 15 (Atom=Atom: 5 Body=Body: 0 Other: 10)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 4781 (Eliminated: 0 Frozen: 2928)
|
||
|
|
Constraints : 19082 (Binary: 90.9% Ternary: 5.0% Other: 4.1%)
|
||
|
|
|
||
|
|
Memory Peak : 56MB
|
||
|
|
Max. Length : 15 steps
|
||
|
|
Sol. Length : 15 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|