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

178 lines
11 KiB
Plaintext
Raw Normal View History

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-14.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-14.pddl
Parsing...
Parsing: [0.020s CPU, 0.032s wall-clock]
Normalizing task... [0.010s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.036s wall-clock]
Preparing model... [0.020s CPU, 0.023s wall-clock]
Generated 51 rules.
Computing model... [2.090s CPU, 2.086s wall-clock]
18873 relevant atoms
6856 auxiliary atoms
25729 final queue length
64385 total queue pushes
Completing instantiation... [6.420s CPU, 6.413s wall-clock]
Instantiating: [8.600s CPU, 8.591s wall-clock]
Computing fact groups...
Finding invariants...
5 initial candidates
Finding invariants: [0.230s CPU, 0.231s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.010s CPU, 0.015s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
Choosing groups...
16 uncovered facts
Choosing groups: [0.010s CPU, 0.010s wall-clock]
Building translation key... [0.000s CPU, 0.004s wall-clock]
Computing fact groups: [0.270s CPU, 0.275s 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.005s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.260s CPU, 0.253s wall-clock]
Translating task: [5.340s CPU, 5.333s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
16 propositions removed
Detecting unreachable propositions: [2.640s CPU, 2.651s wall-clock]
Reordering and filtering variables...
32 of 32 variables necessary.
16 of 32 mutex groups necessary.
17280 of 17280 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.730s CPU, 0.724s wall-clock]
Translator variables: 32
Translator derived variables: 0
Translator facts: 288
Translator goal facts: 32
Translator mutex groups: 16
Translator total mutex groups size: 256
Translator operators: 17280
Translator axioms: 0
Translator task size: 88928
Translator peak memory: 99788 KB
Writing output... [1.620s CPU, 1.775s wall-clock]
Done! [19.470s CPU, 19.620s wall-clock]
planner.py version 0.0.1
Time: 3.76s
Memory: 297MB
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.02s
Memory: 297MB (+0MB)
UNSAT
Iteration Time: 0.02s
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: 297MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 1.25s
Memory: 297MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.16s
Memory: 304MB (+7MB)
UNSAT
Iteration Time: 2.17s
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: 311.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 1.48s
Memory: 353MB (+49MB)
Unblocking actions...
Solving...
Solving Time: 6.10s
Memory: 397MB (+44MB)
UNKNOWN
Iteration Time: 8.23s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 490.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 1.32s
Memory: 444MB (+47MB)
Unblocking actions...
Solving...
Solving Time: 6.99s
Memory: 510MB (+66MB)
UNKNOWN
Iteration Time: 8.98s
Iteration 5
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 15
Expected Memory: 623.0MB
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 1.68s
Memory: 560MB (+50MB)
Unblocking actions...
Solving...
Solving Time: 0.21s
Memory: 592MB (+32MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 2.85s
Memory: 669MB (+77MB)
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-3","seg-out-2","car-in-3","car-out-2")),1) occurs(action(("rotate-2","seg-in-8","seg-out-3","car-in-8","car-out-3")),1) occurs(action(("rotate-2","seg-in-7","seg-out-4","car-in-7","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-6","seg-out-6","car-in-6","car-out-6")),1) occurs(action(("rotate-2","seg-in-2","seg-out-8","car-in-2","car-out-8")),1) occurs(action(("analyze-2","seg-in-4","seg-out-1","car-in-4","car-in-1")),2) occurs(action(("rotate-2","seg-in-2","seg-out-2","car-out-8","car-in-3")),2) occurs(action(("rotate-2","seg-in-7","seg-out-5","car-out-4","car-in-5")),2) occurs(action(("rotate-2","seg-in-5","seg-out-6","car-out-5","car-in-6")),2) occurs(action(("rotate-2","seg-in-8","seg-out-4","car-out-3","car-in-7")),2) occurs(action(("rotate-2","seg-in-1","seg-out-7","car-out-1","car-out-7")),2) occurs(action(("analyze-2","seg-in-7","seg-out-1","car-in-5","car-in-4")),3) occurs(action(("rotate-2","seg-in-4","seg-out-8","car-in-1","car-in-2")),3) occurs(action(("rotate-2","seg-in-3","seg-out-4","car-out-2","car-out-3")),3) occurs(action(("rotate-2","seg-in-6","seg-out-5","car-out-6","car-out-4")),3) occurs(action(("rotate-2","seg-in-8","seg-out-3","car-in-7","car-in-8")),3) occurs(action(("analyze-2","seg-in-5","seg-out-1","car-in-6","car-in-5")),4) occurs(action(("rotate-2","seg-in-8","seg-out-5","car-in-8","car-out-6")),4) occurs(action(("rotate-2","seg-in-7","seg-out-2","car-in-4","car-out-8")),4) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-out-7","car-in-6")),5) occurs(action(("rotate-2","seg-in-5","seg-out-8","car-in-5","car-in-1")),5) occurs(action(("rotate-2","seg-in-8","seg-out-2","car-out-6","car-in-4")),5) occurs(action(("analyze-2","seg-in-2","seg-out-1","car-in-3","car-out-7")),6) occurs(action(("rotate-2","seg-in-8","seg-out-8","car-in-4","car-in-5")),6) occurs(action(("rotate-2","seg-in-1","seg-out-6","car-in-6","car-out-5")),6) occurs(action(("analyze-2","seg-in-7","seg-out-1","car-out-8","car-in-3")),7) occurs(action(("rotate-2","seg-in-5","seg-out-8","car-in-1","car-in-4")),7) occurs(action(("rotate-2","seg-in-8","seg-out-6","car-in-5","car-in-6")),7) occurs(action(("rotate-2","seg-in-2","seg-out-5","car-out-7","car-in-8")),7) occurs(action(("analyze-2","seg-in-3","seg-out-1","car-out-3","car-out-8")),8) occurs(action(("rotate-2","seg-in-7","seg-out-4","car-in-3","car-out-2")),8) occurs(action(("rotate-2","seg-in-8","seg-out-5","car-in-6","car-out-7")),8) occurs(action(("rotate-2","seg-in-5","seg-out-6","car-in-4","car-in-5")),8) occurs(action(("analyze-2","seg-in-6","seg-out-1","car-out-4","car-out-3")),9) occurs(action(("rotate-2","seg-in-5","seg-out-4","car-in-5","car-in-3")),9) occurs(action(("rotate-2","seg-in-3","seg-out-2","car-out-8","car-out-6")),9) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-out-5","car-out-4")),10) occurs(action(("rotate-2","seg-in-6","seg-out-3","car-out-3","car-in-7")),10) occurs(action(("rotate-2","seg-in-8","seg-out-2","car-out-7","car-out-8")),10) occurs(action(("analyze-2","seg-in-7","seg-out-1","car-out-2","car-out-5")),11) occurs(action(("rotate-2","seg-in-1","seg-out-7","car-out-4","car-out-1")),11) occurs(action(("rotate-2","seg-in-5","seg-out-3","car-in-3","car-out-3")),11) occurs(action(("analyze-2","seg-in-6","seg-out-1","car-in-7","car-out-2")),12) occurs(action(("rotate-2","seg-in-5","seg-out-7","car-out-3","car-out-4")),12) occurs(action(("analyze-2","seg-in-2","seg-out-1","car-in-8","car-in-7")),13) occurs(action(("rotate-2","seg-in-5","seg-out-3","car-out-4","car-in-3")),13) occurs(action(("rotate-2","seg-in-6","seg-out-5","car-out-2","car-in-6")),13) occurs(action(("analyze-2","seg-in-3","seg-out-1","car-out-6","car-in-8")),14) occurs(action(("rotate-2","seg-in-2","seg-out-3","car-in-7","car-out-4")),14) occurs(action(("rotate-2","seg-in-5","seg-out-4","car-in-3","car-in-5")),14) occurs(action(("analyze-2","seg-in-4","seg-out-1","car-in-2","car
SATISFIABLE
Models : 1+
Calls : 5
Time : 25.845s (Solving: 13.18s 1st Model: 0.11s Unsat: 0.07s)
CPU Time : 25.712s
Choices : 355290 (Domain: 355274)
Conflicts : 16661 (Analyzed: 16660)
Restarts : 203 (Average: 82.07 Last: 103)
Model-Level : 1292.0
Problems : 5 (Average Length: 12.00 Splits: 0)
Lemmas : 16660 (Deleted: 11754)
Binary : 61 (Ratio: 0.37%)
Ternary : 37 (Ratio: 0.22%)
Conflict : 16660 (Average Length: 718.2 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 16660 (Average: 19.00 Max: 579 Sum: 316502)
Executed : 16649 (Average: 19.00 Max: 579 Sum: 316491 Ratio: 100.00%)
Bounded : 11 (Average: 1.00 Max: 1 Sum: 11 Ratio: 0.00%)
Rules : 284098
Atoms : 284098
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 340004 (Eliminated: 0 Frozen: 5120)
Constraints : 2616952 (Binary: 99.6% Ternary: 0.2% Other: 0.2%)
Memory Peak : 754MB
Max. Length : 20 steps
Sol. Length : 20 steps
Models : 1