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

174 lines
10 KiB
Plaintext
Raw Permalink 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-10.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-10.pddl
Parsing...
Parsing: [0.020s CPU, 0.034s 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.037s wall-clock]
Preparing model... [0.020s CPU, 0.021s wall-clock]
Generated 51 rules.
Computing model... [1.320s CPU, 1.316s wall-clock]
11327 relevant atoms
5152 auxiliary atoms
16479 final queue length
39607 total queue pushes
Completing instantiation... [3.590s CPU, 3.594s wall-clock]
Instantiating: [4.990s CPU, 4.994s wall-clock]
Computing fact groups...
Finding invariants...
5 initial candidates
Finding invariants: [0.160s CPU, 0.162s wall-clock]
Checking invariant weight... [0.010s CPU, 0.001s wall-clock]
Instantiating groups... [0.010s CPU, 0.011s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
Choosing groups...
14 uncovered facts
Choosing groups: [0.010s CPU, 0.009s wall-clock]
Building translation key... [0.000s CPU, 0.003s wall-clock]
Computing fact groups: [0.200s CPU, 0.197s 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.010s CPU, 0.004s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.150s CPU, 0.151s wall-clock]
Translating task: [3.030s CPU, 3.024s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
14 propositions removed
Detecting unreachable propositions: [1.570s CPU, 1.569s wall-clock]
Reordering and filtering variables...
28 of 28 variables necessary.
14 of 28 mutex groups necessary.
10192 of 10192 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.440s CPU, 0.438s wall-clock]
Translator variables: 28
Translator derived variables: 0
Translator facts: 224
Translator goal facts: 28
Translator mutex groups: 14
Translator total mutex groups size: 196
Translator operators: 10192
Translator axioms: 0
Translator task size: 52710
Translator peak memory: 73932 KB
Writing output... [0.950s CPU, 1.046s wall-clock]
Done! [11.350s CPU, 11.445s wall-clock]
planner.py version 0.0.1
Time: 2.19s
Memory: 196MB
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.01s
Memory: 196MB (+0MB)
UNSAT
Iteration Time: 0.01s
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: 196MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.80s
Memory: 196MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.06s
Memory: 204MB (+8MB)
UNSAT
Iteration Time: 1.27s
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: 212.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.72s
Memory: 224MB (+20MB)
Unblocking actions...
Solving...
Solving Time: 3.19s
Memory: 249MB (+25MB)
UNKNOWN
Iteration Time: 4.27s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 294.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.93s
Memory: 293MB (+44MB)
Unblocking actions...
Solving...
Solving Time: 0.09s
Memory: 333MB (+40MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 2.58s
Memory: 416MB (+83MB)
Solving...
Solving Time: 0.22s
Memory: 398MB (+-18MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 398MB (+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-4","seg-out-2","car-in-4","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-6","seg-out-6","car-in-6","car-out-6")),1) occurs(action(("rotate-2","seg-in-7","seg-out-7","car-in-7","car-out-7")),1) occurs(action(("analyze-2","seg-in-5","seg-out-1","car-in-5","car-in-1")),2) occurs(action(("rotate-2","seg-in-7","seg-out-3","car-out-7","car-in-3")),2) occurs(action(("rotate-2","seg-in-1","seg-out-2","car-out-1","car-in-4")),2) occurs(action(("rotate-2","seg-in-2","seg-out-6","car-in-2","car-in-6")),2) occurs(action(("rotate-2","seg-in-6","seg-out-4","car-out-6","car-out-4")),2) occurs(action(("rotate-2","seg-in-4","seg-out-5","car-out-2","car-out-5")),2) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-in-4","car-in-5")),3) occurs(action(("rotate-2","seg-in-5","seg-out-7","car-in-1","car-in-7")),3) occurs(action(("rotate-2","seg-in-3","seg-out-2","car-out-3","car-out-1")),3) occurs(action(("rotate-2","seg-in-6","seg-out-5","car-out-4","car-out-2")),3) occurs(action(("rotate-2","seg-in-4","seg-out-3","car-out-5","car-out-7")),3) occurs(action(("analyze-2","seg-in-2","seg-out-1","car-in-6","car-in-4")),4) occurs(action(("rotate-2","seg-in-1","seg-out-6","car-in-5","car-in-2")),4) occurs(action(("rotate-2","seg-in-3","seg-out-3","car-out-1","car-out-5")),4) occurs(action(("analyze-2","seg-in-5","seg-out-1","car-in-7","car-in-6")),5) occurs(action(("rotate-2","seg-in-3","seg-out-5","car-out-5","car-out-4")),5) occurs(action(("rotate-2","seg-in-2","seg-out-4","car-in-4","car-out-6")),5) occurs(action(("analyze-2","seg-in-7","seg-out-1","car-in-3","car-in-7")),6) occurs(action(("rotate-2","seg-in-3","seg-out-6","car-out-4","car-in-5")),6) occurs(action(("rotate-2","seg-in-5","seg-out-3","car-in-6","car-out-1")),6) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-in-2","car-in-3")),7) occurs(action(("rotate-2","seg-in-5","seg-out-7","car-out-1","car-in-1")),7) occurs(action(("rotate-2","seg-in-3","seg-out-4","car-in-5","car-in-4")),7) occurs(action(("rotate-2","seg-in-7","seg-out-3","car-in-7","car-in-6")),7) occurs(action(("analyze-2","seg-in-4","seg-out-1","car-out-7","car-in-2")),8) occurs(action(("rotate-2","seg-in-3","seg-out-7","car-in-4","car-out-1")),8) occurs(action(("rotate-2","seg-in-1","seg-out-2","car-in-3","car-out-3")),8) occurs(action(("analyze-2","seg-in-6","seg-out-1","car-out-2","car-out-7")),9) occurs(action(("rotate-2","seg-in-7","seg-out-2","car-in-6","car-in-3")),9) occurs(action(("rotate-2","seg-in-4","seg-out-4","car-in-2","car-in-5")),9) occurs(action(("rotate-2","seg-in-3","seg-out-3","car-out-1","car-in-7")),9) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-out-3","car-out-2")),10) occurs(action(("rotate-2","seg-in-7","seg-out-5","car-in-3","car-out-5")),10) occurs(action(("rotate-2","seg-in-4","seg-out-7","car-in-5","car-in-4")),10) occurs(action(("rotate-2","seg-in-6","seg-out-2","car-out-7","car-in-6")),10) occurs(action(("analyze-2","seg-in-2","seg-out-1","car-out-6","car-out-3")),11) occurs(action(("rotate-2","seg-in-1","seg-out-2","car-out-2","car-out-7")),11) occurs(action(("rotate-2","seg-in-3","seg-out-5","car-in-7","car-in-3")),11) occurs(action(("analyze-2","seg-in-7","seg-out-1","car-out-5","car-out-6")),12) occurs(action(("rotate-2","seg-in-5","seg-out-5","car-in-1","car-in-7")),12) occurs(action(("rotate-2","seg-in-2","seg-out-3","car-out-3","car-out-1")),12) occurs(action(("rotate-2","seg-in-1","seg-out-6","car-out-7","car-out-4")),12) occurs(action(("analyze-2","seg-in-1","seg-out-1","car-out-4","car-out-5")),13) occurs(action(("rotate-2","seg-in-7","seg-out-6","car-out-6","car-out-7")),13) occurs(action(("rotate-2","seg-in-5","seg-out-7","car-in-7","car-in-5")),13) occurs(action(("analyze-2","seg-in-2","seg-out-1","car-out-1","car-out-4")),14) occurs(action(("rotate-2","seg-in-7","seg-out-7","car-out-7","car-in-7")),14) occurs(action(("rotate-2","seg-in-1","seg-out-5","car-out-5",
SATISFIABLE
Models : 1+
Calls : 5
Time : 10.317s (Solving: 3.28s 1st Model: 0.07s Unsat: 0.02s)
CPU Time : 10.248s
Choices : 80900 (Domain: 80886)
Conflicts : 7815 (Analyzed: 7814)
Restarts : 101 (Average: 77.37 Last: 70)
Model-Level : 561.5
Problems : 5 (Average Length: 11.00 Splits: 0)
Lemmas : 7814 (Deleted: 4418)
Binary : 41 (Ratio: 0.52%)
Ternary : 14 (Ratio: 0.18%)
Conflict : 7814 (Average Length: 547.4 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 7814 (Average: 9.50 Max: 158 Sum: 74214)
Executed : 7809 (Average: 9.50 Max: 158 Sum: 74209 Ratio: 99.99%)
Bounded : 5 (Average: 1.00 Max: 1 Sum: 5 Ratio: 0.01%)
Rules : 461223
Atoms : 189175
Bodies : 136460 (Original: 136459)
Count : 210
Equivalences : 136279 (Atom=Atom: 15 Body=Body: 0 Other: 136264)
Tight : Yes
Variables : 149917 (Eliminated: 0 Frozen: 139174)
Constraints : 1401934 (Binary: 99.5% Ternary: 0.2% Other: 0.3%)
Memory Peak : 416MB
Max. Length : 15 steps
Sol. Length : 15 steps
Models : 2