1
0
tplp-planning-benchmark/fd-pb-e3/ipc-2002_driverlog-strips-automatic_4.out

130 lines
5.8 KiB
Plaintext
Raw Normal View History

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-4.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-4.pddl
Parsing...
Parsing: [0.020s CPU, 0.022s wall-clock]
Normalizing task... [0.010s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.006s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.024s wall-clock]
Preparing model... [0.010s CPU, 0.013s wall-clock]
Generated 35 rules.
Computing model... [0.040s CPU, 0.049s wall-clock]
265 relevant atoms
191 auxiliary atoms
456 final queue length
580 total queue pushes
Completing instantiation... [0.040s CPU, 0.037s wall-clock]
Instantiating: [0.130s CPU, 0.131s 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.007s 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.031s wall-clock]
Building STRIPS to SAS dictionary... [0.010s 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.034s wall-clock]
18 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
9 propositions removed
Detecting unreachable propositions: [0.020s CPU, 0.019s wall-clock]
Reordering and filtering variables...
11 of 11 variables necessary.
2 of 11 mutex groups necessary.
144 of 144 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.000s CPU, 0.006s wall-clock]
Translator variables: 11
Translator derived variables: 0
Translator facts: 51
Translator goal facts: 9
Translator mutex groups: 2
Translator total mutex groups size: 8
Translator operators: 144
Translator axioms: 0
Translator task size: 685
Translator peak memory: 33368 KB
Writing output... [0.010s CPU, 0.015s wall-clock]
Done! [0.270s CPU, 0.262s wall-clock]
planner.py version 0.0.1
Time: 0.06s
Memory: 48MB
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: 48MB (+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.03s
Memory: 50MB (+2MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("board-truck","driver3","truck2","s0")),1) occurs(action(("board-truck","driver1","truck1","s1")),1) occurs(action(("drive-truck","truck2","s0","s2","driver3")),2) occurs(action(("load-truck","package4","truck1","s1")),2) occurs(action(("drive-truck","truck1","s1","s0","driver1")),2) occurs(action(("walk","driver2","s1","p0-1")),2) occurs(action(("unload-truck","package4","truck1","s0")),3) occurs(action(("walk","driver2","p0-1","s0")),3) occurs(action(("load-truck","package3","truck1","s0")),3) occurs(action(("drive-truck","truck1","s0","s2","driver1")),3) occurs(action(("disembark-truck","driver3","truck2","s2")),3) occurs(action(("unload-truck","package3","truck1","s2")),4) occurs(action(("load-truck","package1","truck1","s2")),4) occurs(action(("walk","driver3","s2","p1-2")),4) occurs(action(("drive-truck","truck1","s2","s1","driver1")),4) occurs(action(("unload-truck","package1","truck1","s1")),5) occurs(action(("walk","driver3","p1-2","s1")),5) occurs(action(("disembark-truck","driver1","truck1","s1")),5)
Solving Time: 0.00s
Memory: 50MB (+0MB)
SAT
SATISFIABLE
Models : 1+
Calls : 2
Time : 0.105s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.100s
Choices : 132
Conflicts : 59 (Analyzed: 59)
Restarts : 0
Model-Level : 23.0
Problems : 2 (Average Length: 4.50 Splits: 0)
Lemmas : 59 (Deleted: 0)
Binary : 13 (Ratio: 22.03%)
Ternary : 10 (Ratio: 16.95%)
Conflict : 59 (Average Length: 5.8 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 59 (Average: 2.05 Max: 9 Sum: 121)
Executed : 54 (Average: 1.97 Max: 9 Sum: 116 Ratio: 95.87%)
Bounded : 5 (Average: 1.00 Max: 1 Sum: 5 Ratio: 4.13%)
Rules : 13232
Atoms : 13232
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 1723 (Eliminated: 0 Frozen: 868)
Constraints : 3359 (Binary: 89.1% Ternary: 7.9% Other: 3.0%)
Memory Peak : 50MB
Max. Length : 5 steps
Sol. Length : 5 steps