136 lines
5.9 KiB
Plaintext
136 lines
5.9 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-4.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-4.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.020s CPU, 0.028s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.005s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.040s CPU, 0.047s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.018s wall-clock]
|
||
|
|
Generated 90 rules.
|
||
|
|
Computing model... [0.040s CPU, 0.040s wall-clock]
|
||
|
|
235 relevant atoms
|
||
|
|
324 auxiliary atoms
|
||
|
|
559 final queue length
|
||
|
|
679 total queue pushes
|
||
|
|
Completing instantiation... [0.030s CPU, 0.023s wall-clock]
|
||
|
|
Instantiating: [0.140s CPU, 0.135s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
35 initial candidates
|
||
|
|
Finding invariants: [0.020s CPU, 0.029s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating groups... [0.010s CPU, 0.002s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
31 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.030s CPU, 0.036s 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.010s CPU, 0.001s wall-clock]
|
||
|
|
Translating task: [0.030s CPU, 0.025s wall-clock]
|
||
|
|
30 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.013s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
13 of 36 variables necessary.
|
||
|
|
0 of 8 mutex groups necessary.
|
||
|
|
45 of 86 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.010s CPU, 0.005s wall-clock]
|
||
|
|
Translator variables: 13
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 29
|
||
|
|
Translator goal facts: 3
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 45
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 225
|
||
|
|
Translator peak memory: 36556 KB
|
||
|
|
Writing output... [0.000s CPU, 0.007s wall-clock]
|
||
|
|
Done! [0.240s CPU, 0.254s 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)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE
|
||
|
|
Testing Time: 0.01s
|
||
|
|
Memory: 50MB (+0MB)
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("sample_soil","rover0","rover0store","waypoint3")),1) occurs(action(("navigate","rover1","waypoint2","waypoint1")),1) occurs(action(("calibrate","rover1","camera0","objective0","waypoint2")),1) occurs(action(("communicate_soil_data","rover0","general","waypoint3","waypoint3","waypoint2")),2) occurs(action(("navigate","rover0","waypoint3","waypoint1")),2) occurs(action(("sample_rock","rover1","rover1store","waypoint1")),2) occurs(action(("take_image","rover1","waypoint1","objective0","camera0","high_res")),2) occurs(action(("drop","rover0","rover0store")),2) occurs(action(("communicate_rock_data","rover1","general","waypoint1","waypoint1","waypoint2")),3) occurs(action(("communicate_image_data","rover1","general","objective0","high_res","waypoint1","waypoint2")),3) occurs(action(("navigate","rover1","waypoint1","waypoint0")),3) occurs(action(("drop","rover1","rover1store")),3) occurs(action(("communicate_soil_data","rover0","general","waypoint3","waypoint1","waypoint2")),4) occurs(action(("calibrate","rover1","camera0","objective0","waypoint0")),5)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 2
|
||
|
|
Time : 0.037s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.032s
|
||
|
|
|
||
|
|
Choices : 34 (Domain: 29)
|
||
|
|
Conflicts : 1 (Analyzed: 1)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 33.0
|
||
|
|
Problems : 2 (Average Length: 4.50 Splits: 0)
|
||
|
|
Lemmas : 1 (Deleted: 0)
|
||
|
|
Binary : 0 (Ratio: 0.00%)
|
||
|
|
Ternary : 0 (Ratio: 0.00%)
|
||
|
|
Conflict : 1 (Average Length: 1.0 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 1 (Average: 15.00 Max: 15 Sum: 15)
|
||
|
|
Executed : 0 (Average: 8.00 Max: 8 Sum: 8 Ratio: 53.33%)
|
||
|
|
Bounded : 1 (Average: 7.00 Max: 7 Sum: 7 Ratio: 46.67%)
|
||
|
|
|
||
|
|
Rules : 753
|
||
|
|
Atoms : 753
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 377 (Eliminated: 0 Frozen: 0)
|
||
|
|
Constraints : 982 (Binary: 88.1% Ternary: 9.5% Other: 2.4%)
|
||
|
|
|
||
|
|
Memory Peak : 50MB
|
||
|
|
Max. Length : 5 steps
|
||
|
|
Sol. Length : 5 steps
|
||
|
|
Models : 1
|
||
|
|
|
||
|
|
|