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

206 lines
15 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-17.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-17.pddl
Parsing...
Parsing: [0.040s CPU, 0.034s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.009s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.033s wall-clock]
Preparing model... [0.030s CPU, 0.023s wall-clock]
Generated 51 rules.
Computing model... [2.810s CPU, 2.818s wall-clock]
27101 relevant atoms
8686 auxiliary atoms
35787 final queue length
88923 total queue pushes
Completing instantiation... [8.980s CPU, 8.978s wall-clock]
Instantiating: [11.890s CPU, 11.894s wall-clock]
Computing fact groups...
Finding invariants...
5 initial candidates
Finding invariants: [0.230s CPU, 0.227s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.020s CPU, 0.019s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.003s wall-clock]
Choosing groups...
18 uncovered facts
Choosing groups: [0.010s CPU, 0.012s wall-clock]
Building translation key... [0.010s CPU, 0.004s wall-clock]
Computing fact groups: [0.290s CPU, 0.282s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.005s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.007s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.360s CPU, 0.361s wall-clock]
Translating task: [7.590s CPU, 7.588s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
18 propositions removed
Detecting unreachable propositions: [3.790s CPU, 3.784s wall-clock]
Reordering and filtering variables...
36 of 36 variables necessary.
18 of 36 mutex groups necessary.
25092 of 25092 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [1.000s CPU, 1.008s wall-clock]
Translator variables: 36
Translator derived variables: 0
Translator facts: 360
Translator goal facts: 36
Translator mutex groups: 18
Translator total mutex groups size: 324
Translator operators: 25092
Translator axioms: 0
Translator task size: 126522
Translator peak memory: 126868 KB
Writing output... [2.310s CPU, 2.527s wall-clock]
Done! [27.250s CPU, 27.459s wall-clock]
planner.py version 0.0.1
Time: 5.33s
Memory: 403MB
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: 404MB (+1MB)
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: 404MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 2.00s
Memory: 404MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.16s
Memory: 412MB (+8MB)
UNSAT
Iteration Time: 3.38s
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: 420.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 1.87s
Memory: 452MB (+40MB)
Unblocking actions...
Solving...
Solving Time: 4.28s
Memory: 523MB (+71MB)
UNSAT
Iteration Time: 7.04s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 634.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 2.21s
Memory: 593MB (+70MB)
Unblocking actions...
Solving...
Solving Time: 11.26s
Memory: 692MB (+99MB)
UNKNOWN
Iteration Time: 14.41s
Iteration 5
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 15
Expected Memory: 861.0MB
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 1.90s
Memory: 729MB (+37MB)
Unblocking actions...
Solving...
Solving Time: 12.94s
Memory: 779MB (+50MB)
UNKNOWN
Iteration Time: 15.82s
Iteration 6
Queue: [(5,25,0,True), (6,30,0,True)]
Grounded Until: 20
Expected Memory: 948.0MB
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time: 2.01s
Memory: 838MB (+59MB)
Unblocking actions...
Solving...
Solving Time: 15.01s
Memory: 929MB (+91MB)
UNKNOWN
Iteration Time: 18.05s
Iteration 7
Queue: [(6,30,0,True)]
Grounded Until: 25
Expected Memory: 1098.0MB
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
Grounding Time: 2.68s
Memory: 1009MB (+80MB)
Unblocking actions...
Solving...
Solving Time: 0.36s
Memory: 1067MB (+58MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 4.10s
Memory: 1069MB (+2MB)
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-9","seg-out-2","car-in-9","car-out-2")),1) occurs(action(("rotate-2","seg-in-5","seg-out-3","car-in-5","car-out-3")),1) occurs(action(("rotate-2","seg-in-6","seg-out-4","car-in-6","car-out-4")),1) occurs(action(("rotate-2","seg-in-3","seg-out-5","car-in-3","car-out-5")),1) occurs(action(("rotate-2","seg-in-4","seg-out-6","car-in-4","car-out-6")),1) occurs(action(("rotate-2","seg-in-2","seg-out-9","car-in-2","car-out-9")),1) occurs(action(("rotate-2","seg-in-1","seg-out-6","car-out-1","car-in-4")),2) occurs(action(("rotate-2","seg-in-7","seg-out-1","car-in-7","car-in-1")),2) occurs(action(("rotate-2","seg-in-5","seg-out-2","car-out-3","car-in-9")),2) occurs(action(("rotate-2","seg-in-8","seg-out-5","car-in-8","car-in-3")),2) occurs(action(("rotate-2","seg-in-4","seg-out-7","car-out-6","car-out-7")),2) occurs(action(("rotate-2","seg-in-9","seg-out-8","car-out-2","car-out-8")),2) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-in-4","car-in-7")),3) occurs(action(("rotate-2","seg-in-4","seg-out-9","car-out-7","car-in-2")),3) occurs(action(("rotate-2","seg-in-7","seg-out-5","car-in-1","car-in-8")),3) occurs(action(("rotate-2","seg-in-2","seg-out-6","car-out-9","car-out-1")),3) occurs(action(("rotate-2","seg-in-1","seg-out-3","car-in-7","car-in-5")),4) occurs(action(("rotate-2","seg-in-2","seg-out-1","car-out-1","car-in-4")),4) occurs(action(("rotate-2","seg-in-7","seg-out-6","car-in-8","car-out-9")),4) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-in-5","car-out-1")),5) occurs(action(("rotate-2","seg-in-2","seg-out-3","car-in-4","car-in-7")),5) occurs(action(("rotate-2","seg-in-1","seg-out-4","car-out-1","car-in-6")),6) occurs(action(("rotate-2","seg-in-5","seg-out-1","car-in-9","car-in-5")),6) occurs(action(("rotate-2","seg-in-7","seg-out-3","car-out-9","car-in-4")),6) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-in-6","car-in-9")),7) occurs(action(("rotate-2","seg-in-7","seg-out-5","car-in-4","car-in-1")),7) occurs(action(("rotate-2","seg-in-5","seg-out-4","car-in-5","car-out-1")),7) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-in-9","car-in-6")),8) occurs(action(("rotate-2","seg-in-3","seg-out-4","car-out-5","car-in-5")),8) occurs(action(("rotate-2","seg-in-5","seg-out-9","car-out-1","car-out-7")),8) occurs(action(("rotate-2","seg-in-1","seg-out-2","car-in-6","car-out-3")),9) occurs(action(("rotate-2","seg-in-9","seg-out-1","car-out-8","car-in-9")),9) occurs(action(("rotate-2","seg-in-5","seg-out-3","car-out-7","car-out-9")),9) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-out-3","car-out-8")),10) occurs(action(("rotate-2","seg-in-6","seg-out-2","car-out-4","car-in-6")),10) occurs(action(("rotate-2","seg-in-5","seg-out-5","car-out-9","car-in-4")),10) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-out-8","car-out-3")),11) occurs(action(("rotate-2","seg-in-1","seg-out-7","car-out-3","car-out-6")),12) occurs(action(("rotate-2","seg-in-2","seg-out-1","car-in-7","car-out-8")),12) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-out-6","car-in-7")),13) occurs(action(("rotate-2","seg-in-2","seg-out-8","car-out-8","car-out-2")),13) occurs(action(("rotate-2","seg-in-5","seg-out-7","car-in-4","car-out-3")),13) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-in-7","car-out-6")),14) occurs(action(("rotate-2","seg-in-6","seg-out-7","car-in-6","car-in-4")),14) occurs(action(("rotate-2","seg-in-2","seg-out-9","car-out-2","car-out-1")),14) occurs(action(("rotate-2","seg-in-1","seg-out-2","car-out-6","car-out-4")),15) occurs(action(("rotate-2","seg-in-8","seg-out-1","car-in-3","car-in-7")),15) occurs(action(("rotate-2","seg-in-5","seg-out-7","car-out-3","car-in-6")),15) occurs(action(("rotate-2","seg-in-2","seg-out-8","car-out-1","car-out-8")),15) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-out-4","car-in-3")),16) occurs(action(("rotate-2","seg-in-5","seg-out-8","car-in-6","car-out-1")),16) occurs(action(("rotate-2","seg-in-4","seg-out-2","car-in-2","ca
SATISFIABLE
Models : 1+
Calls : 7
Time : 68.336s (Solving: 43.33s 1st Model: 0.17s Unsat: 4.22s)
CPU Time : 68.176s
Choices : 941842 (Domain: 941824)
Conflicts : 30532 (Analyzed: 30530)
Restarts : 356 (Average: 85.76 Last: 84)
Model-Level : 2590.0
Problems : 7 (Average Length: 17.00 Splits: 0)
Lemmas : 30530 (Deleted: 25157)
Binary : 529 (Ratio: 1.73%)
Ternary : 449 (Ratio: 1.47%)
Conflict : 30530 (Average Length: 438.0 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 30530 (Average: 24.68 Max: 1604 Sum: 753612)
Executed : 30495 (Average: 24.68 Max: 1604 Sum: 753503 Ratio: 99.99%)
Bounded : 35 (Average: 3.11 Max: 27 Sum: 109 Ratio: 0.01%)
Rules : 404696
Atoms : 404696
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 749598 (Eliminated: 0 Frozen: 9720)
Constraints : 5725746 (Binary: 99.6% Ternary: 0.2% Other: 0.2%)
Memory Peak : 1285MB
Max. Length : 30 steps
Sol. Length : 30 steps
Models : 1