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

160 lines
7.9 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-6.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-6.pddl
Parsing...
Parsing: [0.030s CPU, 0.024s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.005s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.037s wall-clock]
Preparing model... [0.020s CPU, 0.014s wall-clock]
Generated 51 rules.
Computing model... [4.160s CPU, 4.161s wall-clock]
24703 relevant atoms
4912 auxiliary atoms
29615 final queue length
136047 total queue pushes
Completing instantiation... [15.570s CPU, 15.563s wall-clock]
Instantiating: [19.820s CPU, 19.812s wall-clock]
Computing fact groups...
Finding invariants...
5 initial candidates
Finding invariants: [0.410s CPU, 0.408s wall-clock]
Checking invariant weight... [0.000s CPU, 0.000s wall-clock]
Instantiating groups... [0.000s CPU, 0.002s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
8 uncovered facts
Choosing groups: [0.000s CPU, 0.001s wall-clock]
Building translation key... [0.000s CPU, 0.001s wall-clock]
Computing fact groups: [0.410s CPU, 0.416s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.000s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.600s CPU, 0.595s wall-clock]
Translating task: [11.290s CPU, 11.275s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
8 propositions removed
Detecting unreachable propositions: [5.560s CPU, 5.567s wall-clock]
Reordering and filtering variables...
16 of 16 variables necessary.
0 of 8 mutex groups necessary.
24544 of 24544 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [2.210s CPU, 2.203s wall-clock]
Translator variables: 16
Translator derived variables: 0
Translator facts: 80
Translator goal facts: 16
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 24544
Translator axioms: 0
Translator task size: 217040
Translator peak memory: 178068 KB
Writing output... [3.340s CPU, 3.669s wall-clock]
Done! [43.150s CPU, 43.467s wall-clock]
planner.py version 0.0.1
Time: 10.76s
Memory: 712MB
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.04s
Memory: 712MB (+0MB)
UNSAT
Iteration Time: 0.04s
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: 712MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 3.42s
Memory: 712MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.55s
Memory: 720MB (+8MB)
UNSAT
Iteration Time: 5.72s
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: 728.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 2.97s
Memory: 720MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 2.99s
Memory: 766MB (+46MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 11.36s
Memory: 1208MB (+442MB)
Solving...
Solving Time: 1.89s
Memory: 1186MB (+-22MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 1186MB (+0MB)
Answer: 2
occurs(action(("analyze-4","seg-in-1a","seg-in-1b","seg-out-1a","seg-out-1b","car-in-1a","car-in-1b","car-out-1a","car-out-1b")),1) occurs(action(("rotate-4","seg-in-2a","seg-in-2b","seg-out-2a","seg-out-2b","car-in-2a","car-in-2b","car-out-2a","car-out-2b")),1) occurs(action(("analyze-4","seg-in-2a","seg-in-2b","seg-out-1a","seg-out-1b","car-in-2b","car-out-2a","car-out-1b","car-in-1a")),2) occurs(action(("rotate-4","seg-in-1a","seg-in-1b","seg-out-2a","seg-out-2b","car-in-1b","car-out-1a","car-out-2b","car-in-2a")),2) occurs(action(("analyze-4","seg-in-2a","seg-in-2b","seg-out-1a","seg-out-1b","car-out-2a","car-out-1b","car-in-1a","car-in-2b")),3) occurs(action(("rotate-4","seg-in-1a","seg-in-1b","seg-out-2a","seg-out-2b","car-out-1a","car-out-2b","car-in-2a","car-in-1b")),3) occurs(action(("analyze-4","seg-in-1a","seg-in-1b","seg-out-1a","seg-out-1b","car-out-2b","car-in-2a","car-in-2b","car-out-2a")),4) occurs(action(("rotate-4","seg-in-2a","seg-in-2b","seg-out-2a","seg-out-2b","car-out-1b","car-in-1a","car-in-1b","car-out-1a")),4) occurs(action(("analyze-4","seg-in-1a","seg-in-1b","seg-out-1a","seg-out-1b","car-in-2a","car-in-2b","car-out-2a","car-out-2b")),5) occurs(action(("rotate-4","seg-in-2a","seg-in-2b","seg-out-2a","seg-out-2b","car-in-1a","car-in-1b","car-out-1a","car-out-1b")),5) occurs(action(("analyze-4","seg-in-2a","seg-in-2b","seg-out-1a","seg-out-1b","car-in-1b","car-out-1a","car-out-2b","car-in-2a")),6) occurs(action(("rotate-4","seg-in-1a","seg-in-1b","seg-out-2a","seg-out-2b","car-in-2b","car-out-2a","car-out-1b","car-in-1a")),6) occurs(action(("analyze-4","seg-in-2a","seg-in-2b","seg-out-1a","seg-out-1b","car-out-1a","car-out-2b","car-in-2a","car-in-1b")),7) occurs(action(("rotate-4","seg-in-1a","seg-in-1b","seg-out-2a","seg-out-2b","car-out-2a","car-out-1b","car-in-1a","car-in-2b")),7) occurs(action(("analyze-4","seg-in-1a","seg-in-1b","seg-out-1a","seg-out-1b","car-out-1b","car-in-1a","car-in-1b","car-out-1a")),8) occurs(action(("rotate-4","seg-in-2a","seg-in-2b","seg-out-2a","seg-out-2b","car-out-2b","car-in-2a","car-in-2b","car-out-2a")),8) occurs(action(("analyze-4","seg-in-1a","seg-in-1b","seg-out-1a","seg-out-1b","car-in-1a","car-in-1b","car-out-1a","car-out-1b")),9) occurs(action(("rotate-4","seg-in-2a","seg-in-2b","seg-out-2a","seg-out-2b","car-in-2a","car-in-2b","car-out-2a","car-out-2b")),10)
SATISFIABLE
Models : 1+
Calls : 4
Time : 29.429s (Solving: 4.45s 1st Model: 4.40s Unsat: 0.01s)
CPU Time : 28.672s
Choices : 6965 (Domain: 6954)
Conflicts : 2369 (Analyzed: 2368)
Restarts : 23 (Average: 102.96 Last: 25)
Model-Level : 62.0
Problems : 4 (Average Length: 8.25 Splits: 0)
Lemmas : 2368 (Deleted: 1002)
Binary : 14 (Ratio: 0.59%)
Ternary : 4 (Ratio: 0.17%)
Conflict : 2368 (Average Length: 7111.9 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 2368 (Average: 2.77 Max: 43 Sum: 6551)
Executed : 2364 (Average: 2.76 Max: 43 Sum: 6547 Ratio: 99.94%)
Bounded : 4 (Average: 1.00 Max: 1 Sum: 4 Ratio: 0.06%)
Rules : 1331672 (Original: 1331654)
Atoms : 712846
Bodies : 231712 (Original: 231707)
Count : 72 (Original: 78)
Equivalences : 154707 (Atom=Atom: 11 Body=Body: 0 Other: 154696)
Tight : Yes
Variables : 222701 (Eliminated: 0 Frozen: 155256)
Constraints : 2735885 (Binary: 99.9% Ternary: 0.0% Other: 0.0%)
Memory Peak : 1295MB
Max. Length : 10 steps
Sol. Length : 10 steps
Models : 2