135 lines
6.4 KiB
Plaintext
135 lines
6.4 KiB
Plaintext
|
INFO Running translator.
|
||
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/zenotravel-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/zenotravel-strips-automatic/instances/instance-9.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-2002/domains/zenotravel-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/zenotravel-strips-automatic/instances/instance-9.pddl
|
||
|
Parsing...
|
||
|
Parsing: [0.020s CPU, 0.019s wall-clock]
|
||
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
Instantiating...
|
||
|
Generating Datalog program... [0.000s CPU, 0.005s wall-clock]
|
||
|
Normalizing Datalog program...
|
||
|
Normalizing Datalog program: [0.020s CPU, 0.024s wall-clock]
|
||
|
Preparing model... [0.020s CPU, 0.012s wall-clock]
|
||
|
Generated 40 rules.
|
||
|
Computing model... [0.160s CPU, 0.169s wall-clock]
|
||
|
1290 relevant atoms
|
||
|
670 auxiliary atoms
|
||
|
1960 final queue length
|
||
|
3831 total queue pushes
|
||
|
Completing instantiation... [0.320s CPU, 0.308s wall-clock]
|
||
|
Instantiating: [0.520s CPU, 0.521s wall-clock]
|
||
|
Computing fact groups...
|
||
|
Finding invariants...
|
||
|
9 initial candidates
|
||
|
Finding invariants: [0.030s CPU, 0.026s wall-clock]
|
||
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||
|
Instantiating groups... [0.000s CPU, 0.007s wall-clock]
|
||
|
Collecting mutex groups... [0.010s CPU, 0.001s wall-clock]
|
||
|
Choosing groups...
|
||
|
0 uncovered facts
|
||
|
Choosing groups: [0.000s CPU, 0.002s wall-clock]
|
||
|
Building translation key... [0.000s CPU, 0.001s wall-clock]
|
||
|
Computing fact groups: [0.040s CPU, 0.040s wall-clock]
|
||
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s 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.001s wall-clock]
|
||
|
Translating task...
|
||
|
Processing axioms...
|
||
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
Processing axioms: [0.020s CPU, 0.014s wall-clock]
|
||
|
Translating task: [0.270s CPU, 0.274s wall-clock]
|
||
|
0 effect conditions simplified
|
||
|
0 implied preconditions added
|
||
|
Detecting unreachable propositions...
|
||
|
0 operators removed
|
||
|
0 axioms removed
|
||
|
13 propositions removed
|
||
|
Detecting unreachable propositions: [0.140s CPU, 0.139s wall-clock]
|
||
|
Reordering and filtering variables...
|
||
|
13 of 13 variables necessary.
|
||
|
0 of 13 mutex groups necessary.
|
||
|
1125 of 1125 operators necessary.
|
||
|
0 of 0 axiom rules necessary.
|
||
|
Reordering and filtering variables: [0.040s CPU, 0.041s wall-clock]
|
||
|
Translator variables: 13
|
||
|
Translator derived variables: 0
|
||
|
Translator facts: 92
|
||
|
Translator goal facts: 7
|
||
|
Translator mutex groups: 0
|
||
|
Translator total mutex groups size: 0
|
||
|
Translator operators: 1125
|
||
|
Translator axioms: 0
|
||
|
Translator task size: 5272
|
||
|
Translator peak memory: 39884 KB
|
||
|
Writing output... [0.090s CPU, 0.107s wall-clock]
|
||
|
Done! [1.140s CPU, 1.158s wall-clock]
|
||
|
planner.py version 0.0.1
|
||
|
|
||
|
Time: 0.24s
|
||
|
Memory: 63MB
|
||
|
|
||
|
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: 64MB (+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
|
||
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
Grounding Time: 0.06s
|
||
|
Memory: 64MB (+0MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 0.00s
|
||
|
Memory: 64MB (+0MB)
|
||
|
SAT
|
||
|
Testing...
|
||
|
SERIALIZABLE
|
||
|
Testing Time: 0.17s
|
||
|
Memory: 73MB (+9MB)
|
||
|
Answer: 1
|
||
|
occurs(action(("board","person3","plane2","city2")),1) occurs(action(("fly","plane1","city2","city3","fl5","fl4")),1) occurs(action(("fly","plane2","city2","city4","fl2","fl1")),1) occurs(action(("refuel","plane3","city1","fl0","fl1")),1) occurs(action(("debark","person3","plane2","city4")),2) occurs(action(("board","person1","plane2","city4")),2) occurs(action(("fly","plane3","city1","city0","fl1","fl0")),2) occurs(action(("board","person6","plane1","city3")),2) occurs(action(("board","person7","plane1","city3")),2) occurs(action(("fly","plane1","city3","city4","fl4","fl3")),2) occurs(action(("fly","plane2","city4","city2","fl1","fl0")),2) occurs(action(("debark","person1","plane2","city2")),3) occurs(action(("debark","person6","plane1","city4")),3) occurs(action(("debark","person7","plane1","city4")),3) occurs(action(("board","person4","plane3","city0")),3) occurs(action(("board","person5","plane1","city4")),3) occurs(action(("fly","plane1","city4","city1","fl3","fl2")),3) occurs(action(("refuel","plane2","city2","fl0","fl1")),3) occurs(action(("refuel","plane3","city0","fl0","fl1")),3) occurs(action(("debark","person5","plane1","city1")),4) occurs(action(("board","person2","plane1","city1")),4) occurs(action(("fly","plane1","city1","city0","fl2","fl1")),4) occurs(action(("fly","plane3","city0","city3","fl1","fl0")),4) occurs(action(("debark","person2","plane1","city0")),5) occurs(action(("debark","person4","plane3","city3")),5) occurs(action(("fly","plane2","city2","city4","fl1","fl0")),5) occurs(action(("fly","plane1","city0","city2","fl1","fl0")),5)
|
||
|
SATISFIABLE
|
||
|
|
||
|
Models : 1+
|
||
|
Calls : 2
|
||
|
Time : 0.350s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
CPU Time : 0.332s
|
||
|
|
||
|
Choices : 169 (Domain: 142)
|
||
|
Conflicts : 11 (Analyzed: 11)
|
||
|
Restarts : 0
|
||
|
Model-Level : 66.0
|
||
|
Problems : 2 (Average Length: 4.50 Splits: 0)
|
||
|
Lemmas : 11 (Deleted: 0)
|
||
|
Binary : 0 (Ratio: 0.00%)
|
||
|
Ternary : 0 (Ratio: 0.00%)
|
||
|
Conflict : 11 (Average Length: 77.6 Ratio: 100.00%)
|
||
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
Backjumps : 11 (Average: 11.27 Max: 37 Sum: 124)
|
||
|
Executed : 9 (Average: 10.00 Max: 37 Sum: 110 Ratio: 88.71%)
|
||
|
Bounded : 2 (Average: 7.00 Max: 7 Sum: 14 Ratio: 11.29%)
|
||
|
|
||
|
Rules : 17046
|
||
|
Atoms : 17046
|
||
|
Bodies : 1 (Original: 0)
|
||
|
Tight : Yes
|
||
|
Variables : 5436 (Eliminated: 0 Frozen: 319)
|
||
|
Constraints : 22722 (Binary: 97.1% Ternary: 1.4% Other: 1.5%)
|
||
|
|
||
|
Memory Peak : 73MB
|
||
|
Max. Length : 5 steps
|
||
|
Sol. Length : 5 steps
|
||
|
Models : 1
|
||
|
|
||
|
|