INFO Running translator. INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/scanalyzer-3d-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/scanalyzer-3d-sequential-satisficing/instances/instance-13.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/scanalyzer-3d-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/scanalyzer-3d-sequential-satisficing/instances/instance-13.pddl Parsing... Parsing: [0.030s CPU, 0.031s wall-clock] Normalizing task... [0.000s CPU, 0.003s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.008s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.040s CPU, 0.042s wall-clock] Preparing model... [0.020s CPU, 0.019s wall-clock] Generated 51 rules. Computing model... [0.480s CPU, 0.485s wall-clock] 3201 relevant atoms 2530 auxiliary atoms 5731 final queue length 12131 total queue pushes Completing instantiation... [0.970s CPU, 0.967s wall-clock] Instantiating: [1.540s CPU, 1.528s wall-clock] Computing fact groups... Finding invariants... 5 initial candidates Finding invariants: [0.150s CPU, 0.152s 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.001s wall-clock] Choosing groups... 10 uncovered facts Choosing groups: [0.000s CPU, 0.004s wall-clock] Building translation key... [0.010s CPU, 0.002s wall-clock] Computing fact groups: [0.170s CPU, 0.171s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s 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.040s CPU, 0.041s wall-clock] Translating task: [0.780s CPU, 0.781s 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.370s CPU, 0.377s wall-clock] Reordering and filtering variables... 20 of 20 variables necessary. 10 of 20 mutex groups necessary. 2700 of 2700 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.120s CPU, 0.119s wall-clock] Translator variables: 20 Translator derived variables: 0 Translator facts: 120 Translator goal facts: 20 Translator mutex groups: 10 Translator total mutex groups size: 100 Translator operators: 2700 Translator axioms: 0 Translator task size: 14210 Translator peak memory: 46540 KB Writing output... [0.270s CPU, 0.284s wall-clock] Done! [3.320s CPU, 3.335s wall-clock] planner.py version 0.0.1 Time: 0.59s Memory: 88MB 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: 88MB (+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: 88MB Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.17s Memory: 88MB (+0MB) Unblocking actions... Solving... Solving Time: 0.02s Memory: 91MB (+3MB) UNSAT Iteration Time: 0.28s 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: 94.0MB Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])] Grounding Time: 0.17s Memory: 96MB (+5MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 104MB (+8MB) SAT Testing... SERIALIZABLE Testing Time: 0.46s Memory: 104MB (+0MB) Answer: 1 occurs(action(("analyze-2","seg-in-1","seg-out-1","car-in-1","car-out-1")),1) occurs(action(("rotate-2","seg-in-5","seg-out-2","car-in-5","car-out-2")),1) occurs(action(("rotate-2","seg-in-3","seg-out-3","car-in-3","car-out-3")),1) occurs(action(("rotate-2","seg-in-2","seg-out-5","car-in-2","car-out-5")),1) occurs(action(("analyze-2","seg-in-4","seg-out-1","car-in-4","car-in-1")),2) occurs(action(("rotate-2","seg-in-5","seg-out-3","car-out-2","car-in-3")),2) occurs(action(("rotate-2","seg-in-1","seg-out-2","car-out-1","car-in-5")),2) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-in-5","car-in-4")),3) occurs(action(("rotate-2","seg-in-5","seg-out-2","car-in-3","car-out-1")),3) occurs(action(("analyze-2","seg-in-3","seg-out-1","car-out-3","car-in-5")),4) occurs(action(("rotate-2","seg-in-1","seg-out-3","car-in-4","car-out-2")),4) occurs(action(("analyze-2","seg-in-2","seg-out-1","car-out-5","car-out-3")),5) occurs(action(("rotate-2","seg-in-5","seg-out-3","car-out-1","car-in-4")),5) occurs(action(("rotate-2","seg-in-3","seg-out-4","car-in-5","car-out-4")),5) occurs(action(("analyze-2","seg-in-3","seg-out-1","car-out-4","car-out-5")),6) occurs(action(("rotate-2","seg-in-2","seg-out-2","car-out-3","car-in-3")),6) occurs(action(("rotate-2","seg-in-4","seg-out-3","car-in-1","car-out-1")),6) occurs(action(("rotate-2","seg-in-5","seg-out-4","car-in-4","car-in-5")),6) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-out-2","car-out-4")),7) occurs(action(("rotate-2","seg-in-3","seg-out-5","car-out-5","car-in-2")),7) occurs(action(("rotate-2","seg-in-4","seg-out-2","car-out-1","car-out-3")),7) occurs(action(("analyze-2","seg-in-3","seg-out-1","car-in-2","car-out-2")),8) occurs(action(("rotate-2","seg-in-4","seg-out-3","car-out-3","car-in-1")),8) occurs(action(("rotate-2","seg-in-1","seg-out-5","car-out-4","car-out-5")),8) occurs(action(("analyze-2","seg-in-2","seg-out-1","car-in-3","car-in-2")),9) occurs(action(("rotate-2","seg-in-3","seg-out-2","car-out-2","car-out-1")),9) occurs(action(("rotate-2","seg-in-4","seg-out-5","car-in-1","car-out-4")),9) occurs(action(("analyze-2","seg-in-3","seg-out-1","car-out-1","car-in-3")),10) occurs(action(("rotate-2","seg-in-1","seg-out-5","car-out-5","car-in-1")),10) occurs(action(("rotate-2","seg-in-4","seg-out-4","car-out-4","car-in-4")),10) SATISFIABLE Models : 1+ Calls : 3 Time : 1.176s (Solving: 0.02s 1st Model: 0.00s Unsat: 0.01s) CPU Time : 1.148s Choices : 620 (Domain: 610) Conflicts : 154 (Analyzed: 153) Restarts : 1 (Average: 153.00 Last: 67) Model-Level : 152.0 Problems : 3 (Average Length: 7.00 Splits: 0) Lemmas : 153 (Deleted: 0) Binary : 2 (Ratio: 1.31%) Ternary : 0 (Ratio: 0.00%) Conflict : 153 (Average Length: 106.8 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 153 (Average: 3.14 Max: 18 Sum: 480) Executed : 152 (Average: 3.13 Max: 18 Sum: 479 Ratio: 99.79%) Bounded : 1 (Average: 1.00 Max: 1 Sum: 1 Ratio: 0.21%) Rules : 45352 Atoms : 45352 Bodies : 1 (Original: 0) Tight : Yes Variables : 26742 (Eliminated: 0 Frozen: 1000) Constraints : 191290 (Binary: 98.8% Ternary: 0.5% Other: 0.7%) Memory Peak : 127MB Max. Length : 10 steps Sol. Length : 10 steps Models : 1