143 lines
8.5 KiB
Plaintext
143 lines
8.5 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-15.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-15.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.030s CPU, 0.027s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.010s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.010s CPU, 0.018s wall-clock]
|
||
|
|
Preparing model... [0.030s CPU, 0.024s wall-clock]
|
||
|
|
Generated 35 rules.
|
||
|
|
Computing model... [0.320s CPU, 0.314s wall-clock]
|
||
|
|
3250 relevant atoms
|
||
|
|
1604 auxiliary atoms
|
||
|
|
4854 final queue length
|
||
|
|
7326 total queue pushes
|
||
|
|
Completing instantiation... [0.450s CPU, 0.455s wall-clock]
|
||
|
|
Instantiating: [0.830s CPU, 0.826s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
11 initial candidates
|
||
|
|
Finding invariants: [0.020s CPU, 0.022s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating groups... [0.030s CPU, 0.031s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
4 uncovered facts
|
||
|
|
Choosing groups: [0.010s CPU, 0.006s wall-clock]
|
||
|
|
Building translation key... [0.010s CPU, 0.004s wall-clock]
|
||
|
|
Computing fact groups: [0.080s CPU, 0.081s 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.002s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.030s CPU, 0.026s wall-clock]
|
||
|
|
Translating task: [0.530s CPU, 0.522s wall-clock]
|
||
|
|
192 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
16 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.260s CPU, 0.267s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
20 of 20 variables necessary.
|
||
|
|
4 of 20 mutex groups necessary.
|
||
|
|
2592 of 2592 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.070s CPU, 0.067s wall-clock]
|
||
|
|
Translator variables: 20
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 336
|
||
|
|
Translator goal facts: 10
|
||
|
|
Translator mutex groups: 4
|
||
|
|
Translator total mutex groups size: 20
|
||
|
|
Translator operators: 2592
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 10978
|
||
|
|
Translator peak memory: 40792 KB
|
||
|
|
Writing output... [0.190s CPU, 0.219s wall-clock]
|
||
|
|
Done! [2.020s CPU, 2.040s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 5.49s
|
||
|
|
Memory: 310MB
|
||
|
|
|
||
|
|
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.03s
|
||
|
|
Memory: 310MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.03s
|
||
|
|
|
||
|
|
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.64s
|
||
|
|
Memory: 375MB (+65MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.04s
|
||
|
|
Memory: 379MB (+4MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.85s
|
||
|
|
|
||
|
|
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.70s
|
||
|
|
Memory: 412MB (+33MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("walk","driver1","s8","p8-3")),1) occurs(action(("walk","driver2","s5","p5-9")),1) occurs(action(("walk","driver3","s5","p5-9")),1) occurs(action(("walk","driver4","s10","p10-1")),1) occurs(action(("walk","driver2","p5-9","s9")),2) occurs(action(("walk","driver3","p5-9","s9")),2) occurs(action(("walk","driver4","p10-1","s1")),2) occurs(action(("board-truck","driver2","truck2","s9")),3) occurs(action(("walk","driver1","p8-3","s3")),3) occurs(action(("walk","driver3","s9","p6-9")),3) occurs(action(("walk","driver4","s1","p8-1")),3) occurs(action(("drive-truck","truck2","s9","s7","driver2")),4) occurs(action(("load-truck","package7","truck2","s9")),4) occurs(action(("board-truck","driver1","truck3","s3")),4) occurs(action(("walk","driver3","p6-9","s6")),4) occurs(action(("walk","driver4","p8-1","s8")),4) occurs(action(("drive-truck","truck3","s3","s8","driver1")),5) occurs(action(("board-truck","driver3","truck4","s6")),5) occurs(action(("drive-truck","truck2","s7","s6","driver2")),5) occurs(action(("walk","driver4","s8","p8-3")),5) occurs(action(("load-truck","package3","truck3","s8")),6) occurs(action(("load-truck","package6","truck3","s8")),6) occurs(action(("drive-truck","truck3","s8","s3","driver1")),6) occurs(action(("drive-truck","truck2","s6","s10","driver2")),6) occurs(action(("drive-truck","truck4","s6","s10","driver3")),6) occurs(action(("walk","driver4","p8-3","s3")),6) occurs(action(("load-truck","package1","truck3","s3")),7) occurs(action(("drive-truck","truck2","s10","s1","driver2")),7) occurs(action(("drive-truck","truck4","s10","s2","driver3")),7) occurs(action(("load-truck","package8","truck2","s10")),7) occurs(action(("drive-truck","truck3","s3","s2","driver1")),7) occurs(action(("unload-truck","package6","truck3","s3")),7) occurs(action(("board-truck","driver4","truck1","s3")),7) occurs(action(("unload-truck","package1","truck3","s2")),8) occurs(action(("drive-truck","truck3","s2","s1","driver1")),8) occurs(action(("load-truck","package6","truck1","s3")),8) occurs(action(("drive-truck","truck1","s3","s11","driver4")),8) occurs(action(("drive-truck","truck2","s1","s2","driver2")),8) occurs(action(("drive-truck","truck4","s2","s8","driver3")),8) occurs(action(("unload-truck","package8","truck2","s1")),8) occurs(action(("unload-truck","package3","truck3","s1")),9) occurs(action(("unload-truck","package6","truck1","s11")),9) occurs(action(("unload-truck","package7","truck2","s2")),9) occurs(action(("load-truck","package2","truck2","s2")),9) occurs(action(("drive-truck","truck2","s2","s5","driver2")),9) occurs(action(("load-truck","package4","truck1","s11")),9) occurs(action(("drive-truck","truck1","s11","s7","driver4")),9) occurs(action(("load-truck","package5","truck3","s1")),9) occurs(action(("load-truck","package8","truck3","s1")),9) occurs(action(("drive-truck","truck3","s1","s0","driver1")),9) occurs(action(("unload-truck","package2","truck2","s5")),10) occurs(action(("unload-truck","package4","truck1","s7")),10) occurs(action(("unload-truck","package5","truck3","s0")),10) occurs(action(("unload-truck","package8","truck3","s0")),10) occurs(action(("disembark-truck","driver3","truck4","s8")),10) occurs(action(("drive-truck","truck3","s0","s8","driver1")),10) occurs(action(("drive-truck","truck1","s7","s11","driver4")),10) occurs(action(("drive-truck","truck2","s5","s4","driver2")),10)
|
||
|
|
Solving Time: 0.07s
|
||
|
|
Memory: 423MB (+11MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 7.384s (Solving: 0.03s 1st Model: 0.03s Unsat: 0.00s)
|
||
|
|
CPU Time : 7.340s
|
||
|
|
|
||
|
|
Choices : 1075
|
||
|
|
Conflicts : 228 (Analyzed: 228)
|
||
|
|
Restarts : 2 (Average: 114.00 Last: 29)
|
||
|
|
Model-Level : 95.0
|
||
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 228 (Deleted: 0)
|
||
|
|
Binary : 29 (Ratio: 12.72%)
|
||
|
|
Ternary : 7 (Ratio: 3.07%)
|
||
|
|
Conflict : 228 (Average Length: 39.5 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 228 (Average: 4.43 Max: 47 Sum: 1009)
|
||
|
|
Executed : 224 (Average: 4.31 Max: 47 Sum: 983 Ratio: 97.42%)
|
||
|
|
Bounded : 4 (Average: 6.50 Max: 12 Sum: 26 Ratio: 2.58%)
|
||
|
|
|
||
|
|
Rules : 2928467
|
||
|
|
Atoms : 2928467
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 57357 (Eliminated: 0 Frozen: 40316)
|
||
|
|
Constraints : 89311 (Binary: 95.1% Ternary: 3.2% Other: 1.6%)
|
||
|
|
|
||
|
|
Memory Peak : 424MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
|
||
|
|
|