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-15.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-15.pddl
Parsing...
Parsing: [0.040s CPU, 0.033s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.012s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.020s wall-clock]
Preparing model... [0.030s CPU, 0.030s wall-clock]
Generated 35 rules.
Computing model... [0.350s CPU, 0.357s wall-clock]
3250 relevant atoms
1604 auxiliary atoms
4854 final queue length
7326 total queue pushes
Completing instantiation... [0.510s CPU, 0.511s wall-clock]
Instantiating: [0.930s CPU, 0.934s wall-clock]
Computing fact groups...
Finding invariants...
11 initial candidates
Finding invariants: [0.030s CPU, 0.025s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.030s CPU, 0.034s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
Choosing groups...
4 uncovered facts
Choosing groups: [0.010s CPU, 0.007s wall-clock]
Building translation key... [0.000s CPU, 0.004s wall-clock]
Computing fact groups: [0.090s CPU, 0.090s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s 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.002s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.040s CPU, 0.030s wall-clock]
Translating task: [0.590s CPU, 0.587s wall-clock]
192 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
16 propositions removed
Detecting unreachable propositions: [0.290s CPU, 0.295s wall-clock]
Reordering and filtering variables...
20 of 20 variables necessary.
4 of 20 mutex groups necessary.
2592 of 2592 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.080s CPU, 0.077s wall-clock]
Translator variables: 20
Translator derived variables: 0
Translator facts: 336
Translator goal facts: 10
Translator mutex groups: 4
Translator total mutex groups size: 20
Translator operators: 2592
Translator axioms: 0
Translator task size: 10978
Translator peak memory: 43980 KB
Writing output... [0.210s CPU, 0.237s wall-clock]
Done! [2.260s CPU, 2.287s wall-clock]
planner.py version 0.0.1

