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-33.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-33.pddl
Parsing...
Parsing: [0.010s CPU, 0.018s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.004s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.028s wall-clock]
Preparing model... [0.010s CPU, 0.014s wall-clock]
Generated 51 rules.
Computing model... [0.100s CPU, 0.095s wall-clock]
560 relevant atoms
534 auxiliary atoms
1094 final queue length
1317 total queue pushes
Completing instantiation... [0.070s CPU, 0.074s wall-clock]
Instantiating: [0.210s CPU, 0.217s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.010s CPU, 0.009s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.010s CPU, 0.010s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.001s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.000s CPU, 0.002s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.030s CPU, 0.031s 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.000s CPU, 0.004s wall-clock]
Translating task: [0.060s CPU, 0.060s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
17 propositions removed
Detecting unreachable propositions: [0.030s CPU, 0.035s wall-clock]
Reordering and filtering variables...
17 of 17 variables necessary.
0 of 17 mutex groups necessary.
318 of 318 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.009s wall-clock]
Translator variables: 17
Translator derived variables: 0
Translator facts: 133
Translator goal facts: 7
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 318
Translator axioms: 0
Translator task size: 1405
Translator peak memory: 33880 KB
Writing output... [0.030s CPU, 0.030s wall-clock]
Done! [0.400s CPU, 0.408s wall-clock]
planner.py version 0.0.1

Time:	 0.12s
Memory: 50MB

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:		 50MB (+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.06s
Memory:		 58MB (+8MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("drive-truck","truck1","city2-2","city2-1","city2")),1) occurs(action(("drive-truck","truck2","city1-2","city1-1","city1")),1) occurs(action(("drive-truck","truck3","city1-2","city1-1","city1")),1) occurs(action(("drive-truck","truck6","city1-2","city1-1","city1")),1) occurs(action(("load-truck","package2","truck7","city1-2")),1) occurs(action(("load-airplane","package5","plane1","city2-2")),1) occurs(action(("load-airplane","package6","plane1","city2-2")),1) occurs(action(("drive-truck","truck5","city3-1","city3-2","city3")),1) occurs(action(("fly-airplane","plane1","city1-2","city2-2")),1) occurs(action(("load-truck","package7","truck8","city2-1")),1) occurs(action(("drive-truck","truck8","city2-1","city2-2","city2")),1) occurs(action(("drive-truck","truck7","city1-1","city1-2","city1")),1) occurs(action(("load-airplane","package1","plane1","city1-2")),1) occurs(action(("load-truck","package3","truck8","city2-1")),1) occurs(action(("load-truck","package4","truck5","city3-1")),1) occurs(action(("unload-truck","package2","truck7","city1-1")),2) occurs(action(("unload-truck","package7","truck8","city2-2")),2) occurs(action(("fly-airplane","plane1","city2-2","city3-2")),2) occurs(action(("unload-airplane","package1","plane1","city2-2")),2) occurs(action(("unload-truck","package3","truck8","city2-2")),2) occurs(action(("unload-truck","package4","truck5","city3-2")),2) occurs(action(("drive-truck","truck1","city2-1","city2-2","city2")),2) occurs(action(("unload-airplane","package5","plane1","city2-2")),2) occurs(action(("drive-truck","truck2","city1-1","city1-2","city1")),2) occurs(action(("drive-truck","truck7","city1-2","city1-1","city1")),2) occurs(action(("load-truck","package1","truck8","city2-2")),3) occurs(action(("load-airplane","package3","plane1","city2-2")),3) occurs(action(("load-airplane","package4","plane1","city3-2")),3) occurs(action(("load-airplane","package5","plane1","city2-2")),3) occurs(action(("drive-truck","truck4","city3-1","city3-2","city3")),3) occurs(action(("drive-truck","truck9","city3-1","city3-2","city3")),3) occurs(action(("load-airplane","package7","plane1","city2-2")),3) occurs(action(("fly-airplane","plane1","city3-2","city2-2")),3) occurs(action(("drive-truck","truck8","city2-2","city2-1","city2")),3) occurs(action(("unload-truck","package1","truck8","city2-1")),4) occurs(action(("unload-airplane","package5","plane1","city3-2")),4) occurs(action(("unload-airplane","package6","plane1","city3-2")),4) occurs(action(("unload-airplane","package7","plane1","city2-2")),4) occurs(action(("load-truck","package2","truck6","city1-1")),4) occurs(action(("fly-airplane","plane1","city2-2","city3-2")),4) occurs(action(("unload-truck","package2","truck6","city1-1")),5) occurs(action(("unload-airplane","package3","plane1","city3-2")),5) occurs(action(("unload-airplane","package4","plane1","city2-2")),5) occurs(action(("fly-airplane","plane1","city3-2","city2-2")),5)
Solving Time:	 0.01s
Memory:		 62MB (+4MB)
SAT
SATISFIABLE

Models       : 1+
Calls        : 2
Time         : 0.220s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
CPU Time     : 0.220s

Choices      : 802     
Conflicts    : 115      (Analyzed: 115)
Restarts     : 1        (Average: 115.00 Last: 52)
Model-Level  : 103.0   
Problems     : 2        (Average Length: 4.50 Splits: 0)
Lemmas       : 234      (Deleted: 0)
  Binary     : 70       (Ratio:  29.91%)
  Ternary    : 27       (Ratio:  11.54%)
  Conflict   : 115      (Average Length:    4.3 Ratio:  49.15%) 
  Loop       : 119      (Average Length:    8.1 Ratio:  50.85%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 115      (Average:  7.80 Max:  39 Sum:    897)
  Executed   : 80       (Average:  6.14 Max:  39 Sum:    706 Ratio:  78.71%)
  Bounded    : 35       (Average:  5.46 Max:   7 Sum:    191 Ratio:  21.29%)

Rules        : 28888   
Atoms        : 28888   
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 11424    (Eliminated:    0 Frozen: 9485)
Constraints  : 26545    (Binary:  80.7% Ternary:  16.5% Other:   2.8%)

Memory Peak  : 62MB
Max. Length  : 5 steps
Sol. Length  : 5 steps


