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-6.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-6.pddl
Parsing...
Parsing: [0.010s CPU, 0.018s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.005s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.021s wall-clock]
Preparing model... [0.010s CPU, 0.012s wall-clock]
Generated 35 rules.
Computing model... [0.060s CPU, 0.055s wall-clock]
362 relevant atoms
247 auxiliary atoms
609 final queue length
806 total queue pushes
Completing instantiation... [0.050s CPU, 0.049s wall-clock]
Instantiating: [0.140s CPU, 0.143s wall-clock]
Computing fact groups...
Finding invariants...
11 initial candidates
Finding invariants: [0.020s CPU, 0.019s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.010s CPU, 0.007s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
3 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.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.010s CPU, 0.003s wall-clock]
Translating task: [0.060s CPU, 0.052s wall-clock]
27 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
11 propositions removed
Detecting unreachable propositions: [0.020s CPU, 0.027s wall-clock]
Reordering and filtering variables...
14 of 14 variables necessary.
3 of 14 mutex groups necessary.
222 of 222 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.009s wall-clock]
Translator variables: 14
Translator derived variables: 0
Translator facts: 69
Translator goal facts: 10
Translator mutex groups: 3
Translator total mutex groups size: 12
Translator operators: 222
Translator axioms: 0
Translator task size: 1050
Translator peak memory: 36812 KB
Writing output... [0.020s CPU, 0.023s wall-clock]
Done! [0.300s CPU, 0.311s wall-clock]
planner.py version 0.0.1
Time: 0.06s
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: 51MB (+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.02s
Memory: 52MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 52MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.04s
Memory: 53MB (+1MB)
Solving...
Solving Time: 0.00s
Memory: 53MB (+0MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 53MB (+0MB)
Answer: 2
occurs(action(("load-truck","package1","truck3","s1")),1) occurs(action(("walk","driver1","s2","p1-2")),1) occurs(action(("board-truck","driver3","truck3","s1")),1) occurs(action(("walk","driver2","s2","p1-2")),1) occurs(action(("walk","driver1","p1-2","s1")),2) occurs(action(("drive-truck","truck3","s1","s2","driver3")),2) occurs(action(("walk","driver2","p1-2","s1")),2) occurs(action(("unload-truck","package1","truck3","s2")),3) occurs(action(("board-truck","driver2","truck2","s1")),3) occurs(action(("disembark-truck","driver3","truck3","s2")),3) occurs(action(("drive-truck","truck2","s1","s0","driver2")),4) occurs(action(("board-truck","driver3","truck3","s2")),4) occurs(action(("disembark-truck","driver2","truck2","s0")),5)
SATISFIABLE
Models : 1+
Calls : 3
Time : 0.095s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.092s
Choices : 155 (Domain: 153)
Conflicts : 19 (Analyzed: 19)
Restarts : 0
Model-Level : 36.5
Problems : 3 (Average Length: 5.33 Splits: 0)
Lemmas : 19 (Deleted: 0)
Binary : 1 (Ratio: 5.26%)
Ternary : 1 (Ratio: 5.26%)
Conflict : 19 (Average Length: 14.3 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 19 (Average: 5.21 Max: 20 Sum: 99)
Executed : 16 (Average: 5.05 Max: 20 Sum: 96 Ratio: 96.97%)
Bounded : 3 (Average: 1.00 Max: 1 Sum: 3 Ratio: 3.03%)
Rules : 4387 (Original: 4310)
Atoms : 3606
Bodies : 817 (Original: 739)
Count : 25 (Original: 33)
Equivalences : 425 (Atom=Atom: 9 Body=Body: 0 Other: 416)
Tight : Yes
Variables : 1256 (Eliminated: 0 Frozen: 455)
Constraints : 4116 (Binary: 88.7% Ternary: 6.9% Other: 4.4%)
Memory Peak : 53MB
Max. Length : 5 steps
Sol. Length : 5 steps
Models : 2