137 lines
4.6 KiB
Plaintext
137 lines
4.6 KiB
Plaintext
|
INFO Running translator.
|
||
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/freecell-strips-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/freecell-strips-typed/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-2000/domains/freecell-strips-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/freecell-strips-typed/instances/instance-9.pddl
|
||
|
Parsing...
|
||
|
Parsing: [0.050s CPU, 0.054s wall-clock]
|
||
|
Normalizing task... [0.000s CPU, 0.004s wall-clock]
|
||
|
Instantiating...
|
||
|
Generating Datalog program... [0.010s CPU, 0.011s wall-clock]
|
||
|
Normalizing Datalog program...
|
||
|
Normalizing Datalog program: [0.070s CPU, 0.064s wall-clock]
|
||
|
Preparing model... [0.030s CPU, 0.029s wall-clock]
|
||
|
Generated 125 rules.
|
||
|
Computing model... [0.740s CPU, 0.736s wall-clock]
|
||
|
5656 relevant atoms
|
||
|
1425 auxiliary atoms
|
||
|
7081 final queue length
|
||
|
24625 total queue pushes
|
||
|
Completing instantiation... [2.600s CPU, 2.597s wall-clock]
|
||
|
Instantiating: [3.450s CPU, 3.446s wall-clock]
|
||
|
Computing fact groups...
|
||
|
Finding invariants...
|
||
|
15 initial candidates
|
||
|
Finding invariants: [0.140s CPU, 0.140s wall-clock]
|
||
|
Checking invariant weight... [0.010s CPU, 0.005s wall-clock]
|
||
|
Instantiating groups... [0.020s CPU, 0.025s wall-clock]
|
||
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||
|
Choosing groups...
|
||
|
12 uncovered facts
|
||
|
Choosing groups: [0.000s CPU, 0.005s wall-clock]
|
||
|
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
||
|
Computing fact groups: [0.190s CPU, 0.186s wall-clock]
|
||
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
||
|
Building dictionary for full mutex groups... [0.000s CPU, 0.002s wall-clock]
|
||
|
Building mutex information...
|
||
|
not in strips_to_sas, left out: Atom bottomcol(c0)
|
||
|
not in strips_to_sas, left out: Atom bottomcol(d0)
|
||
|
not in strips_to_sas, left out: Atom bottomcol(h0)
|
||
|
not in strips_to_sas, left out: Atom bottomcol(s0)
|
||
|
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.120s CPU, 0.114s wall-clock]
|
||
|
Translating task: [2.420s CPU, 2.412s wall-clock]
|
||
|
2428 effect conditions simplified
|
||
|
0 implied preconditions added
|
||
|
Detecting unreachable propositions...
|
||
|
0 operators removed
|
||
|
0 axioms removed
|
||
|
14 propositions removed
|
||
|
Detecting unreachable propositions: [1.200s CPU, 1.200s wall-clock]
|
||
|
Reordering and filtering variables...
|
||
|
30 of 30 variables necessary.
|
||
|
32 of 50 mutex groups necessary.
|
||
|
5375 of 5375 operators necessary.
|
||
|
0 of 0 axiom rules necessary.
|
||
|
Reordering and filtering variables: [0.450s CPU, 0.451s wall-clock]
|
||
|
Translator variables: 30
|
||
|
Translator derived variables: 0
|
||
|
Translator facts: 125
|
||
|
Translator goal facts: 4
|
||
|
Translator mutex groups: 32
|
||
|
Translator total mutex groups size: 122
|
||
|
Translator operators: 5375
|
||
|
Translator axioms: 0
|
||
|
Translator task size: 44730
|
||
|
Translator peak memory: 63436 KB
|
||
|
Writing output... [0.720s CPU, 0.765s wall-clock]
|
||
|
Done! [8.580s CPU, 8.624s wall-clock]
|
||
|
planner.py version 0.0.1
|
||
|
|
||
|
Time: 201.51s
|
||
|
Memory: 8406MB
|
||
|
|
||
|
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.74s
|
||
|
Memory: 8407MB (+1MB)
|
||
|
UNSAT
|
||
|
Iteration Time: 0.74s
|
||
|
|
||
|
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: 8407MB
|
||
|
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: 8407MB
|
||
|
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: 8407MB
|
||
|
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: 8407MB
|
||
|
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: 8407MB
|
||
|
Skipping: not enough memory for grounding...
|
||
|
|
||
|
Iteration Time: 0.00s
|
||
|
|
||
|
Iteration 7
|
||
|
Queue: [(6,30,0,True)]
|
||
|
Grounded Until: 0
|
||
|
Expected Memory: 8407MB
|
||
|
Skipping: not enough memory for grounding...
|
||
|
|
||
|
Iteration Time: 0.00s
|
||
|
|
||
|
Iteration 8
|
||
|
|