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-31.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-31.pddl
Parsing...
Parsing: [0.020s CPU, 0.016s 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.024s wall-clock]
Preparing model... [0.010s CPU, 0.012s wall-clock]
Generated 51 rules.
Computing model... [0.060s CPU, 0.067s wall-clock]
352 relevant atoms
400 auxiliary atoms
752 final queue length
881 total queue pushes
Completing instantiation... [0.050s CPU, 0.044s wall-clock]
Instantiating: [0.150s CPU, 0.153s 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.006s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.000s CPU, 0.001s wall-clock]
Building translation key... [0.000s CPU, 0.001s wall-clock]
Computing fact groups: [0.020s CPU, 0.021s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.000s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.000s CPU, 0.002s wall-clock]
Translating task: [0.030s CPU, 0.031s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
10 propositions removed
Detecting unreachable propositions: [0.020s CPU, 0.017s wall-clock]
Reordering and filtering variables...
10 of 10 variables necessary.
0 of 10 mutex groups necessary.
170 of 170 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.000s CPU, 0.005s wall-clock]
Translator variables: 10
Translator derived variables: 0
Translator facts: 71
Translator goal facts: 3
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 170
Translator axioms: 0
Translator task size: 714
Translator peak memory: 33624 KB
Writing output... [0.010s CPU, 0.017s wall-clock]
Done! [0.260s CPU, 0.263s wall-clock]
planner.py version 0.0.1

Time:	 0.08s
Memory: 48MB

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:		 48MB (+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.03s
Memory:		 51MB (+3MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("load-truck","package1","truck4","city4-1")),1) occurs(action(("fly-airplane","plane1","city2-2","city3-2")),2) occurs(action(("load-truck","package3","truck1","city1-1")),2) occurs(action(("drive-truck","truck1","city1-1","city1-2","city1")),2) occurs(action(("drive-truck","truck4","city4-1","city4-2","city4")),2) occurs(action(("unload-truck","package3","truck1","city1-2")),3) occurs(action(("load-truck","package2","truck1","city1-2")),3) occurs(action(("unload-truck","package1","truck4","city4-2")),3) occurs(action(("fly-airplane","plane2","city1-2","city4-2")),3) occurs(action(("drive-truck","truck1","city1-2","city1-1","city1")),3) occurs(action(("drive-truck","truck4","city4-2","city4-1","city4")),3) occurs(action(("unload-truck","package2","truck1","city1-1")),4) occurs(action(("load-airplane","package1","plane2","city4-2")),4) occurs(action(("fly-airplane","plane2","city4-2","city3-2")),4) occurs(action(("fly-airplane","plane1","city3-2","city2-2")),4) occurs(action(("unload-airplane","package1","plane2","city3-2")),5) occurs(action(("fly-airplane","plane2","city3-2","city4-2")),5)
Solving Time:	 0.00s
Memory:		 51MB (+0MB)
SAT
SATISFIABLE

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

Choices      : 64      
Conflicts    : 0        (Analyzed: 0)
Restarts     : 0       
Model-Level  : 71.0    
Problems     : 2        (Average Length: 4.50 Splits: 0)
Lemmas       : 0        (Deleted: 0)
  Binary     : 0        (Ratio:   0.00%)
  Ternary    : 0        (Ratio:   0.00%)
  Conflict   : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 0        (Average:  0.00 Max:   0 Sum:      0)
  Executed   : 0        (Average:  0.00 Max:   0 Sum:      0 Ratio:   0.00%)
  Bounded    : 0        (Average:  0.00 Max:   0 Sum:      0 Ratio: 100.00%)

Rules        : 21408   
Atoms        : 21408   
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 1904     (Eliminated:    0 Frozen:    0)
Constraints  : 3645     (Binary:  89.6% Ternary:   7.9% Other:   2.5%)

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