169 lines
7.0 KiB
Plaintext
169 lines
7.0 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-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.000s CPU, 0.015s wall-clock]
|
|
Normalizing task... [0.010s CPU, 0.001s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.000s CPU, 0.004s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.020s CPU, 0.017s wall-clock]
|
|
Preparing model... [0.010s CPU, 0.009s wall-clock]
|
|
Generated 35 rules.
|
|
Computing model... [0.040s CPU, 0.037s wall-clock]
|
|
265 relevant atoms
|
|
191 auxiliary atoms
|
|
456 final queue length
|
|
580 total queue pushes
|
|
Completing instantiation... [0.020s CPU, 0.029s wall-clock]
|
|
Instantiating: [0.090s CPU, 0.098s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
11 initial candidates
|
|
Finding invariants: [0.020s CPU, 0.016s wall-clock]
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
|
Instantiating groups... [0.010s CPU, 0.005s 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.026s 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.028s 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.017s 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.005s 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.020s CPU, 0.015s wall-clock]
|
|
Done! [0.200s CPU, 0.209s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.04s
|
|
Memory: 47MB
|
|
|
|
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: 47MB (+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.02s
|
|
Memory: 47MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 47MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.02s
|
|
|
|
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.02s
|
|
Memory: 48MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.03s
|
|
Memory: 48MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.05s
|
|
|
|
Iteration 4
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
|
Grounded Until: 10
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
|
Grounding Time: 0.01s
|
|
Memory: 49MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.27s
|
|
Memory: 50MB (+1MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.29s
|
|
|
|
Iteration 5
|
|
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
|
Grounded Until: 15
|
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
|
Grounding Time: 0.01s
|
|
Memory: 50MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("board-truck","driver3","truck2","s0")),1) occurs(action(("drive-truck","truck2","s0","s2","driver3")),2) occurs(action(("load-truck","package1","truck2","s2")),3) occurs(action(("drive-truck","truck2","s2","s1","driver3")),4) occurs(action(("load-truck","package4","truck2","s1")),5) occurs(action(("board-truck","driver1","truck1","s1")),6) occurs(action(("unload-truck","package1","truck2","s1")),7) occurs(action(("load-truck","package1","truck1","s1")),8) occurs(action(("drive-truck","truck2","s1","s0","driver3")),9) occurs(action(("unload-truck","package4","truck2","s0")),10) occurs(action(("disembark-truck","driver1","truck1","s1")),11) occurs(action(("walk","driver2","s1","p0-1")),12) occurs(action(("load-truck","package3","truck2","s0")),13) occurs(action(("unload-truck","package1","truck1","s1")),14) occurs(action(("drive-truck","truck2","s0","s2","driver3")),15) occurs(action(("walk","driver2","p0-1","s0")),16) occurs(action(("disembark-truck","driver3","truck2","s2")),17) occurs(action(("walk","driver3","s2","p1-2")),18) occurs(action(("unload-truck","package3","truck2","s2")),19) occurs(action(("walk","driver3","p1-2","s1")),20)
|
|
Solving Time: 0.26s
|
|
Memory: 51MB (+1MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 5
|
|
Time : 0.680s (Solving: 0.56s 1st Model: 0.26s Unsat: 0.03s)
|
|
CPU Time : 0.670s
|
|
|
|
Choices : 32239
|
|
Conflicts : 18829 (Analyzed: 18827)
|
|
Restarts : 191 (Average: 98.57 Last: 138)
|
|
Model-Level : 52.0
|
|
Problems : 5 (Average Length: 12.00 Splits: 0)
|
|
Lemmas : 18827 (Deleted: 9063)
|
|
Binary : 1435 (Ratio: 7.62%)
|
|
Ternary : 1092 (Ratio: 5.80%)
|
|
Conflict : 18827 (Average Length: 18.2 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 18827 (Average: 1.65 Max: 42 Sum: 31025)
|
|
Executed : 18776 (Average: 1.62 Max: 42 Sum: 30588 Ratio: 98.59%)
|
|
Bounded : 51 (Average: 8.57 Max: 22 Sum: 437 Ratio: 1.41%)
|
|
|
|
Rules : 2234
|
|
Atoms : 2234
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 4574 (Eliminated: 0 Frozen: 2928)
|
|
Constraints : 17970 (Binary: 89.5% Ternary: 6.4% Other: 4.1%)
|
|
|
|
Memory Peak : 51MB
|
|
Max. Length : 20 steps
|
|
Sol. Length : 20 steps
|
|
|
|
|