146 lines
7.1 KiB
Plaintext
146 lines
7.1 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/rovers-propositional/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/rovers-propositional/instances/instance-12.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-2006/domains/rovers-propositional/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/rovers-propositional/instances/instance-12.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.040s CPU, 0.040s 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.040s CPU, 0.048s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.027s wall-clock]
|
||
|
|
Generated 90 rules.
|
||
|
|
Computing model... [0.200s CPU, 0.187s wall-clock]
|
||
|
|
698 relevant atoms
|
||
|
|
1895 auxiliary atoms
|
||
|
|
2593 final queue length
|
||
|
|
3226 total queue pushes
|
||
|
|
Completing instantiation... [0.100s CPU, 0.104s wall-clock]
|
||
|
|
Instantiating: [0.380s CPU, 0.379s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
35 initial candidates
|
||
|
|
Finding invariants: [0.040s CPU, 0.030s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating groups... [0.000s CPU, 0.005s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
48 uncovered facts
|
||
|
|
Choosing groups: [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Computing fact groups: [0.050s CPU, 0.046s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.010s CPU, 0.005s wall-clock]
|
||
|
|
Translating task: [0.100s CPU, 0.099s wall-clock]
|
||
|
|
106 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
27 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.050s CPU, 0.052s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
30 of 57 variables necessary.
|
||
|
|
0 of 14 mutex groups necessary.
|
||
|
|
259 of 366 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.020s CPU, 0.015s wall-clock]
|
||
|
|
Translator variables: 30
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 91
|
||
|
|
Translator goal facts: 6
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 259
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 1152
|
||
|
|
Translator peak memory: 37836 KB
|
||
|
|
Writing output... [0.030s CPU, 0.029s wall-clock]
|
||
|
|
Done! [0.670s CPU, 0.670s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.06s
|
||
|
|
Memory: 51MB
|
||
|
|
|
||
|
|
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.00s
|
||
|
|
Memory: 52MB (+1MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
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: 52MB
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.02s
|
||
|
|
Memory: 52MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 53MB (+1MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.04s
|
||
|
|
Memory: 54MB (+1MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 54MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 54MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action(("navigate","rover2","waypoint7","waypoint0")),1) occurs(action(("navigate","rover3","waypoint7","waypoint3")),1) occurs(action(("navigate","rover0","waypoint4","waypoint2")),1) occurs(action(("navigate","rover1","waypoint4","waypoint6")),1) occurs(action(("sample_rock","rover3","rover3store","waypoint3")),2) occurs(action(("sample_rock","rover1","rover1store","waypoint6")),2) occurs(action(("sample_soil","rover2","rover2store","waypoint0")),2) occurs(action(("calibrate","rover0","camera2","objective0","waypoint2")),2) occurs(action(("calibrate","rover2","camera1","objective1","waypoint0")),2) occurs(action(("calibrate","rover3","camera0","objective2","waypoint3")),2) occurs(action(("calibrate","rover3","camera3","objective3","waypoint3")),2) occurs(action(("communicate_rock_data","rover3","general","waypoint3","waypoint3","waypoint2")),3) occurs(action(("communicate_soil_data","rover2","general","waypoint0","waypoint0","waypoint2")),3) occurs(action(("navigate","rover0","waypoint2","waypoint3")),3) occurs(action(("take_image","rover3","waypoint3","objective3","camera3","low_res")),3) occurs(action(("take_image","rover2","waypoint0","objective1","camera1","high_res")),3) occurs(action(("take_image","rover3","waypoint3","objective1","camera0","high_res")),3) occurs(action(("navigate","rover1","waypoint6","waypoint4")),3) occurs(action(("communicate_image_data","rover3","general","objective3","low_res","waypoint3","waypoint2")),4) occurs(action(("communicate_rock_data","rover1","general","waypoint6","waypoint4","waypoint2")),4) occurs(action(("communicate_image_data","rover3","general","objective1","high_res","waypoint3","waypoint2")),4) occurs(action(("take_image","rover0","waypoint3","objective2","camera2","low_res")),4) occurs(action(("communicate_image_data","rover0","general","objective2","low_res","waypoint3","waypoint2")),5) occurs(action(("calibrate","rover2","camera1","objective1","waypoint0")),5) occurs(action(("calibrate","rover3","camera3","objective3","waypoint3")),5)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 0.093s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.084s
|
||
|
|
|
||
|
|
Choices : 231 (Domain: 132)
|
||
|
|
Conflicts : 21 (Analyzed: 21)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 55.5
|
||
|
|
Problems : 3 (Average Length: 5.33 Splits: 0)
|
||
|
|
Lemmas : 21 (Deleted: 0)
|
||
|
|
Binary : 4 (Ratio: 19.05%)
|
||
|
|
Ternary : 0 (Ratio: 0.00%)
|
||
|
|
Conflict : 21 (Average Length: 10.9 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 21 (Average: 7.38 Max: 26 Sum: 155)
|
||
|
|
Executed : 18 (Average: 6.38 Max: 26 Sum: 134 Ratio: 86.45%)
|
||
|
|
Bounded : 3 (Average: 7.00 Max: 7 Sum: 21 Ratio: 13.55%)
|
||
|
|
|
||
|
|
Rules : 5123 (Original: 5057)
|
||
|
|
Atoms : 4112
|
||
|
|
Bodies : 1141 (Original: 1074)
|
||
|
|
Count : 35 (Original: 45)
|
||
|
|
Equivalences : 480 (Atom=Atom: 12 Body=Body: 0 Other: 468)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 1691 (Eliminated: 0 Frozen: 597)
|
||
|
|
Constraints : 5721 (Binary: 89.5% Ternary: 6.6% Other: 3.8%)
|
||
|
|
|
||
|
|
Memory Peak : 54MB
|
||
|
|
Max. Length : 5 steps
|
||
|
|
Sol. Length : 5 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|