133 lines
4.4 KiB
Plaintext
133 lines
4.4 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/instances/instance-15.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/mystery-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/instances/instance-15.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.020s CPU, 0.025s 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.040s CPU, 0.043s wall-clock]
|
||
|
|
Preparing model... [0.040s CPU, 0.034s wall-clock]
|
||
|
|
Generated 42 rules.
|
||
|
|
Computing model... [1.960s CPU, 1.966s wall-clock]
|
||
|
|
17570 relevant atoms
|
||
|
|
6412 auxiliary atoms
|
||
|
|
23982 final queue length
|
||
|
|
56683 total queue pushes
|
||
|
|
Completing instantiation... [6.980s CPU, 6.986s wall-clock]
|
||
|
|
Instantiating: [9.060s CPU, 9.061s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
12 initial candidates
|
||
|
|
Finding invariants: [0.120s CPU, 0.124s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Instantiating groups... [0.060s CPU, 0.060s wall-clock]
|
||
|
|
Collecting mutex groups... [0.010s CPU, 0.004s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
0 uncovered facts
|
||
|
|
Choosing groups: [0.010s CPU, 0.013s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.008s wall-clock]
|
||
|
|
Computing fact groups: [0.240s CPU, 0.246s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.010s CPU, 0.003s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.010s CPU, 0.005s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.270s CPU, 0.271s wall-clock]
|
||
|
|
Translating task: [5.310s CPU, 5.309s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
52 propositions removed
|
||
|
|
Detecting unreachable propositions: [2.660s CPU, 2.657s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
52 of 52 variables necessary.
|
||
|
|
0 of 52 mutex groups necessary.
|
||
|
|
16665 of 16665 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.770s CPU, 0.773s wall-clock]
|
||
|
|
Translator variables: 52
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 681
|
||
|
|
Translator goal facts: 1
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 16665
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 98645
|
||
|
|
Translator peak memory: 101500 KB
|
||
|
|
Writing output... [1.730s CPU, 1.881s wall-clock]
|
||
|
|
Done! [20.040s CPU, 20.193s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 184.23s
|
||
|
|
Memory: 8250MB
|
||
|
|
|
||
|
|
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.71s
|
||
|
|
Memory: 8250MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.71s
|
||
|
|
|
||
|
|
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: 8250MB
|
||
|
|
Skipping: not enough memory for grounding...
|
||
|
|
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
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: 0
|
||
|
|
Expected Memory: 8250MB
|
||
|
|
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: 0
|
||
|
|
Expected Memory: 8250MB
|
||
|
|
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: 0
|
||
|
|
Expected Memory: 8250MB
|
||
|
|
Skipping: not enough memory for grounding...
|
||
|
|
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
Iteration 6
|
||
|
|
Queue: [(5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 0
|
||
|
|
Expected Memory: 8250MB
|
||
|
|
Skipping: not enough memory for grounding...
|
||
|
|
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
Iteration 7
|
||
|
|
Queue: [(6,30,0,True)]
|
||
|
|
Grounded Until: 0
|
||
|
|
Expected Memory: 8250MB
|
||
|
|
Skipping: not enough memory for grounding...
|
||
|
|
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
Iteration 8
|
||
|
|
|