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-13.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-13.pddl
Parsing...
Parsing: [0.020s CPU, 0.023s 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.015s wall-clock]
Preparing model... [0.020s CPU, 0.021s wall-clock]
Generated 35 rules.
Computing model... [0.180s CPU, 0.183s wall-clock]
1675 relevant atoms
1119 auxiliary atoms
2794 final queue length
3819 total queue pushes
Completing instantiation... [0.220s CPU, 0.226s wall-clock]
Instantiating: [0.450s CPU, 0.457s 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.022s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
3 uncovered facts
Choosing groups: [0.010s CPU, 0.004s wall-clock]
Building translation key... [0.000s CPU, 0.003s wall-clock]
Computing fact groups: [0.060s CPU, 0.060s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.002s 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.010s CPU, 0.013s wall-clock]
Translating task: [0.240s CPU, 0.246s wall-clock]
72 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
11 propositions removed
Detecting unreachable propositions: [0.140s CPU, 0.134s wall-clock]
Reordering and filtering variables...
13 of 14 variables necessary.
3 of 14 mutex groups necessary.
1076 of 1148 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.030s CPU, 0.035s wall-clock]
Translator variables: 13
Translator derived variables: 0
Translator facts: 197
Translator goal facts: 8
Translator mutex groups: 3
Translator total mutex groups size: 9
Translator operators: 1076
Translator axioms: 0
Translator task size: 4547
Translator peak memory: 36440 KB
Writing output... [0.090s CPU, 0.104s wall-clock]
Done! [1.060s CPU, 1.076s wall-clock]
planner.py version 0.0.1

Time:	 0.20s
Memory: 56MB

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:		 56MB (+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.07s
Memory:		 57MB (+1MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 60MB (+3MB)
UNSAT
Iteration Time:	 0.10s

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.08s
Memory:		 63MB (+3MB)
Unblocking actions...
Solving...
Solving Time:	 0.07s
Memory:		 66MB (+3MB)
UNSAT
Iteration Time:	 0.18s

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.07s
Memory:		 69MB (+3MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("load-truck","package6","truck3","s2")),1) occurs(action(("board-truck","driver2","truck2","s9")),1) occurs(action(("walk","driver1","s0","p0-2")),1) occurs(action(("drive-truck","truck2","s9","s8","driver2")),2) occurs(action(("walk","driver1","p0-2","s2")),2) occurs(action(("disembark-truck","driver2","truck2","s8")),3) occurs(action(("walk","driver1","s2","p2-3")),3) occurs(action(("walk","driver1","p2-3","s3")),4) occurs(action(("walk","driver2","s8","p6-8")),4) occurs(action(("board-truck","driver1","truck1","s3")),5) occurs(action(("walk","driver2","p6-8","s6")),5) occurs(action(("drive-truck","truck1","s3","s11","driver1")),6) occurs(action(("walk","driver2","s6","p2-6")),6) occurs(action(("drive-truck","truck1","s11","s6","driver1")),7) occurs(action(("walk","driver2","p2-6","s2")),7) occurs(action(("load-truck","package2","truck1","s6")),8) occurs(action(("load-truck","package4","truck1","s6")),8) occurs(action(("board-truck","driver2","truck3","s2")),8) occurs(action(("drive-truck","truck1","s6","s4","driver1")),9) occurs(action(("drive-truck","truck3","s2","s5","driver2")),9) occurs(action(("unload-truck","package6","truck3","s5")),10) occurs(action(("load-truck","package1","truck1","s4")),10) occurs(action(("load-truck","package3","truck3","s5")),10) occurs(action(("unload-truck","package2","truck1","s4")),10) occurs(action(("unload-truck","package4","truck1","s4")),10) occurs(action(("drive-truck","truck3","s5","s4","driver2")),11) occurs(action(("drive-truck","truck1","s4","s5","driver1")),11) occurs(action(("unload-truck","package1","truck1","s5")),12) occurs(action(("unload-truck","package3","truck3","s4")),12) occurs(action(("load-truck","package2","truck3","s4")),12) occurs(action(("load-truck","package4","truck3","s4")),12) occurs(action(("drive-truck","truck3","s4","s0","driver2")),13) occurs(action(("drive-truck","truck1","s5","s3","driver1")),13) occurs(action(("unload-truck","package2","truck3","s0")),14) occurs(action(("unload-truck","package4","truck3","s0")),14) occurs(action(("drive-truck","truck1","s3","s11","driver1")),14) occurs(action(("disembark-truck","driver1","truck1","s11")),15) occurs(action(("drive-truck","truck3","s0","s4","driver2")),15)
Solving Time:	 0.16s
Memory:		 74MB (+5MB)
SAT
SATISFIABLE

Models       : 1+
Calls        : 4
Time         : 0.760s (Solving: 0.22s 1st Model: 0.15s Unsat: 0.06s)
CPU Time     : 0.750s

Choices      : 5537     (Domain: 5537)
Conflicts    : 1030     (Analyzed: 1028)
Restarts     : 10       (Average: 102.80 Last: 60)
Model-Level  : 152.0   
Problems     : 4        (Average Length: 9.50 Splits: 0)
Lemmas       : 1028     (Deleted: 0)
  Binary     : 27       (Ratio:   2.63%)
  Ternary    : 7        (Ratio:   0.68%)
  Conflict   : 1028     (Average Length:  331.0 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 1028     (Average:  4.91 Max: 167 Sum:   5043)
  Executed   : 1003     (Average:  4.67 Max: 167 Sum:   4804 Ratio:  95.26%)
  Bounded    : 25       (Average:  9.56 Max:  17 Sum:    239 Ratio:   4.74%)

Rules        : 16195   
Atoms        : 16195   
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 21246    (Eliminated:    0 Frozen: 17672)
Constraints  : 97709    (Binary:  95.0% Ternary:   2.9% Other:   2.2%)

Memory Peak  : 74MB
Max. Length  : 15 steps
Sol. Length  : 15 steps


