INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-6.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-2011/domains/no-mystery-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-6.pddl
Parsing...
Parsing: [1.440s CPU, 1.440s wall-clock]
Normalizing task... [0.040s CPU, 0.032s wall-clock]
Instantiating...
Generating Datalog program... [0.320s CPU, 0.330s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.012s wall-clock]
Preparing model... [2.720s CPU, 2.726s wall-clock]
Generated 23 rules.
Computing model... [6.270s CPU, 6.269s wall-clock]
33926 relevant atoms
61452 auxiliary atoms
95378 final queue length
108944 total queue pushes
Completing instantiation... [3.300s CPU, 3.291s wall-clock]
Instantiating: [12.730s CPU, 12.737s wall-clock]
Computing fact groups...
Finding invariants...
9 initial candidates
Finding invariants: [0.080s CPU, 0.075s wall-clock]
Checking invariant weight... [0.090s CPU, 0.087s wall-clock]
Instantiating groups... [0.070s CPU, 0.076s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.010s CPU, 0.008s wall-clock]
Building translation key... [0.010s CPU, 0.005s wall-clock]
Computing fact groups: [0.280s CPU, 0.274s 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.000s CPU, 0.002s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.100s CPU, 0.098s wall-clock]
Translating task: [1.950s CPU, 1.941s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
13 propositions removed
Detecting unreachable propositions: [1.100s CPU, 1.099s wall-clock]
Reordering and filtering variables...
13 of 13 variables necessary.
0 of 13 mutex groups necessary.
7082 of 7082 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.280s CPU, 0.284s wall-clock]
Translator variables: 13
Translator derived variables: 0
Translator facts: 369
Translator goal facts: 11
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 7082
Translator axioms: 0
Translator task size: 35561
Translator peak memory: 84148 KB
Writing output... [0.650s CPU, 0.706s wall-clock]
Done! [18.560s CPU, 18.610s wall-clock]
planner.py version 0.0.1
Time: 1.55s
Memory: 154MB
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.01s
Memory: 154MB (+0MB)
UNSAT
Iteration Time: 0.01s
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: 154MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.48s
Memory: 154MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.06s
Memory: 157MB (+3MB)
UNSAT
Iteration Time: 0.81s
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: 160.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.55s
Memory: 169MB (+12MB)
Unblocking actions...
Solving...
Solving Time: 0.06s
Memory: 187MB (+18MB)
UNSAT
Iteration Time: 0.89s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 217.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.49s
Memory: 198MB (+11MB)
Unblocking actions...
Solving...
Solving Time: 0.41s
Memory: 219MB (+21MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 1.23s
Memory: 218MB (+-1MB)
Answer: 1
occurs(action(("drive","t0","l1","l2","level215","level10","level225")),1) occurs(action(("load","p2","t0","l2")),2) occurs(action(("drive","t0","l2","l5","level193","level22","level215")),2) occurs(action(("load","p7","t0","l5")),3) occurs(action(("load","p8","t0","l5")),3) occurs(action(("drive","t0","l5","l2","level171","level22","level193")),3) occurs(action(("drive","t0","l2","l6","level152","level19","level171")),4) occurs(action(("load","p4","t0","l6")),5) occurs(action(("drive","t0","l6","l9","level139","level13","level152")),5) occurs(action(("unload","p7","t0","l9")),6) occurs(action(("unload","p8","t0","l9")),6) occurs(action(("drive","t0","l9","l10","level120","level19","level139")),6) occurs(action(("load","p5","t0","l9")),6) occurs(action(("load","p6","t0","l9")),6) occurs(action(("unload","p2","t0","l10")),7) occurs(action(("drive","t0","l10","l8","level118","level2","level120")),7) occurs(action(("unload","p4","t0","l8")),8) occurs(action(("unload","p5","t0","l8")),8) occurs(action(("load","p10","t0","l8")),8) occurs(action(("drive","t0","l8","l10","level116","level2","level118")),8) occurs(action(("load","p9","t0","l8")),8) occurs(action(("drive","t0","l10","l0","level98","level18","level116")),9) occurs(action(("drive","t0","l0","l4","level92","level6","level98")),10) occurs(action(("unload","p6","t0","l4")),11) occurs(action(("load","p0","t0","l4")),11) occurs(action(("drive","t0","l4","l3","level80","level12","level92")),11) occurs(action(("unload","p9","t0","l3")),12) occurs(action(("load","p1","t0","l3")),12) occurs(action(("load","p3","t0","l3")),12) occurs(action(("drive","t0","l3","l7","level78","level2","level80")),12) occurs(action(("unload","p10","t0","l7")),13) occurs(action(("unload","p3","t0","l7")),13) occurs(action(("drive","t0","l7","l4","level77","level1","level78")),13) occurs(action(("drive","t0","l4","l9","level62","level15","level77")),14) occurs(action(("unload","p0","t0","l9")),15) occurs(action(("unload","p1","t0","l9")),15) occurs(action(("drive","t0","l9","l6","level49","level13","level62")),15)
SATISFIABLE
Models : 1+
Calls : 4
Time : 4.542s (Solving: 0.42s 1st Model: 0.38s Unsat: 0.03s)
CPU Time : 4.428s
Choices : 1168 (Domain: 1165)
Conflicts : 508 (Analyzed: 506)
Restarts : 5 (Average: 101.20 Last: 51)
Model-Level : 137.0
Problems : 4 (Average Length: 9.50 Splits: 0)
Lemmas : 506 (Deleted: 0)
Binary : 8 (Ratio: 1.58%)
Ternary : 4 (Ratio: 0.79%)
Conflict : 506 (Average Length: 3660.4 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 506 (Average: 1.96 Max: 55 Sum: 990)
Executed : 497 (Average: 1.76 Max: 55 Sum: 889 Ratio: 89.80%)
Bounded : 9 (Average: 11.22 Max: 17 Sum: 101 Ratio: 10.20%)
Rules : 114139
Atoms : 114139
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 104560 (Eliminated: 0 Frozen: 5070)
Constraints : 521176 (Binary: 98.8% Ternary: 0.7% Other: 0.5%)
Memory Peak : 293MB
Max. Length : 15 steps
Sol. Length : 15 steps
Models : 1