Remove results with errors
These results were affected by a bug in the planner (out-of-range index access). This was fixed in the meantime, and these measurements will be repeated now.
This commit is contained in:
@@ -1,138 +0,0 @@
|
||||
INFO Running translator.
|
||||
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/instances/instance-21.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/logistics-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/instances/instance-21.pddl
|
||||
Parsing...
|
||||
Parsing: [0.040s CPU, 0.038s wall-clock]
|
||||
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||||
Instantiating...
|
||||
Generating Datalog program... [0.010s CPU, 0.016s wall-clock]
|
||||
Normalizing Datalog program...
|
||||
Normalizing Datalog program: [0.030s CPU, 0.023s wall-clock]
|
||||
Preparing model... [0.040s CPU, 0.047s wall-clock]
|
||||
Generated 51 rules.
|
||||
Computing model... [2.410s CPU, 2.401s wall-clock]
|
||||
20976 relevant atoms
|
||||
10799 auxiliary atoms
|
||||
31775 final queue length
|
||||
47040 total queue pushes
|
||||
Completing instantiation... [4.580s CPU, 4.583s wall-clock]
|
||||
Instantiating: [7.100s CPU, 7.102s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
6 initial candidates
|
||||
Finding invariants: [0.040s CPU, 0.046s wall-clock]
|
||||
Checking invariant weight... [0.010s CPU, 0.005s wall-clock]
|
||||
Instantiating groups... [0.330s CPU, 0.334s wall-clock]
|
||||
Collecting mutex groups... [0.020s CPU, 0.016s wall-clock]
|
||||
Choosing groups...
|
||||
0 uncovered facts
|
||||
Choosing groups: [0.040s CPU, 0.044s wall-clock]
|
||||
Building translation key... [0.030s CPU, 0.029s wall-clock]
|
||||
Computing fact groups: [0.630s CPU, 0.630s wall-clock]
|
||||
Building STRIPS to SAS dictionary... [0.010s CPU, 0.014s wall-clock]
|
||||
Building dictionary for full mutex groups... [0.020s CPU, 0.014s wall-clock]
|
||||
Building mutex information...
|
||||
Building mutex information: [0.010s CPU, 0.016s wall-clock]
|
||||
Translating task...
|
||||
Processing axioms...
|
||||
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||
Processing axioms: [0.190s CPU, 0.181s wall-clock]
|
||||
Translating task: [3.700s CPU, 3.693s wall-clock]
|
||||
0 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
64 propositions removed
|
||||
Detecting unreachable propositions: [2.050s CPU, 2.047s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
64 of 64 variables necessary.
|
||||
0 of 64 mutex groups necessary.
|
||||
17170 of 17170 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.430s CPU, 0.435s wall-clock]
|
||||
Translator variables: 64
|
||||
Translator derived variables: 0
|
||||
Translator facts: 2511
|
||||
Translator goal facts: 11
|
||||
Translator mutex groups: 0
|
||||
Translator total mutex groups size: 0
|
||||
Translator operators: 17170
|
||||
Translator axioms: 0
|
||||
Translator task size: 66020
|
||||
Translator peak memory: 85716 KB
|
||||
Writing output... [1.360s CPU, 1.504s wall-clock]
|
||||
Done! [15.520s CPU, 15.657s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
||||
Time: 73.15s
|
||||
Memory: 3718MB
|
||||
|
||||
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.30s
|
||||
Memory: 3718MB (+0MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.30s
|
||||
|
||||
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: 3718MB
|
||||
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||||
Grounding Time: 21.70s
|
||||
Memory: 5709MB (+1991MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 1.82s
|
||||
Memory: 6016MB (+307MB)
|
||||
UNSAT
|
||||
Iteration Time: 30.63s
|
||||
|
||||
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: 8314.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: 10612.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: 12910.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: 15208.0MB
|
||||
Skipping: not enough memory for grounding...
|
||||
|
||||
Iteration Time: 0.00s
|
||||
|
||||
Iteration 7
|
||||
Queue: [(6,30,0,True)]
|
||||
Grounded Until: 5
|
||||
Expected Memory: 17506.0MB
|
||||
Skipping: not enough memory for grounding...
|
||||
|
||||
Iteration Time: 0.00s
|
||||
|
||||
Iteration 8
|
||||
|
||||
Reference in New Issue
Block a user