INFO     Running translator.
INFO     translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/tpp-propositional/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/tpp-propositional/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-2006/domains/tpp-propositional/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/tpp-propositional/instances/instance-7.pddl
Parsing...
Parsing: [0.020s CPU, 0.020s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.005s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.032s wall-clock]
Preparing model... [0.010s CPU, 0.015s wall-clock]
Generated 45 rules.
Computing model... [0.100s CPU, 0.099s wall-clock]
370 relevant atoms
861 auxiliary atoms
1231 final queue length
1508 total queue pushes
Completing instantiation... [0.070s CPU, 0.066s wall-clock]
Instantiating: [0.210s CPU, 0.220s wall-clock]
Computing fact groups...
Finding invariants...
18 initial candidates
Finding invariants: [0.040s CPU, 0.040s wall-clock]
Checking invariant weight... [0.010s CPU, 0.002s wall-clock]
Instantiating groups... [0.000s CPU, 0.010s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
12 uncovered facts
Choosing groups: [0.000s CPU, 0.003s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.070s CPU, 0.064s wall-clock]
Building STRIPS to SAS dictionary... [0.000s 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.003s wall-clock]
Translating task: [0.050s CPU, 0.052s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
63 propositions removed
Detecting unreachable propositions: [0.030s CPU, 0.029s wall-clock]
Reordering and filtering variables...
39 of 39 variables necessary.
0 of 39 mutex groups necessary.
180 of 180 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.020s CPU, 0.014s wall-clock]
Translator variables: 39
Translator derived variables: 0
Translator facts: 114
Translator goal facts: 7
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 180
Translator axioms: 0
Translator task size: 1216
Translator peak memory: 37068 KB
Writing output... [0.020s CPU, 0.025s wall-clock]
Done! [0.420s CPU, 0.432s wall-clock]
planner.py version 0.0.1

Time:	 0.08s
Memory: 52MB

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:		 52MB (+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
Expected Memory: 52MB
Grounding...	 [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time:	 0.02s
Memory:		 53MB (+1MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 53MB (+0MB)
UNSAT
Iteration Time:	 0.03s

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
Expected Memory: 54.0MB
Grounding...	 [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time:	 0.02s
Memory:		 55MB (+2MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 55MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.06s
Memory:		 57MB (+2MB)
Solving...
Solving Time:	 0.02s
Memory:		 56MB (+-1MB)
SAT
Testing...
SERIALIZABLE?
Testing Time:	 0.00s
Memory:		 56MB (+0MB)
Answer: 2
occurs(action(("drive","truck1","depot1","market2")),1) occurs(action(("drive","truck2","depot1","market2")),1) occurs(action(("drive","truck1","market2","market1")),2) occurs(action(("drive","truck2","market2","market1")),2) occurs(action(("buy","truck2","goods1","market1","level0","level1","level0","level1")),3) occurs(action(("buy","truck1","goods2","market1","level1","level2","level0","level1")),3) occurs(action(("buy","truck2","goods3","market1","level0","level1","level0","level1")),3) occurs(action(("buy","truck1","goods4","market1","level1","level2","level0","level1")),3) occurs(action(("buy","truck2","goods5","market1","level1","level2","level0","level1")),3) occurs(action(("buy","truck1","goods6","market1","level1","level2","level0","level1")),3) occurs(action(("buy","truck2","goods7","market1","level1","level2","level0","level1")),3) occurs(action(("load","goods1","truck2","market1","level0","level1","level0","level1")),4) occurs(action(("load","goods2","truck2","market1","level0","level1","level0","level1")),4) occurs(action(("load","goods3","truck2","market1","level0","level1","level0","level1")),4) occurs(action(("load","goods4","truck2","market1","level0","level1","level0","level1")),4) occurs(action(("load","goods5","truck2","market1","level0","level1","level0","level1")),4) occurs(action(("load","goods6","truck2","market1","level0","level1","level0","level1")),4) occurs(action(("load","goods7","truck2","market1","level0","level1","level0","level1")),4) occurs(action(("drive","truck2","market1","market2")),5) occurs(action(("buy","truck1","goods4","market1","level0","level1","level0","level1")),5) occurs(action(("buy","truck1","goods5","market1","level0","level1","level0","level1")),5) occurs(action(("buy","truck1","goods6","market1","level0","level1","level0","level1")),5) occurs(action(("buy","truck1","goods7","market1","level0","level1","level0","level1")),5) occurs(action(("load","goods4","truck1","market1","level0","level1","level0","level1")),6) occurs(action(("load","goods5","truck1","market1","level0","level1","level0","level1")),6) occurs(action(("load","goods6","truck1","market1","level0","level1","level0","level1")),6) occurs(action(("load","goods7","truck1","market1","level0","level1","level0","level1")),6) occurs(action(("buy","truck1","goods2","market1","level0","level1","level0","level1")),6) occurs(action(("drive","truck2","market2","depot1")),6) occurs(action(("unload","goods1","truck2","depot1","level0","level1","level0","level1")),7) occurs(action(("unload","goods2","truck2","depot1","level0","level1","level0","level1")),7) occurs(action(("unload","goods3","truck2","depot1","level0","level1","level0","level1")),7) occurs(action(("unload","goods6","truck2","depot1","level0","level1","level0","level1")),7) occurs(action(("unload","goods4","truck2","depot1","level0","level1","level0","level1")),7) occurs(action(("unload","goods5","truck2","depot1","level0","level1","level0","level1")),7) occurs(action(("unload","goods7","truck2","depot1","level0","level1","level0","level1")),7) occurs(action(("drive","truck1","market1","market2")),7) occurs(action(("drive","truck2","depot1","market2")),8) occurs(action(("drive","truck1","market2","depot1")),8) occurs(action(("unload","goods4","truck1","depot1","level0","level1","level1","level2")),9) occurs(action(("unload","goods5","truck1","depot1","level0","level1","level1","level2")),9) occurs(action(("unload","goods7","truck1","depot1","level0","level1","level1","level2")),9) occurs(action(("drive","truck1","depot1","market2")),10)
SATISFIABLE

Models       : 1+
Calls        : 4
Time         : 0.187s (Solving: 0.02s 1st Model: 0.02s Unsat: 0.00s)
CPU Time     : 0.180s

Choices      : 1896     (Domain: 1772)
Conflicts    : 257      (Analyzed: 257)
Restarts     : 2        (Average: 128.50 Last: 57)
Model-Level  : 72.0    
Problems     : 4        (Average Length: 8.25 Splits: 0)
Lemmas       : 257      (Deleted: 0)
  Binary     : 56       (Ratio:  21.79%)
  Ternary    : 26       (Ratio:  10.12%)
  Conflict   : 257      (Average Length:   11.8 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 257      (Average:  8.23 Max:  48 Sum:   2116)
  Executed   : 228      (Average:  6.88 Max:  48 Sum:   1768 Ratio:  83.55%)
  Bounded    : 29       (Average: 12.00 Max:  12 Sum:    348 Ratio:  16.45%)

Rules        : 8582     (Original: 8110)
Atoms        : 4980    
Bodies       : 3303     (Original: 2853)
  Count      : 182      (Original: 254)
Equivalences : 1400     (Atom=Atom: 34 Body=Body: 0 Other: 1366)
Tight        : Yes
Variables    : 5047     (Eliminated:    0 Frozen: 1190)
Constraints  : 18381    (Binary:  86.6% Ternary:   8.5% Other:   4.9%)

Memory Peak  : 57MB
Max. Length  : 10 steps
Sol. Length  : 10 steps
Models       : 2