tplp-planning-benchmark/gc-ta1-tt1/ipc-2011_scanalyzer-3d-sequential-satisficing_12.out

174 lines
9.8 KiB
Plaintext

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-12.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-12.pddl
Parsing...
Parsing: [0.030s CPU, 0.028s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.035s wall-clock]
Preparing model... [0.020s CPU, 0.018s wall-clock]
Generated 51 rules.
Computing model... [0.800s CPU, 0.801s wall-clock]
6319 relevant atoms
3714 auxiliary atoms
10033 final queue length
22849 total queue pushes
Completing instantiation... [1.970s CPU, 1.969s wall-clock]
Instantiating: [2.840s CPU, 2.840s wall-clock]
Computing fact groups...
Finding invariants...
5 initial candidates
Finding invariants: [0.150s CPU, 0.145s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.010s CPU, 0.008s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
12 uncovered facts
Choosing groups: [0.010s CPU, 0.006s wall-clock]
Building translation key... [0.000s 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.010s CPU, 0.003s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.003s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.080s CPU, 0.083s wall-clock]
Translating task: [1.590s CPU, 1.591s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
12 propositions removed
Detecting unreachable propositions: [0.860s CPU, 0.865s wall-clock]
Reordering and filtering variables...
24 of 24 variables necessary.
12 of 24 mutex groups necessary.
5544 of 5544 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.240s CPU, 0.239s wall-clock]
Translator variables: 24
Translator derived variables: 0
Translator facts: 168
Translator goal facts: 24
Translator mutex groups: 12
Translator total mutex groups size: 144
Translator operators: 5544
Translator axioms: 0
Translator task size: 28872
Translator peak memory: 57036 KB
Writing output... [0.530s CPU, 0.572s wall-clock]
Done! [6.340s CPU, 6.389s wall-clock]
planner.py version 0.0.1
Time: 1.19s
Memory: 129MB
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: 129MB (+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: 129MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.39s
Memory: 129MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.03s
Memory: 131MB (+2MB)
UNSAT
Iteration Time: 0.63s
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: 133.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.38s
Memory: 145MB (+14MB)
Unblocking actions...
Solving...
Solving Time: 2.22s
Memory: 161MB (+16MB)
UNKNOWN
Iteration Time: 2.79s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 191.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.57s
Memory: 182MB (+21MB)
Unblocking actions...
Solving...
Solving Time: 0.05s
Memory: 203MB (+21MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 1.35s
Memory: 249MB (+46MB)
Solving...
Solving Time: 0.11s
Memory: 239MB (+-10MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 239MB (+0MB)
Answer: 2
occurs(action(("analyze-2","seg-in-1","seg-out-1","car-in-1","car-out-1")),1) occurs(action(("rotate-2","seg-in-2","seg-out-4","car-in-2","car-out-4")),1) occurs(action(("rotate-2","seg-in-5","seg-out-5","car-in-5","car-out-5")),1) occurs(action(("rotate-2","seg-in-3","seg-out-6","car-in-3","car-out-6")),1) occurs(action(("analyze-2","seg-in-4","seg-out-1","car-in-4","car-in-1")),2) occurs(action(("rotate-2","seg-in-3","seg-out-4","car-out-6","car-in-2")),2) occurs(action(("rotate-2","seg-in-6","seg-out-5","car-in-6","car-in-5")),2) occurs(action(("rotate-2","seg-in-5","seg-out-2","car-out-5","car-out-2")),2) occurs(action(("rotate-2","seg-in-2","seg-out-3","car-out-4","car-out-3")),2) occurs(action(("analyze-2","seg-in-6","seg-out-1","car-in-5","car-in-4")),3) occurs(action(("rotate-2","seg-in-4","seg-out-5","car-in-1","car-in-6")),3) occurs(action(("rotate-2","seg-in-1","seg-out-2","car-out-1","car-out-5")),3) occurs(action(("rotate-2","seg-in-2","seg-out-4","car-out-3","car-out-6")),3) occurs(action(("analyze-2","seg-in-4","seg-out-1","car-in-6","car-in-5")),4) occurs(action(("rotate-2","seg-in-6","seg-out-6","car-in-4","car-in-3")),4) occurs(action(("rotate-2","seg-in-1","seg-out-5","car-out-5","car-in-1")),4) occurs(action(("analyze-2","seg-in-3","seg-out-1","car-in-2","car-in-6")),5) occurs(action(("rotate-2","seg-in-1","seg-out-6","car-in-1","car-in-4")),5) occurs(action(("rotate-2","seg-in-4","seg-out-4","car-in-5","car-out-3")),5) occurs(action(("analyze-2","seg-in-5","seg-out-1","car-out-2","car-in-2")),6) occurs(action(("rotate-2","seg-in-3","seg-out-3","car-in-6","car-out-4")),6) occurs(action(("rotate-2","seg-in-1","seg-out-5","car-in-4","car-out-5")),6) occurs(action(("analyze-2","seg-in-3","seg-out-1","car-out-4","car-out-2")),7) occurs(action(("rotate-2","seg-in-5","seg-out-5","car-in-2","car-in-4")),7) occurs(action(("rotate-2","seg-in-1","seg-out-6","car-out-5","car-in-1")),7) occurs(action(("analyze-2","seg-in-4","seg-out-1","car-out-3","car-out-4")),8) occurs(action(("rotate-2","seg-in-1","seg-out-4","car-in-1","car-in-5")),8) occurs(action(("rotate-2","seg-in-5","seg-out-3","car-in-4","car-in-6")),8) occurs(action(("rotate-2","seg-in-3","seg-out-2","car-out-2","car-out-1")),8) occurs(action(("analyze-2","seg-in-2","seg-out-1","car-out-6","car-out-3")),9) occurs(action(("rotate-2","seg-in-5","seg-out-4","car-in-6","car-in-1")),9) occurs(action(("rotate-2","seg-in-3","seg-out-3","car-out-1","car-in-4")),9) occurs(action(("rotate-2","seg-in-4","seg-out-6","car-out-4","car-out-5")),9) occurs(action(("analyze-2","seg-in-6","seg-out-1","car-in-3","car-out-6")),10) occurs(action(("rotate-2","seg-in-3","seg-out-4","car-in-4","car-in-6")),10) occurs(action(("rotate-2","seg-in-1","seg-out-3","car-in-5","car-out-1")),10) occurs(action(("rotate-2","seg-in-2","seg-out-5","car-out-3","car-in-2")),10) occurs(action(("analyze-2","seg-in-4","seg-out-1","car-out-5","car-in-3")),11) occurs(action(("rotate-2","seg-in-5","seg-out-4","car-in-1","car-in-4")),11) occurs(action(("rotate-2","seg-in-3","seg-out-5","car-in-6","car-out-3")),11) occurs(action(("rotate-2","seg-in-6","seg-out-6","car-out-6","car-out-4")),11) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-out-1","car-out-5")),12) occurs(action(("rotate-2","seg-in-4","seg-out-3","car-in-3","car-in-5")),12) occurs(action(("rotate-2","seg-in-5","seg-out-5","car-in-4","car-in-6")),12) occurs(action(("rotate-2","seg-in-1","seg-out-4","car-out-5","car-in-1")),13) occurs(action(("rotate-2","seg-in-3","seg-out-3","car-out-3","car-in-3")),13) occurs(action(("rotate-2","seg-in-4","seg-out-5","car-in-5","car-in-4")),13) occurs(action(("rotate-2","seg-in-6","seg-out-4","car-out-4","car-out-5")),14) occurs(action(("rotate-2","seg-in-5","seg-out-5","car-in-6","car-in-5")),14) occurs(action(("rotate-2","seg-in-6","seg-out-5","car-out-5","car-in-6")),15)
SATISFIABLE
Models : 1+
Calls : 5
Time : 6.019s (Solving: 2.27s 1st Model: 0.04s Unsat: 0.02s)
CPU Time : 5.972s
Choices : 73085 (Domain: 73073)
Conflicts : 8582 (Analyzed: 8581)
Restarts : 102 (Average: 84.13 Last: 95)
Model-Level : 437.5
Problems : 5 (Average Length: 11.00 Splits: 0)
Lemmas : 8581 (Deleted: 4332)
Binary : 63 (Ratio: 0.73%)
Ternary : 21 (Ratio: 0.24%)
Conflict : 8581 (Average Length: 240.1 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 8581 (Average: 7.98 Max: 155 Sum: 68501)
Executed : 8575 (Average: 7.98 Max: 155 Sum: 68495 Ratio: 99.99%)
Bounded : 6 (Average: 1.00 Max: 1 Sum: 6 Ratio: 0.01%)
Rules : 251901 (Original: 251831)
Atoms : 103655
Bodies : 74534 (Original: 74463)
Count : 175 (Original: 180)
Equivalences : 74308 (Atom=Atom: 15 Body=Body: 0 Other: 74293)
Tight : Yes
Variables : 83190 (Eliminated: 0 Frozen: 76423)
Constraints : 768282 (Binary: 99.3% Ternary: 0.3% Other: 0.4%)
Memory Peak : 249MB
Max. Length : 15 steps
Sol. Length : 15 steps
Models : 2