143 lines
7.6 KiB
Plaintext
143 lines
7.6 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-14.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-14.pddl
|
|
Parsing...
|
|
Parsing: [0.020s CPU, 0.022s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.020s CPU, 0.018s wall-clock]
|
|
Preparing model... [0.010s CPU, 0.019s wall-clock]
|
|
Generated 35 rules.
|
|
Computing model... [0.170s CPU, 0.176s wall-clock]
|
|
1580 relevant atoms
|
|
947 auxiliary atoms
|
|
2527 final queue length
|
|
3598 total queue pushes
|
|
Completing instantiation... [0.210s CPU, 0.204s wall-clock]
|
|
Instantiating: [0.430s CPU, 0.427s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
11 initial candidates
|
|
Finding invariants: [0.020s CPU, 0.019s wall-clock]
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
|
Instantiating groups... [0.010s CPU, 0.016s wall-clock]
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
|
Choosing groups...
|
|
3 uncovered facts
|
|
Choosing groups: [0.000s CPU, 0.003s wall-clock]
|
|
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
|
Computing fact groups: [0.050s CPU, 0.050s 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.012s wall-clock]
|
|
Translating task: [0.220s CPU, 0.221s wall-clock]
|
|
90 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
12 propositions removed
|
|
Detecting unreachable propositions: [0.120s CPU, 0.119s wall-clock]
|
|
Reordering and filtering variables...
|
|
15 of 15 variables necessary.
|
|
3 of 15 mutex groups necessary.
|
|
1158 of 1158 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.040s CPU, 0.033s wall-clock]
|
|
Translator variables: 15
|
|
Translator derived variables: 0
|
|
Translator facts: 195
|
|
Translator goal facts: 9
|
|
Translator mutex groups: 3
|
|
Translator total mutex groups size: 12
|
|
Translator operators: 1158
|
|
Translator axioms: 0
|
|
Translator task size: 4965
|
|
Translator peak memory: 36440 KB
|
|
Writing output... [0.090s CPU, 0.098s wall-clock]
|
|
Done! [0.970s CPU, 0.986s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 1.39s
|
|
Memory: 116MB
|
|
|
|
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.01s
|
|
Memory: 116MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.01s
|
|
|
|
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.22s
|
|
Memory: 141MB (+25MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 144MB (+3MB)
|
|
UNSAT
|
|
Iteration Time: 0.29s
|
|
|
|
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.25s
|
|
Memory: 156MB (+12MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("walk","driver3","s2","p1-2")),1) occurs(action(("board-truck","driver2","truck1","s2")),1) occurs(action(("walk","driver1","s9","p7-9")),1) occurs(action(("walk","driver3","p1-2","s1")),2) occurs(action(("drive-truck","truck1","s2","s3","driver2")),2) occurs(action(("walk","driver1","p7-9","s7")),2) occurs(action(("board-truck","driver3","truck2","s1")),3) occurs(action(("walk","driver1","s7","p3-7")),3) occurs(action(("drive-truck","truck1","s3","s0","driver2")),4) occurs(action(("load-truck","package4","truck1","s3")),4) occurs(action(("load-truck","package5","truck2","s1")),4) occurs(action(("drive-truck","truck2","s1","s5","driver3")),4) occurs(action(("walk","driver1","p3-7","s3")),4) occurs(action(("load-truck","package1","truck2","s5")),5) occurs(action(("load-truck","package2","truck2","s5")),5) occurs(action(("drive-truck","truck2","s5","s0","driver3")),5) occurs(action(("drive-truck","truck1","s0","s3","driver2")),5) occurs(action(("walk","driver1","s3","p8-3")),5) occurs(action(("unload-truck","package1","truck2","s0")),6) occurs(action(("unload-truck","package2","truck2","s0")),6) occurs(action(("drive-truck","truck2","s0","s5","driver3")),6) occurs(action(("drive-truck","truck1","s3","s1","driver2")),6) occurs(action(("unload-truck","package5","truck2","s0")),6) occurs(action(("walk","driver1","p8-3","s8")),6) occurs(action(("drive-truck","truck2","s5","s4","driver3")),7) occurs(action(("board-truck","driver1","truck3","s8")),7) occurs(action(("drive-truck","truck1","s1","s7","driver2")),7) occurs(action(("load-truck","package6","truck2","s4")),8) occurs(action(("drive-truck","truck2","s4","s5","driver3")),8) occurs(action(("drive-truck","truck3","s8","s0","driver1")),8) occurs(action(("drive-truck","truck1","s7","s9","driver2")),8) occurs(action(("unload-truck","package6","truck2","s5")),9) occurs(action(("drive-truck","truck3","s0","s3","driver1")),9) occurs(action(("load-truck","package3","truck1","s9")),9) occurs(action(("load-truck","package5","truck3","s0")),9) occurs(action(("drive-truck","truck1","s9","s4","driver2")),9) occurs(action(("drive-truck","truck2","s5","s1","driver3")),9) occurs(action(("unload-truck","package3","truck1","s4")),10) occurs(action(("unload-truck","package4","truck1","s4")),10) occurs(action(("unload-truck","package5","truck3","s3")),10) occurs(action(("disembark-truck","driver3","truck2","s1")),10) occurs(action(("drive-truck","truck1","s4","s6","driver2")),10)
|
|
Solving Time: 0.04s
|
|
Memory: 161MB (+5MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 3
|
|
Time : 2.082s (Solving: 0.03s 1st Model: 0.03s Unsat: 0.00s)
|
|
CPU Time : 2.060s
|
|
|
|
Choices : 1414
|
|
Conflicts : 397 (Analyzed: 397)
|
|
Restarts : 4 (Average: 99.25 Last: 75)
|
|
Model-Level : 40.0
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
|
Lemmas : 397 (Deleted: 0)
|
|
Binary : 58 (Ratio: 14.61%)
|
|
Ternary : 19 (Ratio: 4.79%)
|
|
Conflict : 397 (Average Length: 31.5 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 397 (Average: 3.51 Max: 35 Sum: 1395)
|
|
Executed : 393 (Average: 3.42 Max: 35 Sum: 1358 Ratio: 97.35%)
|
|
Bounded : 4 (Average: 9.25 Max: 12 Sum: 37 Ratio: 2.65%)
|
|
|
|
Rules : 746176
|
|
Atoms : 746176
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 26265 (Eliminated: 0 Frozen: 17376)
|
|
Constraints : 44674 (Binary: 93.8% Ternary: 4.2% Other: 2.0%)
|
|
|
|
Memory Peak : 161MB
|
|
Max. Length : 10 steps
|
|
Sol. Length : 10 steps
|
|
|
|
|