Remove planner results with memouts
This removes all results obtained with our planner where memouts were encountered. These were mainly due to the fact that we didn’t configure the planner to respect the memory limit in the first place. With this configuration now in place, we can redo all the affected measurements in order to get actual, useful results.
This commit is contained in:
@@ -1,69 +0,0 @@
|
||||
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-17.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-17.pddl
|
||||
Parsing...
|
||||
Parsing: [0.030s CPU, 0.036s wall-clock]
|
||||
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||||
Instantiating...
|
||||
Generating Datalog program... [0.020s CPU, 0.014s wall-clock]
|
||||
Normalizing Datalog program...
|
||||
Normalizing Datalog program: [0.010s CPU, 0.017s wall-clock]
|
||||
Preparing model... [0.040s CPU, 0.036s wall-clock]
|
||||
Generated 35 rules.
|
||||
Computing model... [0.650s CPU, 0.641s wall-clock]
|
||||
7293 relevant atoms
|
||||
2871 auxiliary atoms
|
||||
10164 final queue length
|
||||
16104 total queue pushes
|
||||
Completing instantiation... [1.090s CPU, 1.094s wall-clock]
|
||||
Instantiating: [1.820s CPU, 1.812s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
11 initial candidates
|
||||
Finding invariants: [0.030s CPU, 0.033s wall-clock]
|
||||
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
|
||||
Instantiating groups... [0.070s CPU, 0.067s wall-clock]
|
||||
Collecting mutex groups... [0.010s CPU, 0.004s wall-clock]
|
||||
Choosing groups...
|
||||
5 uncovered facts
|
||||
Choosing groups: [0.010s CPU, 0.011s wall-clock]
|
||||
Building translation key... [0.000s CPU, 0.007s wall-clock]
|
||||
Computing fact groups: [0.150s CPU, 0.159s 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.004s wall-clock]
|
||||
Translating task...
|
||||
Processing axioms...
|
||||
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||
Processing axioms: [0.060s CPU, 0.062s wall-clock]
|
||||
Translating task: [1.230s CPU, 1.235s wall-clock]
|
||||
400 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
25 propositions removed
|
||||
Detecting unreachable propositions: [0.630s CPU, 0.628s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
30 of 30 variables necessary.
|
||||
5 of 30 mutex groups necessary.
|
||||
6170 of 6170 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.160s CPU, 0.160s wall-clock]
|
||||
Translator variables: 30
|
||||
Translator derived variables: 0
|
||||
Translator facts: 665
|
||||
Translator goal facts: 23
|
||||
Translator mutex groups: 5
|
||||
Translator total mutex groups size: 30
|
||||
Translator operators: 6170
|
||||
Translator axioms: 0
|
||||
Translator task size: 26008
|
||||
Translator peak memory: 51288 KB
|
||||
Writing output... [0.460s CPU, 0.517s wall-clock]
|
||||
Done! [4.560s CPU, 4.613s wall-clock]
|
||||
|
Reference in New Issue
Block a user