181 lines
7.3 KiB
Plaintext
181 lines
7.3 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-9.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-9.pddl
|
|
Parsing...
|
|
Parsing: [0.020s CPU, 0.023s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.020s CPU, 0.020s wall-clock]
|
|
Preparing model... [0.010s CPU, 0.015s wall-clock]
|
|
Generated 35 rules.
|
|
Computing model... [0.090s CPU, 0.089s wall-clock]
|
|
596 relevant atoms
|
|
404 auxiliary atoms
|
|
1000 final queue length
|
|
1334 total queue pushes
|
|
Completing instantiation... [0.080s CPU, 0.080s wall-clock]
|
|
Instantiating: [0.210s CPU, 0.213s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
11 initial candidates
|
|
Finding invariants: [0.020s CPU, 0.015s wall-clock]
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
|
Instantiating groups... [0.010s CPU, 0.010s 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.010s CPU, 0.001s wall-clock]
|
|
Computing fact groups: [0.040s CPU, 0.034s 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.000s CPU, 0.005s wall-clock]
|
|
Translating task: [0.080s CPU, 0.083s wall-clock]
|
|
30 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
11 propositions removed
|
|
Detecting unreachable propositions: [0.050s CPU, 0.047s wall-clock]
|
|
Reordering and filtering variables...
|
|
14 of 14 variables necessary.
|
|
3 of 14 mutex groups necessary.
|
|
384 of 384 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.010s CPU, 0.013s wall-clock]
|
|
Translator variables: 14
|
|
Translator derived variables: 0
|
|
Translator facts: 97
|
|
Translator goal facts: 10
|
|
Translator mutex groups: 3
|
|
Translator total mutex groups size: 9
|
|
Translator operators: 384
|
|
Translator axioms: 0
|
|
Translator task size: 1708
|
|
Translator peak memory: 37324 KB
|
|
Writing output... [0.040s CPU, 0.037s wall-clock]
|
|
Done! [0.450s CPU, 0.457s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.10s
|
|
Memory: 53MB
|
|
|
|
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: 53MB (+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: 53MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 54MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.03s
|
|
|
|
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: 55MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 55MB (+0MB)
|
|
SAT
|
|
Testing...
|
|
NOT SERIALIZABLE
|
|
Testing Time: 0.14s
|
|
Memory: 62MB (+7MB)
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 63MB (+1MB)
|
|
SAT
|
|
Testing...
|
|
NOT SERIALIZABLE
|
|
Testing Time: 0.06s
|
|
Memory: 65MB (+2MB)
|
|
Solving...
|
|
Solving Time: 0.02s
|
|
Memory: 65MB (+0MB)
|
|
SAT
|
|
Testing...
|
|
NOT SERIALIZABLE
|
|
Testing Time: 0.06s
|
|
Memory: 66MB (+1MB)
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 66MB (+0MB)
|
|
SAT
|
|
Testing...
|
|
NOT SERIALIZABLE
|
|
Testing Time: 0.06s
|
|
Memory: 66MB (+0MB)
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 67MB (+1MB)
|
|
SAT
|
|
Testing...
|
|
SERIALIZABLE
|
|
Testing Time: 0.05s
|
|
Memory: 67MB (+0MB)
|
|
Answer: 5
|
|
occurs(action(("load-truck","package1","truck1","s2")),1) occurs(action(("load-truck","package3","truck3","s3")),1) occurs(action(("walk","driver1","s4","p3-4")),1) occurs(action(("walk","driver2","s1","p1-2")),1) occurs(action(("walk","driver1","p3-4","s3")),2) occurs(action(("walk","driver2","p1-2","s2")),2) occurs(action(("board-truck","driver1","truck3","s3")),3) occurs(action(("board-truck","driver2","truck1","s2")),3) occurs(action(("drive-truck","truck3","s3","s2","driver1")),4) occurs(action(("drive-truck","truck1","s2","s1","driver2")),4) occurs(action(("load-truck","package2","truck1","s1")),5) occurs(action(("drive-truck","truck3","s2","s1","driver1")),5) occurs(action(("drive-truck","truck1","s1","s2","driver2")),5) occurs(action(("unload-truck","package2","truck1","s2")),6) occurs(action(("unload-truck","package3","truck3","s1")),6) occurs(action(("drive-truck","truck1","s2","s3","driver2")),6) occurs(action(("drive-truck","truck3","s1","s0","driver1")),6) occurs(action(("unload-truck","package1","truck1","s3")),7) occurs(action(("disembark-truck","driver1","truck3","s0")),7) occurs(action(("disembark-truck","driver2","truck1","s3")),7) occurs(action(("walk","driver2","s3","p3-4")),8) occurs(action(("board-truck","driver1","truck2","s0")),8) occurs(action(("walk","driver2","p3-4","s4")),9) occurs(action(("drive-truck","truck2","s0","s3","driver1")),9) occurs(action(("disembark-truck","driver1","truck2","s3")),10)
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 7
|
|
Time : 0.337s (Solving: 0.04s 1st Model: 0.03s Unsat: 0.00s)
|
|
CPU Time : 0.332s
|
|
|
|
Choices : 2174 (Domain: 2169)
|
|
Conflicts : 698 (Analyzed: 698)
|
|
Restarts : 5 (Average: 139.60 Last: 102)
|
|
Model-Level : 64.4
|
|
Problems : 7 (Average Length: 9.86 Splits: 0)
|
|
Lemmas : 698 (Deleted: 0)
|
|
Binary : 19 (Ratio: 2.72%)
|
|
Ternary : 13 (Ratio: 1.86%)
|
|
Conflict : 698 (Average Length: 82.1 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 698 (Average: 2.62 Max: 36 Sum: 1826)
|
|
Executed : 697 (Average: 2.61 Max: 36 Sum: 1825 Ratio: 99.95%)
|
|
Bounded : 1 (Average: 1.00 Max: 1 Sum: 1 Ratio: 0.05%)
|
|
|
|
Rules : 70202
|
|
Atoms : 67556
|
|
Bodies : 4720 (Original: 4719)
|
|
Equivalences : 6877 (Atom=Atom: 1467 Body=Body: 1270 Other: 4140)
|
|
Tight : No (SCCs: 183 Non-Hcfs: 0 Nodes: 4262 Gammas: 0)
|
|
Variables : 5864 (Eliminated: 0 Frozen: 3080)
|
|
Constraints : 12629 (Binary: 91.8% Ternary: 4.6% Other: 3.6%)
|
|
|
|
Memory Peak : 67MB
|
|
Max. Length : 10 steps
|
|
Sol. Length : 10 steps
|
|
Models : 5
|
|
|
|
|