1
0
tplp-planning-benchmark/fd-pa-e1-sh/ipc-2002_driverlog-strips-automatic_5.out

143 lines
6.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-5.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-5.pddl
Parsing...
Parsing: [0.010s CPU, 0.013s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.003s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.015s wall-clock]
Preparing model... [0.010s CPU, 0.009s wall-clock]
Generated 35 rules.
Computing model... [0.040s CPU, 0.038s wall-clock]
302 relevant atoms
216 auxiliary atoms
518 final queue length
659 total queue pushes
Completing instantiation... [0.030s CPU, 0.031s wall-clock]
Instantiating: [0.100s CPU, 0.097s wall-clock]
Computing fact groups...
Finding invariants...
11 initial candidates
Finding invariants: [0.010s CPU, 0.017s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.010s CPU, 0.006s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
2 uncovered facts
Choosing groups: [0.000s CPU, 0.001s wall-clock]
Building translation key... [0.000s CPU, 0.001s wall-clock]
Computing fact groups: [0.030s CPU, 0.028s 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.000s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.000s CPU, 0.002s wall-clock]
Translating task: [0.030s CPU, 0.033s wall-clock]
18 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
10 propositions removed
Detecting unreachable propositions: [0.020s CPU, 0.019s wall-clock]
Reordering and filtering variables...
12 of 12 variables necessary.
2 of 12 mutex groups necessary.
168 of 168 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.006s wall-clock]
Translator variables: 12
Translator derived variables: 0
Translator facts: 59
Translator goal facts: 8
Translator mutex groups: 2
Translator total mutex groups size: 8
Translator operators: 168
Translator axioms: 0
Translator task size: 777
Translator peak memory: 33368 KB
Writing output... [0.010s CPU, 0.017s wall-clock]
Done! [0.210s CPU, 0.217s wall-clock]
planner.py version 0.0.1
Time: 0.05s
Memory: 47MB
Iteration 1
Queue: [0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75]
Grounded Until: 0
Solving...
Solving Time: 0.00s
Memory: 47MB (+0MB)
UNSAT
Iteration Time: 0.00s
Iteration 2
Queue: [5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.02s
Memory: 48MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 48MB (+0MB)
UNSAT
Iteration Time: 0.03s
Iteration 3
Queue: [10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.02s
Memory: 49MB (+1MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("walk","driver2","s0","p0-2")),1) occurs(action(("board-truck","driver1","truck1","s1")),1) occurs(action(("walk","driver3","s0","p0-1")),1) occurs(action(("drive-truck","truck1","s1","s2","driver1")),2) occurs(action(("walk","driver3","p0-1","s1")),2) occurs(action(("board-truck","driver3","truck2","s1")),3) occurs(action(("drive-truck","truck1","s2","s0","driver1")),3) occurs(action(("load-truck","package1","truck1","s0")),4) occurs(action(("load-truck","package2","truck1","s0")),4) occurs(action(("drive-truck","truck1","s0","s2","driver1")),5) occurs(action(("drive-truck","truck2","s1","s2","driver3")),6) occurs(action(("load-truck","package4","truck1","s2")),6) occurs(action(("unload-truck","package1","truck1","s2")),6) occurs(action(("unload-truck","package2","truck1","s2")),6) occurs(action(("walk","driver2","p0-2","s2")),7) occurs(action(("load-truck","package1","truck2","s2")),7) occurs(action(("load-truck","package2","truck2","s2")),7) occurs(action(("load-truck","package3","truck2","s2")),7) occurs(action(("drive-truck","truck1","s2","s0","driver1")),7) occurs(action(("unload-truck","package4","truck1","s0")),8) occurs(action(("drive-truck","truck2","s2","s1","driver3")),8) occurs(action(("unload-truck","package1","truck2","s1")),9) occurs(action(("unload-truck","package2","truck2","s1")),9) occurs(action(("unload-truck","package3","truck2","s1")),9) occurs(action(("drive-truck","truck1","s0","s1","driver1")),9) occurs(action(("drive-truck","truck2","s1","s2","driver3")),10) occurs(action(("drive-truck","truck1","s1","s2","driver1")),10)
Solving Time: 0.00s
Memory: 49MB (+0MB)
SAT
SATISFIABLE
Models : 1+
Calls : 3
Time : 0.110s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.100s
Choices : 44
Conflicts : 11 (Analyzed: 10)
Restarts : 0
Model-Level : 40.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 10 (Deleted: 0)
Binary : 0 (Ratio: 0.00%)
Ternary : 1 (Ratio: 10.00%)
Conflict : 10 (Average Length: 7.8 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 10 (Average: 1.70 Max: 3 Sum: 17)
Executed : 9 (Average: 1.60 Max: 3 Sum: 16 Ratio: 94.12%)
Bounded : 1 (Average: 1.00 Max: 1 Sum: 1 Ratio: 5.88%)
Rules : 2732
Atoms : 2732
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 2784 (Eliminated: 0 Frozen: 1730)
Constraints : 11523 (Binary: 90.2% Ternary: 5.4% Other: 4.5%)
Memory Peak : 49MB
Max. Length : 10 steps
Sol. Length : 10 steps