143 lines
7.2 KiB
Plaintext
143 lines
7.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-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/driverlog-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-9.pddl
|
|
Parsing...
|
|
Parsing: [0.020s CPU, 0.023s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.020s CPU, 0.021s wall-clock]
|
|
Preparing model... [0.020s CPU, 0.016s wall-clock]
|
|
Generated 35 rules.
|
|
Computing model... [0.080s CPU, 0.089s wall-clock]
|
|
596 relevant atoms
|
|
404 auxiliary atoms
|
|
1000 final queue length
|
|
1334 total queue pushes
|
|
Completing instantiation... [0.080s CPU, 0.076s wall-clock]
|
|
Instantiating: [0.210s CPU, 0.210s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
11 initial candidates
|
|
Finding invariants: [0.020s CPU, 0.017s wall-clock]
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
|
Instantiating groups... [0.010s CPU, 0.009s 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.010s CPU, 0.001s wall-clock]
|
|
Computing fact groups: [0.040s 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.001s wall-clock]
|
|
Translating task...
|
|
Processing axioms...
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
|
Processing axioms: [0.000s CPU, 0.004s wall-clock]
|
|
Translating task: [0.070s CPU, 0.072s wall-clock]
|
|
30 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
11 propositions removed
|
|
Detecting unreachable propositions: [0.040s CPU, 0.044s wall-clock]
|
|
Reordering and filtering variables...
|
|
14 of 14 variables necessary.
|
|
3 of 14 mutex groups necessary.
|
|
384 of 384 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.010s CPU, 0.011s wall-clock]
|
|
Translator variables: 14
|
|
Translator derived variables: 0
|
|
Translator facts: 97
|
|
Translator goal facts: 10
|
|
Translator mutex groups: 3
|
|
Translator total mutex groups size: 9
|
|
Translator operators: 384
|
|
Translator axioms: 0
|
|
Translator task size: 1708
|
|
Translator peak memory: 34136 KB
|
|
Writing output... [0.030s CPU, 0.035s wall-clock]
|
|
Done! [0.430s CPU, 0.437s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.15s
|
|
Memory: 53MB
|
|
|
|
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: 53MB (+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.15s
|
|
Memory: 71MB (+18MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.03s
|
|
Memory: 75MB (+4MB)
|
|
UNSAT
|
|
Iteration Time: 0.21s
|
|
|
|
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.19s
|
|
Memory: 87MB (+12MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("walk","driver1","s4","p4-0")),1) occurs(action(("walk","driver2","s1","p1-2")),1) occurs(action(("walk","driver1","p4-0","s0")),2) occurs(action(("walk","driver2","p1-2","s2")),2) occurs(action(("drive-truck","truck2","s0","s3","driver1")),3) occurs(action(("load-truck","package1","truck1","s2")),3) occurs(action(("load-truck","package2","truck1","s1")),3) occurs(action(("drive-truck","truck1","s2","s1","driver2")),3) occurs(action(("load-truck","package3","truck2","s3")),3) occurs(action(("board-truck","driver1","truck2","s0")),3) occurs(action(("board-truck","driver2","truck1","s2")),3) occurs(action(("disembark-truck","driver1","truck2","s3")),4) occurs(action(("drive-truck","truck1","s1","s0","driver2")),4) occurs(action(("unload-truck","package1","truck1","s0")),4) occurs(action(("unload-truck","package2","truck1","s0")),4) occurs(action(("unload-truck","package3","truck2","s3")),4) occurs(action(("load-truck","package1","truck1","s0")),5) occurs(action(("load-truck","package2","truck3","s0")),5) occurs(action(("load-truck","package3","truck3","s3")),5) occurs(action(("board-truck","driver1","truck3","s3")),5) occurs(action(("drive-truck","truck3","s3","s0","driver1")),5) occurs(action(("disembark-truck","driver2","truck1","s0")),5) occurs(action(("unload-truck","package3","truck3","s1")),6) occurs(action(("drive-truck","truck1","s0","s3","driver2")),6) occurs(action(("drive-truck","truck3","s0","s1","driver1")),6) occurs(action(("board-truck","driver2","truck1","s0")),6) occurs(action(("unload-truck","package1","truck1","s3")),7) occurs(action(("drive-truck","truck3","s1","s2","driver1")),7) occurs(action(("unload-truck","package2","truck3","s2")),8) occurs(action(("load-truck","package1","truck1","s3")),8) occurs(action(("disembark-truck","driver2","truck1","s3")),8) occurs(action(("drive-truck","truck3","s2","s3","driver1")),8) occurs(action(("unload-truck","package1","truck1","s3")),9) occurs(action(("disembark-truck","driver1","truck3","s3")),9) occurs(action(("walk","driver2","s3","p3-4")),9) occurs(action(("walk","driver2","p3-4","s4")),10)
|
|
Solving Time: 0.16s
|
|
Memory: 89MB (+2MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 3
|
|
Time : 0.754s (Solving: 0.17s 1st Model: 0.15s Unsat: 0.02s)
|
|
CPU Time : 0.760s
|
|
|
|
Choices : 5137
|
|
Conflicts : 1756 (Analyzed: 1755)
|
|
Restarts : 17 (Average: 103.24 Last: 132)
|
|
Model-Level : 49.0
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
|
Lemmas : 2010 (Deleted: 0)
|
|
Binary : 264 (Ratio: 13.13%)
|
|
Ternary : 108 (Ratio: 5.37%)
|
|
Conflict : 1755 (Average Length: 14.3 Ratio: 87.31%)
|
|
Loop : 255 (Average Length: 17.6 Ratio: 12.69%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 1755 (Average: 3.18 Max: 44 Sum: 5582)
|
|
Executed : 1690 (Average: 2.87 Max: 44 Sum: 5044 Ratio: 90.36%)
|
|
Bounded : 65 (Average: 8.28 Max: 12 Sum: 538 Ratio: 9.64%)
|
|
|
|
Rules : 36569
|
|
Atoms : 36569
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 19198 (Eliminated: 0 Frozen: 17427)
|
|
Constraints : 36036 (Binary: 84.4% Ternary: 12.0% Other: 3.7%)
|
|
|
|
Memory Peak : 90MB
|
|
Max. Length : 10 steps
|
|
Sol. Length : 10 steps
|
|
|
|
|