143 lines
6.5 KiB
Plaintext
143 lines
6.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-10.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-10.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.010s CPU, 0.016s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.005s 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.090s CPU, 0.096s wall-clock]
|
||
|
|
779 relevant atoms
|
||
|
|
517 auxiliary atoms
|
||
|
|
1296 final queue length
|
||
|
|
1751 total queue pushes
|
||
|
|
Completing instantiation... [0.090s CPU, 0.089s wall-clock]
|
||
|
|
Instantiating: [0.220s CPU, 0.225s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
11 initial candidates
|
||
|
|
Finding invariants: [0.020s CPU, 0.018s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating groups... [0.020s CPU, 0.011s 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.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.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.010s CPU, 0.005s wall-clock]
|
||
|
|
Translating task: [0.100s CPU, 0.098s wall-clock]
|
||
|
|
36 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.054s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
14 of 14 variables necessary.
|
||
|
|
3 of 14 mutex groups necessary.
|
||
|
|
516 of 516 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.010s CPU, 0.015s wall-clock]
|
||
|
|
Translator variables: 14
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 114
|
||
|
|
Translator goal facts: 8
|
||
|
|
Translator mutex groups: 3
|
||
|
|
Translator total mutex groups size: 9
|
||
|
|
Translator operators: 516
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 2245
|
||
|
|
Translator peak memory: 34392 KB
|
||
|
|
Writing output... [0.040s CPU, 0.045s wall-clock]
|
||
|
|
Done! [0.490s CPU, 0.499s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.11s
|
||
|
|
Memory: 50MB
|
||
|
|
|
||
|
|
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: 50MB (+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: 51MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 52MB (+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: 54MB (+2MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("load-truck","package2","truck1","s0")),1) occurs(action(("load-truck","package3","truck2","s4")),1) occurs(action(("load-truck","package4","truck2","s4")),1) occurs(action(("load-truck","package5","truck2","s4")),1) occurs(action(("board-truck","driver1","truck2","s4")),1) occurs(action(("board-truck","driver2","truck1","s0")),1) occurs(action(("drive-truck","truck1","s0","s1","driver2")),2) occurs(action(("drive-truck","truck2","s4","s1","driver1")),2) occurs(action(("unload-truck","package2","truck1","s1")),3) occurs(action(("unload-truck","package4","truck2","s1")),3) occurs(action(("load-truck","package1","truck2","s1")),3) occurs(action(("unload-truck","package5","truck2","s1")),3) occurs(action(("drive-truck","truck2","s1","s5","driver1")),4) occurs(action(("load-truck","package5","truck1","s1")),4) occurs(action(("unload-truck","package1","truck2","s5")),5) occurs(action(("unload-truck","package3","truck2","s5")),5) occurs(action(("drive-truck","truck1","s1","s3","driver2")),5) occurs(action(("unload-truck","package5","truck1","s3")),6) occurs(action(("drive-truck","truck2","s5","s4","driver1")),6) occurs(action(("drive-truck","truck1","s3","s0","driver2")),7) occurs(action(("disembark-truck","driver2","truck1","s0")),8) occurs(action(("drive-truck","truck2","s4","s1","driver1")),9) occurs(action(("disembark-truck","driver1","truck2","s1")),10)
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 56MB (+2MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 0.247s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.240s
|
||
|
|
|
||
|
|
Choices : 763 (Domain: 763)
|
||
|
|
Conflicts : 145 (Analyzed: 144)
|
||
|
|
Restarts : 2 (Average: 72.00 Last: 21)
|
||
|
|
Model-Level : 122.0
|
||
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 144 (Deleted: 0)
|
||
|
|
Binary : 1 (Ratio: 0.69%)
|
||
|
|
Ternary : 0 (Ratio: 0.00%)
|
||
|
|
Conflict : 144 (Average Length: 101.7 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 144 (Average: 4.11 Max: 30 Sum: 592)
|
||
|
|
Executed : 140 (Average: 3.92 Max: 30 Sum: 564 Ratio: 95.27%)
|
||
|
|
Bounded : 4 (Average: 7.00 Max: 7 Sum: 28 Ratio: 4.73%)
|
||
|
|
|
||
|
|
Rules : 7871
|
||
|
|
Atoms : 7871
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 6726 (Eliminated: 0 Frozen: 5174)
|
||
|
|
Constraints : 29935 (Binary: 93.6% Ternary: 3.2% Other: 3.2%)
|
||
|
|
|
||
|
|
Memory Peak : 56MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
|
||
|
|
|