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.025s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.016s wall-clock]
Preparing model... [0.030s CPU, 0.020s wall-clock]
Generated 35 rules.
Computing model... [0.150s CPU, 0.156s wall-clock]
1376 relevant atoms
903 auxiliary atoms
2279 final queue length
3128 total queue pushes
Completing instantiation... [0.170s CPU, 0.167s wall-clock]
Instantiating: [0.370s CPU, 0.371s 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.001s wall-clock]
Instantiating groups... [0.010s CPU, 0.015s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
3 uncovered facts
Choosing groups: [0.000s CPU, 0.003s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.040s CPU, 0.046s wall-clock]
Building STRIPS to SAS dictionary... [0.010s 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.009s wall-clock]
Translating task: [0.180s CPU, 0.178s 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.090s CPU, 0.099s 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.030s CPU, 0.025s 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: 35928 KB
Writing output... [0.070s CPU, 0.082s wall-clock]
Done! [0.820s CPU, 0.838s wall-clock]
planner.py version 0.0.1

Time:	 0.18s
Memory: 55MB

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:		 55MB (+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:		 55MB (+0MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 56MB (+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:		 58MB (+2MB)
Unblocking actions...
Solving...
Answer: 1
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","driver1","truck1","s7")),3) occurs(action(("board-truck","driver2","truck2","s9")),3) occurs(action(("load-truck","package4","truck1","s7")),4) occurs(action(("drive-truck","truck1","s7","s4","driver1")),4) occurs(action(("drive-truck","truck2","s9","s2","driver2")),4) occurs(action(("drive-truck","truck2","s2","s5","driver2")),5) occurs(action(("load-truck","package2","truck1","s4")),5) occurs(action(("drive-truck","truck1","s4","s1","driver1")),5) occurs(action(("load-truck","package5","truck1","s4")),5) occurs(action(("disembark-truck","driver2","truck2","s2")),5) occurs(action(("unload-truck","package4","truck1","s1")),6) occurs(action(("load-truck","package6","truck1","s1")),6) occurs(action(("board-truck","driver2","truck3","s2")),6) occurs(action(("unload-truck","package5","truck1","s1")),6) occurs(action(("drive-truck","truck1","s1","s3","driver1")),6) occurs(action(("load-truck","package1","truck1","s3")),7) occurs(action(("drive-truck","truck1","s3","s9","driver1")),7) occurs(action(("drive-truck","truck3","s2","s1","driver2")),7) occurs(action(("drive-truck","truck3","s1","s0","driver2")),8) occurs(action(("load-truck","package5","truck3","s1")),8) occurs(action(("drive-truck","truck1","s9","s2","driver1")),8) occurs(action(("disembark-truck","driver2","truck3","s1")),8) occurs(action(("unload-truck","package1","truck1","s2")),9) occurs(action(("unload-truck","package2","truck1","s2")),9) occurs(action(("unload-truck","package5","truck3","s0")),9) occurs(action(("unload-truck","package6","truck1","s2")),9) occurs(action(("walk","driver2","s1","p9-1")),9) occurs(action(("drive-truck","truck1","s2","s4","driver1")),9) occurs(action(("walk","driver2","p9-1","s9")),10) occurs(action(("disembark-truck","driver1","truck1","s4")),10) occurs(action(("drive-truck","truck1","s4","s5","driver1")),10)
Solving Time:	 0.01s
Memory:		 60MB (+2MB)
SAT
SATISFIABLE

Models       : 1+
Calls        : 3
Time         : 0.338s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
CPU Time     : 0.330s

Choices      : 558     
Conflicts    : 249      (Analyzed: 249)
Restarts     : 2        (Average: 124.50 Last: 24)
Model-Level  : 31.0    
Problems     : 3        (Average Length: 7.00 Splits: 0)
Lemmas       : 249      (Deleted: 0)
  Binary     : 17       (Ratio:   6.83%)
  Ternary    : 10       (Ratio:   4.02%)
  Conflict   : 249      (Average Length:   38.7 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 249      (Average:  2.22 Max:  21 Sum:    552)
  Executed   : 246      (Average:  2.16 Max:  21 Sum:    538 Ratio:  97.46%)
  Bounded    : 3        (Average:  4.67 Max:  12 Sum:     14 Ratio:   2.54%)

Rules        : 13237   
Atoms        : 13237   
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 10858    (Eliminated:    0 Frozen: 1414)
Constraints  : 29627    (Binary:  93.5% Ternary:   4.1% Other:   2.4%)

Memory Peak  : 60MB
Max. Length  : 10 steps
Sol. Length  : 10 steps


