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-9.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-9.pddl
Parsing...
Parsing: [0.030s CPU, 0.024s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.021s wall-clock]
Preparing model... [0.020s CPU, 0.016s wall-clock]
Generated 35 rules.
Computing model... [0.090s CPU, 0.091s wall-clock]
596 relevant atoms
404 auxiliary atoms
1000 final queue length
1334 total queue pushes
Completing instantiation... [0.080s CPU, 0.078s wall-clock]
Instantiating: [0.210s CPU, 0.214s wall-clock]
Computing fact groups...
Finding invariants...
11 initial candidates
Finding invariants: [0.010s CPU, 0.016s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.020s CPU, 0.011s 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.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.001s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.000s CPU, 0.004s wall-clock]
Translating task: [0.080s CPU, 0.081s wall-clock]
30 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
11 propositions removed
Detecting unreachable propositions: [0.050s CPU, 0.048s wall-clock]
Reordering and filtering variables...
14 of 14 variables necessary.
3 of 14 mutex groups necessary.
384 of 384 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.013s wall-clock]
Translator variables: 14
Translator derived variables: 0
Translator facts: 97
Translator goal facts: 10
Translator mutex groups: 3
Translator total mutex groups size: 9
Translator operators: 384
Translator axioms: 0
Translator task size: 1708
Translator peak memory: 37324 KB
Writing output... [0.030s CPU, 0.037s wall-clock]
Done! [0.450s CPU, 0.461s wall-clock]
planner.py version 0.0.1

Time:	 0.09s
Memory: 53MB

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:		 53MB (+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:		 53MB (+0MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 53MB (+0MB)
UNSAT
Iteration Time:	 0.03s

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.02s
Memory:		 55MB (+2MB)
Unblocking actions...
Solving...
Solving Time:	 0.01s
Memory:		 55MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.05s
Memory:		 58MB (+3MB)
Solving...
Solving Time:	 0.00s
Memory:		 58MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.05s
Memory:		 58MB (+0MB)
Solving...
Solving Time:	 0.00s
Memory:		 58MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.05s
Memory:		 58MB (+0MB)
Solving...
Solving Time:	 0.00s
Memory:		 58MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.05s
Memory:		 58MB (+0MB)
Solving...
Solving Time:	 0.00s
Memory:		 58MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.05s
Memory:		 58MB (+0MB)
Solving...
Solving Time:	 0.00s
Memory:		 58MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.06s
Memory:		 58MB (+0MB)
Solving...
Solving Time:	 0.00s
Memory:		 58MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.05s
Memory:		 58MB (+0MB)
Solving...
Solving Time:	 0.00s
Memory:		 58MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.05s
Memory:		 58MB (+0MB)
Solving...
Solving Time:	 0.01s
Memory:		 58MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.05s
Memory:		 58MB (+0MB)
Solving...
Solving Time:	 0.00s
Memory:		 58MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.05s
Memory:		 58MB (+0MB)
Solving...
Solving Time:	 0.00s
Memory:		 58MB (+0MB)
SAT
Testing...
SERIALIZABLE
Testing Time:	 0.05s
Memory:		 58MB (+0MB)
Answer: 11
occurs(action(("load-truck","package1","truck1","s2")),1) occurs(action(("load-truck","package3","truck3","s3")),1) occurs(action(("walk","driver1","s4","p3-4")),1) occurs(action(("walk","driver2","s1","p0-1")),1) occurs(action(("walk","driver1","p3-4","s3")),2) occurs(action(("walk","driver2","p0-1","s0")),2) occurs(action(("board-truck","driver1","truck3","s3")),3) occurs(action(("board-truck","driver2","truck2","s0")),3) occurs(action(("drive-truck","truck2","s0","s3","driver2")),4) occurs(action(("drive-truck","truck3","s3","s2","driver1")),4) occurs(action(("drive-truck","truck3","s2","s1","driver1")),5) occurs(action(("disembark-truck","driver2","truck2","s3")),5) occurs(action(("unload-truck","package3","truck3","s1")),6) occurs(action(("load-truck","package2","truck3","s1")),6) occurs(action(("drive-truck","truck3","s1","s2","driver1")),6) occurs(action(("walk","driver2","s3","p3-4")),6) occurs(action(("unload-truck","package2","truck3","s2")),7) occurs(action(("walk","driver2","p3-4","s4")),7) occurs(action(("disembark-truck","driver1","truck3","s2")),7) occurs(action(("board-truck","driver1","truck1","s2")),8) occurs(action(("drive-truck","truck1","s2","s3","driver1")),9) occurs(action(("unload-truck","package1","truck1","s3")),10) occurs(action(("disembark-truck","driver1","truck1","s3")),10)
SATISFIABLE

Models       : 1+
Calls        : 13
Time         : 0.219s (Solving: 0.02s 1st Model: 0.02s Unsat: 0.00s)
CPU Time     : 0.212s

Choices      : 1753     (Domain: 1748)
Conflicts    : 407      (Analyzed: 407)
Restarts     : 2        (Average: 203.50 Last: 64)
Model-Level  : 72.8    
Problems     : 13       (Average Length: 10.85 Splits: 0)
Lemmas       : 407      (Deleted: 0)
  Binary     : 2        (Ratio:   0.49%)
  Ternary    : 7        (Ratio:   1.72%)
  Conflict   : 407      (Average Length:   72.3 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 407      (Average:  2.61 Max:  45 Sum:   1064)
  Executed   : 406      (Average:  2.58 Max:  45 Sum:   1052 Ratio:  98.87%)
  Bounded    : 1        (Average: 12.00 Max:  12 Sum:     12 Ratio:   1.13%)

Rules        : 5678    
Atoms        : 5661    
Bodies       : 118      (Original: 117)
Equivalences : 300      (Atom=Atom: 100 Body=Body: 0 Other: 200)
Tight        : Yes
Variables    : 4172     (Eliminated:    0 Frozen:  475)
Constraints  : 12640    (Binary:  91.8% Ternary:   4.6% Other:   3.6%)

Memory Peak  : 58MB
Max. Length  : 10 steps
Sol. Length  : 10 steps
Models       : 11


