139 lines
4.6 KiB
Plaintext
139 lines
4.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-18.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-18.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.050s CPU, 0.043s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.020s CPU, 0.017s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.010s CPU, 0.019s wall-clock]
|
||
|
|
Preparing model... [0.040s CPU, 0.042s wall-clock]
|
||
|
|
Generated 35 rules.
|
||
|
|
Computing model... [0.980s CPU, 0.978s wall-clock]
|
||
|
|
10402 relevant atoms
|
||
|
|
3678 auxiliary atoms
|
||
|
|
14080 final queue length
|
||
|
|
22680 total queue pushes
|
||
|
|
Completing instantiation... [1.820s CPU, 1.817s wall-clock]
|
||
|
|
Instantiating: [2.880s CPU, 2.885s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
11 initial candidates
|
||
|
|
Finding invariants: [0.050s CPU, 0.044s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Instantiating groups... [0.110s CPU, 0.101s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.006s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
5 uncovered facts
|
||
|
|
Choosing groups: [0.020s CPU, 0.017s wall-clock]
|
||
|
|
Building translation key... [0.010s CPU, 0.011s wall-clock]
|
||
|
|
Computing fact groups: [0.240s CPU, 0.231s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.005s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.010s CPU, 0.006s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.100s CPU, 0.102s wall-clock]
|
||
|
|
Translating task: [2.010s CPU, 2.008s wall-clock]
|
||
|
|
500 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
30 propositions removed
|
||
|
|
Detecting unreachable propositions: [1.010s CPU, 1.006s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
32 of 35 variables necessary.
|
||
|
|
5 of 35 mutex groups necessary.
|
||
|
|
8360 of 8960 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.250s CPU, 0.250s wall-clock]
|
||
|
|
Translator variables: 32
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 825
|
||
|
|
Translator goal facts: 23
|
||
|
|
Translator mutex groups: 5
|
||
|
|
Translator total mutex groups size: 30
|
||
|
|
Translator operators: 8360
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 35190
|
||
|
|
Translator peak memory: 62668 KB
|
||
|
|
Writing output... [0.680s CPU, 0.753s wall-clock]
|
||
|
|
Done! [7.210s CPU, 7.278s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 29.83s
|
||
|
|
Memory: 1680MB
|
||
|
|
|
||
|
|
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.11s
|
||
|
|
Memory: 1680MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.11s
|
||
|
|
|
||
|
|
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
|
||
|
|
Expected Memory: 1680MB
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 66.24s
|
||
|
|
Memory: 7079MB (+5399MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 14.86s
|
||
|
|
Memory: 7463MB (+384MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 134.85s
|
||
|
|
|
||
|
|
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
|
||
|
|
Expected Memory: 13246.0MB
|
||
|
|
Skipping: not enough memory for grounding...
|
||
|
|
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
Iteration 4
|
||
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 5
|
||
|
|
Expected Memory: 19029.0MB
|
||
|
|
Skipping: not enough memory for grounding...
|
||
|
|
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
Iteration 5
|
||
|
|
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 5
|
||
|
|
Expected Memory: 24812.0MB
|
||
|
|
Skipping: not enough memory for grounding...
|
||
|
|
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
Iteration 6
|
||
|
|
Queue: [(5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 5
|
||
|
|
Expected Memory: 30595.0MB
|
||
|
|
Skipping: not enough memory for grounding...
|
||
|
|
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
Iteration 7
|
||
|
|
Queue: [(6,30,0,True)]
|
||
|
|
Grounded Until: 5
|
||
|
|
Expected Memory: 36378.0MB
|
||
|
|
Skipping: not enough memory for grounding...
|
||
|
|
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
Iteration 8
|
||
|
|
|