145 lines
4.8 KiB
Plaintext
145 lines
4.8 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/grid-round-2-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/grid-round-2-strips/instances/instance-2.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-1998/domains/grid-round-2-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/grid-round-2-strips/instances/instance-2.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.030s CPU, 0.028s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.020s CPU, 0.023s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.023s wall-clock]
|
||
|
|
Generated 46 rules.
|
||
|
|
Computing model... [0.570s CPU, 0.564s wall-clock]
|
||
|
|
5240 relevant atoms
|
||
|
|
2298 auxiliary atoms
|
||
|
|
7538 final queue length
|
||
|
|
15595 total queue pushes
|
||
|
|
Completing instantiation... [1.520s CPU, 1.517s wall-clock]
|
||
|
|
Instantiating: [2.140s CPU, 2.143s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
12 initial candidates
|
||
|
|
Finding invariants: [0.020s CPU, 0.018s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Instantiating groups... [0.020s CPU, 0.010s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
1 uncovered facts
|
||
|
|
Choosing groups: [0.010s CPU, 0.009s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.006s wall-clock]
|
||
|
|
Computing fact groups: [0.070s CPU, 0.070s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.010s CPU, 0.002s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.070s CPU, 0.072s wall-clock]
|
||
|
|
Translating task: [1.310s CPU, 1.310s wall-clock]
|
||
|
|
360 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
103 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.600s CPU, 0.599s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
20 of 20 variables necessary.
|
||
|
|
1 of 20 mutex groups necessary.
|
||
|
|
4140 of 4140 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.190s CPU, 0.194s wall-clock]
|
||
|
|
Translator variables: 20
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 424
|
||
|
|
Translator goal facts: 3
|
||
|
|
Translator mutex groups: 1
|
||
|
|
Translator total mutex groups size: 11
|
||
|
|
Translator operators: 4140
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 24548
|
||
|
|
Translator peak memory: 52428 KB
|
||
|
|
Writing output... [0.420s CPU, 0.458s wall-clock]
|
||
|
|
Done! [4.830s CPU, 4.869s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 23.33s
|
||
|
|
Memory: 1248MB
|
||
|
|
|
||
|
|
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: 1248MB (+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: 1248MB
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 29.32s
|
||
|
|
Memory: 3776MB (+2528MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 3.57s
|
||
|
|
Memory: 3981MB (+205MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 75.88s
|
||
|
|
|
||
|
|
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: 6714.0MB
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 33.92s
|
||
|
|
Memory: 5215MB (+1234MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 13.02s
|
||
|
|
Memory: 5410MB (+195MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 131.14s
|
||
|
|
|
||
|
|
Iteration 4
|
||
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 10
|
||
|
|
Expected Memory: 8143.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: 10
|
||
|
|
Expected Memory: 10876.0MB
|
||
|
|
Skipping: not enough memory for grounding...
|
||
|
|
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
Iteration 6
|
||
|
|
Queue: [(5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 10
|
||
|
|
Expected Memory: 13609.0MB
|
||
|
|
Skipping: not enough memory for grounding...
|
||
|
|
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
Iteration 7
|
||
|
|
Queue: [(6,30,0,True)]
|
||
|
|
Grounded Until: 10
|
||
|
|
Expected Memory: 16342.0MB
|
||
|
|
Skipping: not enough memory for grounding...
|
||
|
|
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
Iteration 8
|
||
|
|
|