143 lines
6.9 KiB
Plaintext
143 lines
6.9 KiB
Plaintext
INFO Running translator.
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-11.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/driverlog-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-11.pddl
|
|
Parsing...
|
|
Parsing: [0.020s CPU, 0.019s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.010s CPU, 0.006s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.010s CPU, 0.018s wall-clock]
|
|
Preparing model... [0.020s CPU, 0.015s wall-clock]
|
|
Generated 35 rules.
|
|
Computing model... [0.110s CPU, 0.109s wall-clock]
|
|
917 relevant atoms
|
|
608 auxiliary atoms
|
|
1525 final queue length
|
|
2071 total queue pushes
|
|
Completing instantiation... [0.110s CPU, 0.109s wall-clock]
|
|
Instantiating: [0.260s CPU, 0.260s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
11 initial candidates
|
|
Finding invariants: [0.020s CPU, 0.016s wall-clock]
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
|
Instantiating groups... [0.010s CPU, 0.012s wall-clock]
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
|
Choosing groups...
|
|
3 uncovered facts
|
|
Choosing groups: [0.010s CPU, 0.002s wall-clock]
|
|
Building translation key... [0.000s CPU, 0.001s wall-clock]
|
|
Computing fact groups: [0.040s CPU, 0.038s 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.006s wall-clock]
|
|
Translating task: [0.120s CPU, 0.117s wall-clock]
|
|
42 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
11 propositions removed
|
|
Detecting unreachable propositions: [0.060s CPU, 0.064s wall-clock]
|
|
Reordering and filtering variables...
|
|
13 of 14 variables necessary.
|
|
3 of 14 mutex groups necessary.
|
|
574 of 616 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.020s CPU, 0.017s wall-clock]
|
|
Translator variables: 13
|
|
Translator derived variables: 0
|
|
Translator facts: 119
|
|
Translator goal facts: 7
|
|
Translator mutex groups: 3
|
|
Translator total mutex groups size: 9
|
|
Translator operators: 574
|
|
Translator axioms: 0
|
|
Translator task size: 2482
|
|
Translator peak memory: 34904 KB
|
|
Writing output... [0.050s CPU, 0.054s wall-clock]
|
|
Done! [0.570s CPU, 0.579s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.39s
|
|
Memory: 64MB
|
|
|
|
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 (+0MB)
|
|
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.04s
|
|
Memory: 67MB (+3MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 68MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.06s
|
|
|
|
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
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
|
Grounding Time: 0.04s
|
|
Memory: 70MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("board-truck","driver2","truck1","s0")),1) occurs(action(("load-truck","package4","truck1","s0")),2) occurs(action(("drive-truck","truck1","s0","s2","driver2")),2) occurs(action(("walk","driver1","s6","p6-3")),2) occurs(action(("load-truck","package2","truck1","s2")),3) occurs(action(("unload-truck","package4","truck1","s2")),3) occurs(action(("walk","driver1","p6-3","s3")),3) occurs(action(("disembark-truck","driver2","truck1","s2")),3) occurs(action(("load-truck","package4","truck2","s2")),4) occurs(action(("board-truck","driver2","truck2","s2")),4) occurs(action(("unload-truck","package2","truck1","s2")),4) occurs(action(("load-truck","package2","truck2","s2")),5) occurs(action(("drive-truck","truck2","s2","s5","driver2")),5) occurs(action(("walk","driver1","s3","p2-3")),5) occurs(action(("load-truck","package5","truck2","s5")),6) occurs(action(("drive-truck","truck2","s5","s6","driver2")),6) occurs(action(("walk","driver1","p2-3","s2")),6) occurs(action(("unload-truck","package4","truck2","s6")),7) occurs(action(("drive-truck","truck2","s6","s3","driver2")),7) occurs(action(("board-truck","driver1","truck1","s2")),7) occurs(action(("unload-truck","package2","truck2","s3")),8) occurs(action(("load-truck","package3","truck2","s3")),8) occurs(action(("drive-truck","truck2","s3","s1","driver2")),8) occurs(action(("drive-truck","truck1","s2","s5","driver1")),8) occurs(action(("unload-truck","package5","truck2","s1")),9) occurs(action(("drive-truck","truck2","s1","s4","driver2")),9) occurs(action(("drive-truck","truck1","s5","s1","driver1")),9) occurs(action(("unload-truck","package3","truck2","s4")),10) occurs(action(("disembark-truck","driver2","truck2","s4")),10) occurs(action(("drive-truck","truck1","s1","s3","driver1")),10)
|
|
Solving Time: 0.01s
|
|
Memory: 72MB (+2MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 3
|
|
Time : 0.520s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
|
|
CPU Time : 0.520s
|
|
|
|
Choices : 843
|
|
Conflicts : 264 (Analyzed: 263)
|
|
Restarts : 2 (Average: 131.50 Last: 71)
|
|
Model-Level : 42.0
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
|
Lemmas : 324 (Deleted: 0)
|
|
Binary : 82 (Ratio: 25.31%)
|
|
Ternary : 14 (Ratio: 4.32%)
|
|
Conflict : 263 (Average Length: 25.4 Ratio: 81.17%)
|
|
Loop : 61 (Average Length: 2.0 Ratio: 18.83%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 263 (Average: 3.21 Max: 34 Sum: 844)
|
|
Executed : 260 (Average: 3.07 Max: 34 Sum: 808 Ratio: 95.73%)
|
|
Bounded : 3 (Average: 12.00 Max: 12 Sum: 36 Ratio: 4.27%)
|
|
|
|
Rules : 187717
|
|
Atoms : 187717
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 6993 (Eliminated: 0 Frozen: 3346)
|
|
Constraints : 23185 (Binary: 93.1% Ternary: 3.9% Other: 3.0%)
|
|
|
|
Memory Peak : 72MB
|
|
Max. Length : 10 steps
|
|
Sol. Length : 10 steps
|
|
|
|
|