146 lines
6.7 KiB
Plaintext
146 lines
6.7 KiB
Plaintext
|
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-7.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-7.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.040s CPU, 0.035s 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.020s CPU, 0.024s wall-clock]
|
||
|
|
Generated 51 rules.
|
||
|
|
Computing model... [3.570s CPU, 3.565s wall-clock]
|
||
|
|
33265 relevant atoms
|
||
|
|
7808 auxiliary atoms
|
||
|
|
41073 final queue length
|
||
|
|
122737 total queue pushes
|
||
|
|
Completing instantiation... [11.700s CPU, 11.688s wall-clock]
|
||
|
|
Instantiating: [15.370s CPU, 15.358s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
5 initial candidates
|
||
|
|
Finding invariants: [0.230s CPU, 0.228s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating groups... [0.020s CPU, 0.016s 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.273s 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.470s CPU, 0.463s wall-clock]
|
||
|
|
Translating task: [9.930s CPU, 9.928s 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: [5.140s CPU, 5.139s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
32 of 32 variables necessary.
|
||
|
|
16 of 32 mutex groups necessary.
|
||
|
|
30720 of 30720 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [1.500s CPU, 1.491s 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: 30720
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 169568
|
||
|
|
Translator peak memory: 157340 KB
|
||
|
|
Writing output... [3.150s CPU, 3.415s wall-clock]
|
||
|
|
Done! [35.830s CPU, 36.081s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 7.17s
|
||
|
|
Memory: 524MB
|
||
|
|
|
||
|
|
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: 525MB (+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: 525MB
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 2.74s
|
||
|
|
Memory: 525MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.26s
|
||
|
|
Memory: 550MB (+25MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 6.47s
|
||
|
|
Memory: 803MB (+253MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.20s
|
||
|
|
Memory: 803MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 803MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action(("analyze-2","seg-in-1","seg-out-6","car-in-1","car-out-6")),1) occurs(action(("analyze-2","seg-in-2","seg-out-2","car-in-2","car-out-2")),1) occurs(action(("analyze-2","seg-in-3","seg-out-8","car-in-3","car-out-8")),1) occurs(action(("analyze-2","seg-in-4","seg-out-3","car-in-4","car-out-3")),1) occurs(action(("analyze-2","seg-in-5","seg-out-1","car-in-5","car-out-1")),1) occurs(action(("analyze-2","seg-in-6","seg-out-7","car-in-6","car-out-7")),1) occurs(action(("analyze-2","seg-in-7","seg-out-4","car-in-7","car-out-4")),1) occurs(action(("analyze-2","seg-in-8","seg-out-5","car-in-8","car-out-5")),1) occurs(action(("analyze-2","seg-in-5","seg-out-1","car-out-1","car-in-5")),2) occurs(action(("analyze-2","seg-in-2","seg-out-5","car-out-2","car-in-8")),2) occurs(action(("analyze-2","seg-in-4","seg-out-3","car-out-3","car-in-4")),2) occurs(action(("analyze-2","seg-in-7","seg-out-4","car-out-4","car-in-7")),2) occurs(action(("analyze-2","seg-in-8","seg-out-2","car-out-5","car-in-2")),2) occurs(action(("analyze-2","seg-in-1","seg-out-6","car-out-6","car-in-1")),2) occurs(action(("analyze-2","seg-in-6","seg-out-7","car-out-7","car-in-6")),2) occurs(action(("analyze-2","seg-in-3","seg-out-8","car-out-8","car-in-3")),2) occurs(action(("rotate-2","seg-in-2","seg-out-2","car-in-8","car-out-5")),3) occurs(action(("rotate-2","seg-in-2","seg-out-5","car-out-5","car-out-2")),4) occurs(action(("rotate-2","seg-in-8","seg-out-2","car-in-2","car-in-8")),4) occurs(action(("rotate-2","seg-in-2","seg-out-2","car-out-2","car-in-2")),5)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 13.375s (Solving: 0.11s 1st Model: 0.09s Unsat: 0.00s)
|
||
|
|
CPU Time : 13.160s
|
||
|
|
|
||
|
|
Choices : 453 (Domain: 426)
|
||
|
|
Conflicts : 16 (Analyzed: 16)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 218.0
|
||
|
|
Problems : 3 (Average Length: 5.33 Splits: 0)
|
||
|
|
Lemmas : 16 (Deleted: 0)
|
||
|
|
Binary : 0 (Ratio: 0.00%)
|
||
|
|
Ternary : 0 (Ratio: 0.00%)
|
||
|
|
Conflict : 16 (Average Length: 39464.4 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 16 (Average: 1.94 Max: 8 Sum: 31)
|
||
|
|
Executed : 16 (Average: 1.94 Max: 8 Sum: 31 Ratio: 100.00%)
|
||
|
|
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
|
||
|
|
|
||
|
|
Rules : 805869
|
||
|
|
Atoms : 601069
|
||
|
|
Bodies : 102566 (Original: 102565)
|
||
|
|
Count : 80
|
||
|
|
Equivalences : 102495 (Atom=Atom: 5 Body=Body: 0 Other: 102490)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 125931 (Eliminated: 0 Frozen: 103760)
|
||
|
|
Constraints : 1129122 (Binary: 99.8% Ternary: 0.1% Other: 0.1%)
|
||
|
|
|
||
|
|
Memory Peak : 803MB
|
||
|
|
Max. Length : 5 steps
|
||
|
|
Sol. Length : 5 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|