130 lines
6.4 KiB
Plaintext
130 lines
6.4 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-5.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-5.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.010s CPU, 0.017s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.020s CPU, 0.018s wall-clock]
|
||
|
|
Preparing model... [0.010s CPU, 0.010s wall-clock]
|
||
|
|
Generated 35 rules.
|
||
|
|
Computing model... [0.040s CPU, 0.044s wall-clock]
|
||
|
|
302 relevant atoms
|
||
|
|
216 auxiliary atoms
|
||
|
|
518 final queue length
|
||
|
|
659 total queue pushes
|
||
|
|
Completing instantiation... [0.040s CPU, 0.035s wall-clock]
|
||
|
|
Instantiating: [0.110s CPU, 0.113s 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.006s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
2 uncovered facts
|
||
|
|
Choosing groups: [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Computing fact groups: [0.030s CPU, 0.030s 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.000s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Translating task: [0.030s CPU, 0.033s wall-clock]
|
||
|
|
18 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
10 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.020s CPU, 0.019s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
12 of 12 variables necessary.
|
||
|
|
2 of 12 mutex groups necessary.
|
||
|
|
168 of 168 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.010s CPU, 0.006s wall-clock]
|
||
|
|
Translator variables: 12
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 59
|
||
|
|
Translator goal facts: 8
|
||
|
|
Translator mutex groups: 2
|
||
|
|
Translator total mutex groups size: 8
|
||
|
|
Translator operators: 168
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 777
|
||
|
|
Translator peak memory: 33368 KB
|
||
|
|
Writing output... [0.010s CPU, 0.017s wall-clock]
|
||
|
|
Done! [0.230s CPU, 0.239s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.07s
|
||
|
|
Memory: 48MB
|
||
|
|
|
||
|
|
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: 48MB (+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.07s
|
||
|
|
Memory: 54MB (+6MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("drive-truck","truck2","s1","s2","driver1")),1) occurs(action(("load-truck","package3","truck2","s2")),1) occurs(action(("load-truck","package4","truck2","s2")),1) occurs(action(("board-truck","driver1","truck2","s1")),1) occurs(action(("walk","driver2","s0","p0-1")),1) occurs(action(("walk","driver3","s0","p0-1")),1) occurs(action(("unload-truck","package4","truck2","s0")),2) occurs(action(("load-truck","package1","truck2","s0")),2) occurs(action(("drive-truck","truck2","s2","s0","driver1")),2) occurs(action(("unload-truck","package3","truck2","s0")),2) occurs(action(("walk","driver2","p0-1","s1")),2) occurs(action(("walk","driver3","p0-1","s1")),2) occurs(action(("load-truck","package2","truck1","s0")),3) occurs(action(("load-truck","package3","truck1","s0")),3) occurs(action(("walk","driver2","s1","p1-2")),3) occurs(action(("drive-truck","truck1","s1","s0","driver3")),3) occurs(action(("board-truck","driver3","truck1","s1")),3) occurs(action(("unload-truck","package1","truck2","s0")),3) occurs(action(("walk","driver2","p1-2","s2")),4) occurs(action(("drive-truck","truck2","s0","s2","driver1")),4) occurs(action(("load-truck","package1","truck1","s0")),4) occurs(action(("drive-truck","truck1","s0","s1","driver3")),4) occurs(action(("unload-truck","package1","truck1","s1")),5) occurs(action(("unload-truck","package2","truck1","s1")),5) occurs(action(("unload-truck","package3","truck1","s1")),5) occurs(action(("drive-truck","truck1","s1","s2","driver3")),5) occurs(action(("disembark-truck","driver1","truck2","s2")),5) occurs(action(("disembark-truck","driver3","truck1","s2")),5)
|
||
|
|
Solving Time: 0.03s
|
||
|
|
Memory: 55MB (+1MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 2
|
||
|
|
Time : 0.179s (Solving: 0.02s 1st Model: 0.02s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.180s
|
||
|
|
|
||
|
|
Choices : 1229
|
||
|
|
Conflicts : 371 (Analyzed: 371)
|
||
|
|
Restarts : 4 (Average: 92.75 Last: 39)
|
||
|
|
Model-Level : 34.0
|
||
|
|
Problems : 2 (Average Length: 4.50 Splits: 0)
|
||
|
|
Lemmas : 423 (Deleted: 0)
|
||
|
|
Binary : 84 (Ratio: 19.86%)
|
||
|
|
Ternary : 54 (Ratio: 12.77%)
|
||
|
|
Conflict : 371 (Average Length: 6.2 Ratio: 87.71%)
|
||
|
|
Loop : 52 (Average Length: 9.1 Ratio: 12.29%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 371 (Average: 3.65 Max: 28 Sum: 1354)
|
||
|
|
Executed : 347 (Average: 3.23 Max: 28 Sum: 1198 Ratio: 88.48%)
|
||
|
|
Bounded : 24 (Average: 6.50 Max: 7 Sum: 156 Ratio: 11.52%)
|
||
|
|
|
||
|
|
Rules : 10200
|
||
|
|
Atoms : 10200
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 5134 (Eliminated: 0 Frozen: 4577)
|
||
|
|
Constraints : 11886 (Binary: 83.3% Ternary: 12.5% Other: 4.2%)
|
||
|
|
|
||
|
|
Memory Peak : 56MB
|
||
|
|
Max. Length : 5 steps
|
||
|
|
Sol. Length : 5 steps
|
||
|
|
|
||
|
|
|