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-12.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-12.pddl
Parsing...
Parsing: [0.020s CPU, 0.027s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.009s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.019s wall-clock]
Preparing model... [0.020s CPU, 0.023s wall-clock]
Generated 35 rules.
Computing model... [0.170s CPU, 0.176s wall-clock]
1376 relevant atoms
903 auxiliary atoms
2279 final queue length
3128 total queue pushes
Completing instantiation... [0.190s CPU, 0.188s wall-clock]
Instantiating: [0.410s CPU, 0.418s wall-clock]
Computing fact groups...
Finding invariants...
11 initial candidates
Finding invariants: [0.020s CPU, 0.017s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.020s CPU, 0.018s 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.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.050s CPU, 0.050s 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.020s CPU, 0.011s wall-clock]
Translating task: [0.210s CPU, 0.201s wall-clock]
60 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.109s wall-clock]
Reordering and filtering variables...
14 of 14 variables necessary.
3 of 14 mutex groups necessary.
948 of 948 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.020s CPU, 0.028s wall-clock]
Translator variables: 14
Translator derived variables: 0
Translator facts: 176
Translator goal facts: 10
Translator mutex groups: 3
Translator total mutex groups size: 9
Translator operators: 948
Translator axioms: 0
Translator task size: 4037
Translator peak memory: 39116 KB
Writing output... [0.080s CPU, 0.088s wall-clock]
Done! [0.910s CPU, 0.935s wall-clock]
planner.py version 0.0.1

