130 lines
6.2 KiB
Plaintext
130 lines
6.2 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.028s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.010s CPU, 0.020s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.019s wall-clock]
|
||
|
|
Generated 35 rules.
|
||
|
|
Computing model... [0.130s CPU, 0.127s wall-clock]
|
||
|
|
917 relevant atoms
|
||
|
|
608 auxiliary atoms
|
||
|
|
1525 final queue length
|
||
|
|
2071 total queue pushes
|
||
|
|
Completing instantiation... [0.110s CPU, 0.110s wall-clock]
|
||
|
|
Instantiating: [0.280s CPU, 0.285s 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.000s CPU, 0.002s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Computing fact groups: [0.040s CPU, 0.039s 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.115s 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.065s 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.051s wall-clock]
|
||
|
|
Done! [0.600s CPU, 0.611s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.29s
|
||
|
|
Memory: 62MB
|
||
|
|
|
||
|
|
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: 62MB (+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.53s
|
||
|
|
Memory: 122MB (+60MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("load-truck","package2","truck1","s2")),1) occurs(action(("load-truck","package4","truck1","s0")),1) occurs(action(("board-truck","driver2","truck1","s0")),1) occurs(action(("drive-truck","truck1","s0","s2","driver2")),1) occurs(action(("walk","driver1","s6","p2-6")),1) occurs(action(("unload-truck","package4","truck1","s6")),2) occurs(action(("drive-truck","truck1","s2","s6","driver2")),2) occurs(action(("unload-truck","package2","truck1","s6")),2) occurs(action(("walk","driver1","p2-6","s2")),2) occurs(action(("disembark-truck","driver2","truck1","s6")),2) occurs(action(("load-truck","package2","truck1","s6")),3) occurs(action(("drive-truck","truck1","s6","s3","driver2")),3) occurs(action(("load-truck","package3","truck1","s3")),3) occurs(action(("load-truck","package5","truck2","s5")),3) occurs(action(("board-truck","driver2","truck1","s6")),3) occurs(action(("board-truck","driver1","truck2","s2")),3) occurs(action(("drive-truck","truck2","s2","s5","driver1")),3) occurs(action(("unload-truck","package2","truck1","s3")),4) occurs(action(("unload-truck","package5","truck2","s1")),4) occurs(action(("drive-truck","truck1","s3","s1","driver2")),4) occurs(action(("drive-truck","truck2","s5","s1","driver1")),4) occurs(action(("unload-truck","package3","truck1","s4")),5) occurs(action(("disembark-truck","driver2","truck1","s4")),5) occurs(action(("drive-truck","truck2","s1","s4","driver1")),5) occurs(action(("drive-truck","truck1","s1","s4","driver2")),5)
|
||
|
|
Solving Time: 0.18s
|
||
|
|
Memory: 129MB (+7MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 2
|
||
|
|
Time : 1.093s (Solving: 0.15s 1st Model: 0.15s Unsat: 0.00s)
|
||
|
|
CPU Time : 1.080s
|
||
|
|
|
||
|
|
Choices : 2510
|
||
|
|
Conflicts : 1169 (Analyzed: 1169)
|
||
|
|
Restarts : 15 (Average: 77.93 Last: 48)
|
||
|
|
Model-Level : 20.0
|
||
|
|
Problems : 2 (Average Length: 4.50 Splits: 0)
|
||
|
|
Lemmas : 1320 (Deleted: 0)
|
||
|
|
Binary : 161 (Ratio: 12.20%)
|
||
|
|
Ternary : 79 (Ratio: 5.98%)
|
||
|
|
Conflict : 1169 (Average Length: 23.7 Ratio: 88.56%)
|
||
|
|
Loop : 151 (Average Length: 31.6 Ratio: 11.44%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 1169 (Average: 2.51 Max: 22 Sum: 2930)
|
||
|
|
Executed : 1091 (Average: 2.12 Max: 22 Sum: 2474 Ratio: 84.44%)
|
||
|
|
Bounded : 78 (Average: 5.85 Max: 7 Sum: 456 Ratio: 15.56%)
|
||
|
|
|
||
|
|
Rules : 103371
|
||
|
|
Atoms : 103371
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 16923 (Eliminated: 0 Frozen: 15388)
|
||
|
|
Constraints : 38363 (Binary: 85.0% Ternary: 12.1% Other: 3.0%)
|
||
|
|
|
||
|
|
Memory Peak : 129MB
|
||
|
|
Max. Length : 5 steps
|
||
|
|
Sol. Length : 5 steps
|
||
|
|
|
||
|
|
|