INFO     Running translator.
INFO     translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/instances/instance-7.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-1998/domains/logistics-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/instances/instance-7.pddl
Parsing...
Parsing: [0.020s CPU, 0.021s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.006s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.024s wall-clock]
Preparing model... [0.020s CPU, 0.018s wall-clock]
Generated 51 rules.
Computing model... [0.360s CPU, 0.356s wall-clock]
3222 relevant atoms
1982 auxiliary atoms
5204 final queue length
7283 total queue pushes
Completing instantiation... [0.520s CPU, 0.525s wall-clock]
Instantiating: [0.940s CPU, 0.935s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.010s CPU, 0.012s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.040s CPU, 0.037s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.003s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.000s CPU, 0.008s wall-clock]
Building translation key... [0.000s CPU, 0.005s wall-clock]
Computing fact groups: [0.090s CPU, 0.093s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s 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.002s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.020s CPU, 0.023s wall-clock]
Translating task: [0.450s CPU, 0.456s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
27 propositions removed
Detecting unreachable propositions: [0.240s CPU, 0.239s wall-clock]
Reordering and filtering variables...
23 of 27 variables necessary.
0 of 27 mutex groups necessary.
1738 of 2442 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.050s CPU, 0.051s wall-clock]
Translator variables: 23
Translator derived variables: 0
Translator facts: 322
Translator goal facts: 6
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 1738
Translator axioms: 0
Translator task size: 6621
Translator peak memory: 40280 KB
Writing output... [0.130s CPU, 0.139s wall-clock]
Done! [1.950s CPU, 1.962s wall-clock]
planner.py version 0.0.1

Time:	 0.26s
Memory: 61MB

Iteration 1
Queue:		 [5]
Grounded Until:	 0
Grounding...	 [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time:	 0.11s
Memory:		 65MB (+4MB)
Unblocking actions...
Solving...
Solving Time:	 0.01s
Memory:		 69MB (+4MB)
UNSAT
Iteration Time:	 0.16s

Iteration 2
Queue:		 [7]
Grounded Until:	 5
Grounding...	 [('step', [6]), ('step', [7]), ('check', [7])]
Grounding Time:	 0.04s
Memory:		 70MB (+1MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 71MB (+1MB)
UNSAT
Iteration Time:	 0.07s

Iteration 3
Queue:		 [9]
Grounded Until:	 7
Grounding...	 [('step', [8]), ('step', [9]), ('check', [9])]
Grounding Time:	 0.04s
Memory:		 71MB (+0MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("fly-airplane","plane2","city8-2","city10-2")),1) occurs(action(("fly-airplane","plane3","city9-2","city1-2")),1) occurs(action(("fly-airplane","plane1","city1-2","city9-2")),1) occurs(action(("fly-airplane","plane4","city6-2","city9-2")),1) occurs(action(("fly-airplane","plane5","city5-2","city6-2")),1) occurs(action(("fly-airplane","plane6","city2-2","city4-2")),1) occurs(action(("load-truck","package5","truck4","city4-1")),1) occurs(action(("load-airplane","package6","plane3","city1-2")),2) occurs(action(("fly-airplane","plane1","city9-2","city6-2")),2) occurs(action(("load-airplane","package7","plane5","city6-2")),2) occurs(action(("drive-truck","truck4","city4-1","city4-2","city4")),2) occurs(action(("fly-airplane","plane5","city6-2","city5-2")),3) occurs(action(("load-airplane","package10","plane1","city6-2")),3) occurs(action(("unload-truck","package5","truck4","city4-2")),3) occurs(action(("load-airplane","package9","plane5","city5-2")),4) occurs(action(("unload-airplane","package7","plane5","city5-2")),4) occurs(action(("drive-truck","truck5","city5-1","city5-2","city5")),4) occurs(action(("load-airplane","package5","plane6","city4-2")),4) occurs(action(("drive-truck","truck4","city4-2","city4-1","city4")),4) occurs(action(("fly-airplane","plane3","city1-2","city10-2")),5) occurs(action(("load-truck","package7","truck5","city5-2")),5) occurs(action(("load-airplane","package8","plane2","city10-2")),5) occurs(action(("fly-airplane","plane1","city6-2","city9-2")),5) occurs(action(("fly-airplane","plane5","city5-2","city9-2")),5) occurs(action(("fly-airplane","plane6","city4-2","city7-2")),5) occurs(action(("unload-airplane","package9","plane5","city9-2")),6) occurs(action(("fly-airplane","plane2","city10-2","city1-2")),6) occurs(action(("drive-truck","truck9","city9-1","city9-2","city9")),6) occurs(action(("unload-airplane","package10","plane1","city9-2")),6) occurs(action(("unload-airplane","package5","plane6","city7-2")),6) occurs(action(("drive-truck","truck7","city7-1","city7-2","city7")),6) occurs(action(("drive-truck","truck5","city5-2","city5-1","city5")),6) occurs(action(("unload-airplane","package6","plane3","city10-2")),7) occurs(action(("unload-truck","package7","truck5","city5-1")),7) occurs(action(("unload-airplane","package8","plane2","city1-2")),7) occurs(action(("load-truck","package10","truck9","city9-2")),7) occurs(action(("load-truck","package5","truck7","city7-2")),7) occurs(action(("drive-truck","truck10","city10-1","city10-2","city10")),8) occurs(action(("drive-truck","truck9","city9-2","city9-1","city9")),8) occurs(action(("drive-truck","truck11","city11-1","city11-2","city11")),8) occurs(action(("drive-truck","truck3","city3-1","city3-2","city3")),8) occurs(action(("drive-truck","truck7","city7-2","city7-1","city7")),8) occurs(action(("unload-truck","package10","truck9","city9-1")),9) occurs(action(("unload-truck","package5","truck7","city7-1")),9) occurs(action(("drive-truck","truck10","city10-2","city10-1","city10")),9) occurs(action(("drive-truck","truck2","city2-1","city2-2","city2")),9) occurs(action(("drive-truck","truck3","city3-2","city3-1","city3")),9)
Solving Time:	 0.01s
Memory:		 73MB (+2MB)
SAT
SATISFIABLE

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

Choices      : 493     
Conflicts    : 35       (Analyzed: 34)
Restarts     : 0       
Model-Level  : 199.0   
Problems     : 3        (Average Length: 9.00 Splits: 0)
Lemmas       : 34       (Deleted: 0)
  Binary     : 11       (Ratio:  32.35%)
  Ternary    : 3        (Ratio:   8.82%)
  Conflict   : 34       (Average Length:   19.8 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 34       (Average: 10.32 Max:  88 Sum:    351)
  Executed   : 28       (Average:  8.97 Max:  88 Sum:    305 Ratio:  86.89%)
  Bounded    : 6        (Average:  7.67 Max:  11 Sum:     46 Ratio:  13.11%)

Rules        : 0       
Atoms        : 0       
Bodies       : 0       
Tight        : Yes
Variables    : 21788    (Eliminated:    0 Frozen: 15080)
Constraints  : 98992    (Binary:  94.9% Ternary:   3.5% Other:   1.6%)

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