Time:	 0.17s
Memory: 59MB

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:		 59MB (+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.04s
Memory:		 59MB (+0MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 60MB (+1MB)
UNSAT
Iteration Time:	 0.07s

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.04s
Memory:		 63MB (+3MB)
Unblocking actions...
Solving...
Solving Time:	 0.02s
Memory:		 64MB (+1MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.12s
Memory:		 71MB (+7MB)
Solving...
Solving Time:	 0.08s
Memory:		 71MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.12s
Memory:		 72MB (+1MB)
Solving...
Solving Time:	 0.04s
Memory:		 72MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.12s
Memory:		 72MB (+0MB)
Solving...
Solving Time:	 0.07s
Memory:		 72MB (+0MB)
UNSAT
Iteration Time:	 0.64s

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.05s
Memory:		 72MB (+0MB)
Unblocking actions...
Solving...
Solving Time:	 0.05s
Memory:		 73MB (+1MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.12s
Memory:		 78MB (+5MB)
Solving...
Solving Time:	 0.01s
Memory:		 78MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.12s
Memory:		 78MB (+0MB)
Solving...
Solving Time:	 0.06s
Memory:		 78MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.12s
Memory:		 79MB (+1MB)
Solving...
Solving Time:	 0.01s
Memory:		 79MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.12s
Memory:		 79MB (+0MB)
Solving...
Solving Time:	 0.05s
Memory:		 79MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.12s
Memory:		 80MB (+1MB)
Solving...
Solving Time:	 0.04s
Memory:		 80MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.12s
Memory:		 80MB (+0MB)
Solving...
Solving Time:	 0.01s
Memory:		 80MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.12s
Memory:		 80MB (+0MB)
Solving...
Solving Time:	 0.01s
Memory:		 80MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.12s
Memory:		 80MB (+0MB)
Solving...
Solving Time:	 0.09s
Memory:		 80MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.12s
Memory:		 81MB (+1MB)
Solving...
Solving Time:	 0.04s
Memory:		 81MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.12s
Memory:		 82MB (+1MB)
Solving...
Solving Time:	 0.07s
Memory:		 82MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.12s
Memory:		 82MB (+0MB)
Solving...
Solving Time:	 0.01s
Memory:		 82MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.12s
Memory:		 83MB (+1MB)
Solving...
Solving Time:	 0.05s
Memory:		 83MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.12s
Memory:		 83MB (+0MB)
Solving...
Solving Time:	 0.01s
Memory:		 83MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.12s
Memory:		 83MB (+0MB)
Solving...
Solving Time:	 0.04s
Memory:		 83MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.13s
Memory:		 83MB (+0MB)
Solving...
Solving Time:	 0.01s
Memory:		 83MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.13s
Memory:		 83MB (+0MB)
Solving...
Solving Time:	 0.01s
Memory:		 83MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.12s
Memory:		 84MB (+1MB)
Solving...
Solving Time:	 0.02s
Memory:		 84MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.12s
Memory:		 84MB (+0MB)
Solving...
Solving Time:	 0.04s
Memory:		 84MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.12s
Memory:		 84MB (+0MB)
Solving...
Solving Time:	 0.03s
Memory:		 84MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.13s
Memory:		 84MB (+0MB)
Solving...
Solving Time:	 0.06s
Memory:		 84MB (+0MB)
SAT
Testing...
SERIALIZABLE
Testing Time:	 0.12s
Memory:		 85MB (+1MB)
Answer: 24
occurs(action(("walk","driver2","s3","p3-9")),1) occurs(action(("walk","driver1","s1","p1-7")),1) occurs(action(("walk","driver2","p3-9","s9")),2) occurs(action(("walk","driver1","p1-7","s7")),2) occurs(action(("board-truck","driver2","truck2","s9")),3) occurs(action(("walk","driver1","s7","p2-7")),3) occurs(action(("walk","driver1","p2-7","s2")),4) occurs(action(("drive-truck","truck2","s9","s3","driver2")),4) occurs(action(("load-truck","package1","truck2","s3")),5) occurs(action(("drive-truck","truck2","s3","s1","driver2")),5) occurs(action(("board-truck","driver1","truck3","s2")),5) occurs(action(("drive-truck","truck3","s2","s0","driver1")),6) occurs(action(("load-truck","package6","truck2","s1")),6) occurs(action(("drive-truck","truck2","s1","s4","driver2")),6) occurs(action(("load-truck","package2","truck2","s4")),7) occurs(action(("load-truck","package5","truck2","s4")),7) occurs(action(("drive-truck","truck2","s4","s7","driver2")),7) occurs(action(("disembark-truck","driver1","truck3","s0")),7) occurs(action(("load-truck","package4","truck2","s7")),8) occurs(action(("drive-truck","truck2","s7","s1","driver2")),8) occurs(action(("unload-truck","package5","truck2","s7")),8) occurs(action(("walk","driver1","s0","p6-0")),8) occurs(action(("unload-truck","package4","truck2","s1")),9) occurs(action(("load-truck","package5","truck1","s7")),9) occurs(action(("drive-truck","truck2","s1","s2","driver2")),9) occurs(action(("walk","driver1","p6-0","s6")),9) occurs(action(("unload-truck","package1","truck2","s2")),10) occurs(action(("unload-truck","package2","truck2","s2")),10) occurs(action(("unload-truck","package6","truck2","s2")),10) occurs(action(("drive-truck","truck2","s2","s5","driver2")),10) occurs(action(("walk","driver1","s6","p7-6")),10) occurs(action(("walk","driver1","p7-6","s7")),11) occurs(action(("disembark-truck","driver2","truck2","s5")),11) occurs(action(("walk","driver2","s5","p5-9")),12) occurs(action(("board-truck","driver1","truck1","s7")),12) occurs(action(("walk","driver2","p5-9","s9")),13) occurs(action(("drive-truck","truck1","s7","s0","driver1")),13) occurs(action(("unload-truck","package5","truck1","s0")),14) occurs(action(("drive-truck","truck1","s0","s4","driver1")),14) occurs(action(("disembark-truck","driver1","truck1","s4")),15)
SATISFIABLE

Models       : 1+
Calls        : 27
Time         : 1.490s (Solving: 0.90s 1st Model: 0.80s Unsat: 0.07s)
CPU Time     : 1.472s

Choices      : 26899    (Domain: 26864)
Conflicts    : 6803     (Analyzed: 6802)
Restarts     : 66       (Average: 103.06 Last: 100)
Model-Level  : 152.0   
Problems     : 27       (Average Length: 15.33 Splits: 0)
Lemmas       : 6802     (Deleted: 0)
  Binary     : 21       (Ratio:   0.31%)
  Ternary    : 37       (Ratio:   0.54%)
  Conflict   : 6802     (Average Length:  274.6 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 6802     (Average:  2.88 Max: 218 Sum:  19567)
  Executed   : 6794     (Average:  2.88 Max: 218 Sum:  19559 Ratio:  99.96%)
  Bounded    : 8        (Average:  1.00 Max:   1 Sum:      8 Ratio:   0.04%)

Rules        : 14840   
Atoms        : 14382   
Bodies       : 789      (Original: 788)
Equivalences : 990      (Atom=Atom: 330 Body=Body: 0 Other: 660)
Tight        : Yes
Variables    : 17009    (Eliminated:    0 Frozen: 2199)
Constraints  : 59355    (Binary:  93.8% Ternary:   3.7% Other:   2.5%)

Memory Peak  : 85MB
Max. Length  : 15 steps
Sol. Length  : 15 steps
Models       : 24