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

178 lines
12 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-16.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-16.pddl
Parsing...
Parsing: [0.030s CPU, 0.032s wall-clock]
Normalizing task... [0.000s 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.033s wall-clock]
Preparing model... [0.020s CPU, 0.023s wall-clock]
Generated 51 rules.
Computing model... [3.100s CPU, 3.102s wall-clock]
29701 relevant atoms
8838 auxiliary atoms
38539 final queue length
99451 total queue pushes
Completing instantiation... [10.180s CPU, 10.171s wall-clock]
Instantiating: [13.380s CPU, 13.377s wall-clock]
Computing fact groups...
Finding invariants...
5 initial candidates
Finding invariants: [0.220s CPU, 0.220s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.020s CPU, 0.020s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.003s wall-clock]
Choosing groups...
18 uncovered facts
Choosing groups: [0.010s CPU, 0.013s wall-clock]
Building translation key... [0.000s CPU, 0.004s wall-clock]
Computing fact groups: [0.280s CPU, 0.277s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.005s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.007s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.410s CPU, 0.400s wall-clock]
Translating task: [8.150s CPU, 8.150s 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: [4.220s CPU, 4.209s wall-clock]
Reordering and filtering variables...
36 of 36 variables necessary.
18 of 36 mutex groups necessary.
27540 of 27540 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [1.160s CPU, 1.157s 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: 27540
Translator axioms: 0
Translator task size: 141210
Translator peak memory: 137660 KB
Writing output... [2.580s CPU, 2.827s wall-clock]
Done! [30.160s CPU, 30.402s wall-clock]
planner.py version 0.0.1
Time: 5.96s
Memory: 444MB
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.03s
Memory: 445MB (+1MB)
UNSAT
Iteration Time: 0.03s
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: 445MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 2.24s
Memory: 445MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.28s
Memory: 454MB (+9MB)
UNSAT
Iteration Time: 3.90s
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: 463.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 2.49s
Memory: 527MB (+73MB)
Unblocking actions...
Solving...
Solving Time: 8.27s
Memory: 605MB (+78MB)
UNKNOWN
Iteration Time: 11.77s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 756.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 2.16s
Memory: 658MB (+53MB)
Unblocking actions...
Solving...
Solving Time: 11.19s
Memory: 759MB (+101MB)
UNKNOWN
Iteration Time: 14.42s
Iteration 5
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 15
Expected Memory: 913.0MB
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 2.24s
Memory: 803MB (+44MB)
Unblocking actions...
Solving...
Solving Time: 0.27s
Memory: 850MB (+47MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 4.53s
Memory: 850MB (+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-6","seg-out-2","car-in-6","car-out-2")),1) occurs(action(("rotate-2","seg-in-3","seg-out-4","car-in-3","car-out-4")),1) occurs(action(("rotate-2","seg-in-8","seg-out-5","car-in-8","car-out-5")),1) occurs(action(("rotate-2","seg-in-2","seg-out-6","car-in-2","car-out-6")),1) occurs(action(("rotate-2","seg-in-7","seg-out-7","car-in-7","car-out-7")),1) occurs(action(("rotate-2","seg-in-9","seg-out-8","car-in-9","car-out-8")),1) occurs(action(("rotate-2","seg-in-5","seg-out-9","car-in-5","car-out-9")),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-6","car-out-9","car-in-2")),2) occurs(action(("rotate-2","seg-in-9","seg-out-9","car-out-8","car-in-5")),2) occurs(action(("rotate-2","seg-in-1","seg-out-2","car-out-1","car-in-6")),2) occurs(action(("rotate-2","seg-in-8","seg-out-7","car-out-5","car-in-7")),2) occurs(action(("rotate-2","seg-in-7","seg-out-3","car-out-7","car-out-3")),2) occurs(action(("analyze-2","seg-in-9","seg-out-1","car-in-5","car-in-4")),3) occurs(action(("rotate-2","seg-in-7","seg-out-2","car-out-3","car-out-1")),3) occurs(action(("rotate-2","seg-in-2","seg-out-7","car-out-6","car-out-5")),3) occurs(action(("rotate-2","seg-in-4","seg-out-3","car-in-1","car-out-7")),3) occurs(action(("rotate-2","seg-in-3","seg-out-6","car-out-4","car-out-9")),3) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-in-6","car-in-5")),4) occurs(action(("rotate-2","seg-in-6","seg-out-3","car-out-2","car-in-1")),4) occurs(action(("rotate-2","seg-in-9","seg-out-5","car-in-4","car-in-8")),4) occurs(action(("analyze-2","seg-in-8","seg-out-1","car-in-7","car-in-6")),5) occurs(action(("rotate-2","seg-in-3","seg-out-5","car-out-9","car-in-4")),5) occurs(action(("rotate-2","seg-in-1","seg-out-2","car-in-5","car-out-3")),5) occurs(action(("analyze-2","seg-in-9","seg-out-1","car-in-8","car-in-7")),6) occurs(action(("rotate-2","seg-in-7","seg-out-2","car-out-1","car-in-5")),6) occurs(action(("analyze-2","seg-in-2","seg-out-1","car-out-5","car-in-8")),7) occurs(action(("analyze-2","seg-in-4","seg-out-1","car-out-7","car-out-5")),8) occurs(action(("rotate-2","seg-in-2","seg-out-4","car-in-8","car-in-3")),8) occurs(action(("analyze-2","seg-in-2","seg-out-1","car-in-3","car-out-7")),9) occurs(action(("rotate-2","seg-in-7","seg-out-4","car-in-5","car-in-8")),9) occurs(action(("rotate-2","seg-in-4","seg-out-8","car-out-5","car-in-9")),9) occurs(action(("analyze-2","seg-in-4","seg-out-1","car-in-9","car-in-3")),10) occurs(action(("rotate-2","seg-in-6","seg-out-4","car-in-1","car-in-5")),10) occurs(action(("rotate-2","seg-in-2","seg-out-9","car-out-7","car-out-8")),10) occurs(action(("analyze-2","seg-in-2","seg-out-1","car-out-8","car-in-9")),11) occurs(action(("rotate-2","seg-in-3","seg-out-4","car-in-4","car-in-1")),11) occurs(action(("rotate-2","seg-in-6","seg-out-8","car-in-5","car-out-5")),11) occurs(action(("rotate-2","seg-in-4","seg-out-5","car-in-3","car-out-9")),11) occurs(action(("analyze-2","seg-in-5","seg-out-1","car-in-2","car-out-8")),12) occurs(action(("rotate-2","seg-in-2","seg-out-6","car-in-9","car-out-4")),12) occurs(action(("rotate-2","seg-in-3","seg-out-5","car-in-1","car-in-3")),12) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-out-3","car-in-2")),13) occurs(action(("rotate-2","seg-in-7","seg-out-5","car-in-8","car-in-1")),13) occurs(action(("rotate-2","seg-in-8","seg-out-6","car-in-6","car-in-9")),13) occurs(action(("rotate-2","seg-in-5","seg-out-7","car-out-8","car-out-6")),13) occurs(action(("analyze-2","seg-in-2","seg-out-1","car-out-4","car-out-3")),14) occurs(action(("rotate-2","seg-in-7","seg-out-6","car-in-1","car-in-6")),14) occurs(action(("rotate-2","seg-in-9","seg-out-5","car-in-7","car-in-8")),14) occurs(action(("rotate-2","seg-in-1","seg-out-3","car-in-2","car-out-2")),14) occurs(action(("analyze-2","seg-in-5","seg-out-1","car-out-6","car-out-4")),15) occurs(action(("rotate-2","seg-in-8","seg-out-6","car-in-9","car
SATISFIABLE
Models : 1+
Calls : 5
Time : 39.857s (Solving: 19.52s 1st Model: 0.12s Unsat: 0.09s)
CPU Time : 39.676s
Choices : 474109 (Domain: 474091)
Conflicts : 17401 (Analyzed: 17400)
Restarts : 202 (Average: 86.14 Last: 97)
Model-Level : 1558.0
Problems : 5 (Average Length: 12.00 Splits: 0)
Lemmas : 17400 (Deleted: 12789)
Binary : 82 (Ratio: 0.47%)
Ternary : 27 (Ratio: 0.16%)
Conflict : 17400 (Average Length: 538.4 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 17400 (Average: 24.07 Max: 634 Sum: 418830)
Executed : 17391 (Average: 24.07 Max: 634 Sum: 418821 Ratio: 100.00%)
Bounded : 9 (Average: 1.00 Max: 1 Sum: 9 Ratio: 0.00%)
Rules : 451208
Atoms : 451208
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 537812 (Eliminated: 0 Frozen: 6480)
Constraints : 4152982 (Binary: 99.7% Ternary: 0.2% Other: 0.2%)
Memory Peak : 1106MB
Max. Length : 20 steps
Sol. Length : 20 steps
Models : 1