146 lines
5.8 KiB
Plaintext
146 lines
5.8 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-2.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-2.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.030s CPU, 0.025s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.040s CPU, 0.040s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.015s wall-clock]
|
||
|
|
Generated 90 rules.
|
||
|
|
Computing model... [0.020s CPU, 0.026s wall-clock]
|
||
|
|
159 relevant atoms
|
||
|
|
224 auxiliary atoms
|
||
|
|
383 final queue length
|
||
|
|
464 total queue pushes
|
||
|
|
Completing instantiation... [0.020s CPU, 0.014s wall-clock]
|
||
|
|
Instantiating: [0.100s CPU, 0.101s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
35 initial candidates
|
||
|
|
Finding invariants: [0.030s CPU, 0.029s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating groups... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
18 uncovered facts
|
||
|
|
Choosing groups: [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Computing fact groups: [0.030s CPU, 0.034s 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.010s CPU, 0.015s wall-clock]
|
||
|
|
16 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
8 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.010s CPU, 0.009s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
9 of 20 variables necessary.
|
||
|
|
0 of 5 mutex groups necessary.
|
||
|
|
31 of 53 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.010s CPU, 0.003s wall-clock]
|
||
|
|
Translator variables: 9
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 20
|
||
|
|
Translator goal facts: 3
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 31
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 155
|
||
|
|
Translator peak memory: 36300 KB
|
||
|
|
Writing output... [0.000s CPU, 0.006s wall-clock]
|
||
|
|
Done! [0.190s CPU, 0.195s 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...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.01s
|
||
|
|
Memory: 50MB (+0MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 50MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 50MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action(("sample_rock","rover0","rover0store","waypoint0")),1) occurs(action(("calibrate","rover0","camera0","objective0","waypoint0")),1) occurs(action(("communicate_rock_data","rover0","general","waypoint0","waypoint0","waypoint1")),2) occurs(action(("take_image","rover0","waypoint0","objective1","camera0","low_res")),2) occurs(action(("drop","rover0","rover0store")),2) occurs(action(("communicate_image_data","rover0","general","objective1","low_res","waypoint0","waypoint1")),3) occurs(action(("sample_soil","rover0","rover0store","waypoint0")),3) occurs(action(("communicate_soil_data","rover0","general","waypoint0","waypoint0","waypoint1")),4) occurs(action(("calibrate","rover0","camera0","objective0","waypoint0")),5)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 0.042s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.032s
|
||
|
|
|
||
|
|
Choices : 55 (Domain: 32)
|
||
|
|
Conflicts : 4 (Analyzed: 4)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 29.0
|
||
|
|
Problems : 3 (Average Length: 5.33 Splits: 0)
|
||
|
|
Lemmas : 4 (Deleted: 0)
|
||
|
|
Binary : 2 (Ratio: 50.00%)
|
||
|
|
Ternary : 1 (Ratio: 25.00%)
|
||
|
|
Conflict : 4 (Average Length: 3.5 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 4 (Average: 2.75 Max: 4 Sum: 11)
|
||
|
|
Executed : 4 (Average: 2.75 Max: 4 Sum: 11 Ratio: 100.00%)
|
||
|
|
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
|
||
|
|
|
||
|
|
Rules : 809 (Original: 723)
|
||
|
|
Atoms : 578
|
||
|
|
Bodies : 267 (Original: 180)
|
||
|
|
Count : 0 (Original: 13)
|
||
|
|
Equivalences : 89 (Atom=Atom: 15 Body=Body: 0 Other: 74)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 398 (Eliminated: 0 Frozen: 0)
|
||
|
|
Constraints : 1317 (Binary: 83.9% Ternary: 11.9% Other: 4.2%)
|
||
|
|
|
||
|
|
Memory Peak : 50MB
|
||
|
|
Max. Length : 5 steps
|
||
|
|
Sol. Length : 5 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|