160 lines
6.7 KiB
Plaintext
160 lines
6.7 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-3.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-3.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.020s CPU, 0.023s wall-clock]
|
||
|
|
Normalizing task... [0.010s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.070s CPU, 0.072s wall-clock]
|
||
|
|
Preparing model... [0.030s CPU, 0.026s wall-clock]
|
||
|
|
Generated 90 rules.
|
||
|
|
Computing model... [0.050s CPU, 0.058s wall-clock]
|
||
|
|
212 relevant atoms
|
||
|
|
362 auxiliary atoms
|
||
|
|
574 final queue length
|
||
|
|
699 total queue pushes
|
||
|
|
Completing instantiation... [0.030s CPU, 0.027s wall-clock]
|
||
|
|
Instantiating: [0.190s CPU, 0.189s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
35 initial candidates
|
||
|
|
Finding invariants: [0.030s CPU, 0.034s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating groups... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
23 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.040s CPU, 0.042s 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.000s CPU, 0.001s wall-clock]
|
||
|
|
Translating task: [0.020s CPU, 0.024s wall-clock]
|
||
|
|
16 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
14 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.010s CPU, 0.012s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
13 of 28 variables necessary.
|
||
|
|
0 of 8 mutex groups necessary.
|
||
|
|
43 of 76 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.010s CPU, 0.004s wall-clock]
|
||
|
|
Translator variables: 13
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 31
|
||
|
|
Translator goal facts: 3
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 43
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 219
|
||
|
|
Translator peak memory: 36556 KB
|
||
|
|
Writing output... [0.000s CPU, 0.007s wall-clock]
|
||
|
|
Done! [0.300s CPU, 0.305s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.02s
|
||
|
|
Memory: 49MB
|
||
|
|
|
||
|
|
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: 50MB (+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: 50MB
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.01s
|
||
|
|
Memory: 50MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 50MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.01s
|
||
|
|
|
||
|
|
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: 50MB
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 0.01s
|
||
|
|
Memory: 50MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 51MB (+1MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.01s
|
||
|
|
Memory: 51MB (+0MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 51MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 51MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action(("navigate","rover1","waypoint3","waypoint2")),1) occurs(action(("navigate","rover0","waypoint1","waypoint0")),1) occurs(action(("sample_rock","rover0","rover0store","waypoint0")),2) occurs(action(("sample_soil","rover1","rover1store","waypoint2")),2) occurs(action(("communicate_soil_data","rover1","general","waypoint2","waypoint2","waypoint0")),3) occurs(action(("navigate","rover0","waypoint0","waypoint1")),3) occurs(action(("drop","rover0","rover0store")),3) occurs(action(("communicate_rock_data","rover0","general","waypoint0","waypoint1","waypoint0")),4) occurs(action(("navigate","rover1","waypoint2","waypoint3")),4) occurs(action(("sample_rock","rover0","rover0store","waypoint1")),4) occurs(action(("navigate","rover0","waypoint1","waypoint3")),5) occurs(action(("navigate","rover1","waypoint3","waypoint0")),5) occurs(action(("navigate","rover1","waypoint0","waypoint1")),6) occurs(action(("calibrate","rover1","camera1","objective0","waypoint1")),7) occurs(action(("take_image","rover1","waypoint1","objective0","camera1","colour")),8) occurs(action(("communicate_image_data","rover1","general","objective0","colour","waypoint1","waypoint0")),9) occurs(action(("calibrate","rover1","camera1","objective0","waypoint1")),10)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 4
|
||
|
|
Time : 0.049s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.052s
|
||
|
|
|
||
|
|
Choices : 354 (Domain: 267)
|
||
|
|
Conflicts : 45 (Analyzed: 44)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 74.5
|
||
|
|
Problems : 4 (Average Length: 8.25 Splits: 0)
|
||
|
|
Lemmas : 44 (Deleted: 0)
|
||
|
|
Binary : 21 (Ratio: 47.73%)
|
||
|
|
Ternary : 14 (Ratio: 31.82%)
|
||
|
|
Conflict : 44 (Average Length: 2.5 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 44 (Average: 6.32 Max: 47 Sum: 278)
|
||
|
|
Executed : 39 (Average: 5.20 Max: 35 Sum: 229 Ratio: 82.37%)
|
||
|
|
Bounded : 5 (Average: 9.80 Max: 12 Sum: 49 Ratio: 17.63%)
|
||
|
|
|
||
|
|
Rules : 1695 (Original: 1397)
|
||
|
|
Atoms : 935
|
||
|
|
Bodies : 877 (Original: 578)
|
||
|
|
Count : 0 (Original: 44)
|
||
|
|
Equivalences : 271 (Atom=Atom: 31 Body=Body: 0 Other: 240)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 1313 (Eliminated: 0 Frozen: 0)
|
||
|
|
Constraints : 4380 (Binary: 82.1% Ternary: 14.9% Other: 3.0%)
|
||
|
|
|
||
|
|
Memory Peak : 51MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|