Time:	 0.43s
Memory: 77MB

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:		 77MB (+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.12s
Memory:		 77MB (+0MB)
Unblocking actions...
Solving...
Solving Time:	 0.01s
Memory:		 79MB (+2MB)
UNSAT
Iteration Time:	 0.20s

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.15s
Memory:		 87MB (+8MB)
Unblocking actions...
Solving...
Solving Time:	 0.01s
Memory:		 94MB (+7MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.43s
Memory:		 110MB (+16MB)
Solving...
Solving Time:	 0.44s
Memory:		 106MB (+-4MB)
UNSAT
Iteration Time:	 1.11s

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.21s
Memory:		 106MB (+0MB)
Unblocking actions...
Solving...
Solving Time:	 0.02s
Memory:		 116MB (+10MB)
SAT
Testing...
SERIALIZABLE?
Testing Time:	 0.00s
Memory:		 116MB (+0MB)
Answer: 2
occurs(action(("load-truck","package1","truck1","s3")),1) occurs(action(("load-truck","package7","truck2","s9")),1) occurs(action(("walk","driver1","s8","p8-3")),1) occurs(action(("walk","driver2","s5","p5-9")),1) occurs(action(("walk","driver3","s5","p1-5")),1) occurs(action(("walk","driver4","s10","p10-0")),1) occurs(action(("walk","driver1","p8-3","s3")),2) occurs(action(("walk","driver2","p5-9","s9")),2) occurs(action(("walk","driver3","p1-5","s1")),2) occurs(action(("walk","driver4","p10-0","s0")),2) occurs(action(("walk","driver3","s1","p8-1")),3) occurs(action(("board-truck","driver1","truck3","s3")),3) occurs(action(("board-truck","driver2","truck2","s9")),3) occurs(action(("walk","driver4","s0","p0-6")),3) occurs(action(("walk","driver3","p8-1","s8")),4) occurs(action(("drive-truck","truck3","s3","s8","driver1")),4) occurs(action(("drive-truck","truck2","s9","s3","driver2")),4) occurs(action(("walk","driver4","p0-6","s6")),4) occurs(action(("unload-truck","package7","truck2","s3")),5) occurs(action(("board-truck","driver4","truck4","s6")),5) occurs(action(("disembark-truck","driver2","truck2","s3")),5) occurs(action(("disembark-truck","driver1","truck3","s8")),5) occurs(action(("load-truck","package7","truck1","s3")),6) occurs(action(("drive-truck","truck4","s6","s8","driver4")),6) occurs(action(("board-truck","driver2","truck1","s3")),6) occurs(action(("walk","driver1","s8","p8-3")),6) occurs(action(("load-truck","package3","truck4","s8")),7) occurs(action(("drive-truck","truck1","s3","s2","driver2")),7) occurs(action(("walk","driver1","p8-3","s3")),7) occurs(action(("unload-truck","package1","truck1","s2")),8) occurs(action(("unload-truck","package7","truck1","s2")),8) occurs(action(("load-truck","package2","truck1","s2")),8) occurs(action(("board-truck","driver1","truck2","s3")),8) occurs(action(("drive-truck","truck4","s8","s6","driver4")),8) occurs(action(("drive-truck","truck1","s2","s5","driver2")),9) occurs(action(("drive-truck","truck4","s6","s1","driver4")),9) occurs(action(("drive-truck","truck2","s3","s11","driver1")),9) occurs(action(("unload-truck","package2","truck1","s5")),10) occurs(action(("unload-truck","package3","truck4","s1")),10) occurs(action(("load-truck","package4","truck2","s11")),10) occurs(action(("load-truck","package5","truck4","s1")),10) occurs(action(("drive-truck","truck2","s11","s7","driver1")),11) occurs(action(("drive-truck","truck1","s5","s8","driver2")),11) occurs(action(("drive-truck","truck4","s1","s10","driver4")),11) occurs(action(("unload-truck","package4","truck2","s7")),12) occurs(action(("load-truck","package6","truck1","s8")),12) occurs(action(("load-truck","package8","truck4","s10")),12) occurs(action(("drive-truck","truck4","s10","s1","driver4")),13) occurs(action(("drive-truck","truck2","s7","s9","driver1")),13) occurs(action(("drive-truck","truck1","s8","s3","driver2")),13) occurs(action(("drive-truck","truck1","s3","s11","driver2")),14) occurs(action(("drive-truck","truck4","s1","s0","driver4")),14) occurs(action(("drive-truck","truck2","s9","s4","driver1")),14) occurs(action(("unload-truck","package5","truck4","s0")),15) occurs(action(("unload-truck","package6","truck1","s11")),15) occurs(action(("unload-truck","package8","truck4","s0")),15) occurs(action(("disembark-truck","driver1","truck2","s4")),15) occurs(action(("disembark-truck","driver2","truck1","s11")),15) occurs(action(("disembark-truck","driver4","truck4","s0")),15)
SATISFIABLE

Models       : 1+
Calls        : 5
Time         : 1.770s (Solving: 0.44s 1st Model: 0.01s Unsat: 0.42s)
CPU Time     : 1.752s

Choices      : 9244     (Domain: 9216)
Conflicts    : 2014     (Analyzed: 2013)
Restarts     : 25       (Average: 80.52 Last: 17)
Model-Level  : 255.5   
Problems     : 5        (Average Length: 10.00 Splits: 0)
Lemmas       : 2013     (Deleted: 0)
  Binary     : 30       (Ratio:   1.49%)
  Ternary    : 7        (Ratio:   0.35%)
  Conflict   : 2013     (Average Length:  142.1 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 2013     (Average:  5.00 Max:  95 Sum:  10058)
  Executed   : 1894     (Average:  4.31 Max:  95 Sum:   8674 Ratio:  86.24%)
  Bounded    : 119      (Average: 11.63 Max:  12 Sum:   1384 Ratio:  13.76%)

Rules        : 63791    (Original: 63736)
Atoms        : 39223   
Bodies       : 23987    (Original: 23931)
  Count      : 126      (Original: 138)
Equivalences : 13125    (Atom=Atom: 16 Body=Body: 0 Other: 13109)
Tight        : Yes
Variables    : 46052    (Eliminated:    0 Frozen: 30679)
Constraints  : 218284   (Binary:  96.3% Ternary:   2.1% Other:   1.5%)

Memory Peak  : 116MB
Max. Length  : 15 steps
Sol. Length  : 15 steps
Models       : 2


