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-18.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-18.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.015s wall-clock]
|
||||
Normalizing Datalog program...
|
||||
Normalizing Datalog program: [0.020s CPU, 0.017s wall-clock]
|
||||
Preparing model... [0.040s CPU, 0.039s wall-clock]
|
||||
Generated 35 rules.
|
||||
Computing model... [0.870s CPU, 0.872s wall-clock]
|
||||
10402 relevant atoms
|
||||
3678 auxiliary atoms
|
||||
14080 final queue length
|
||||
22680 total queue pushes
|
||||
Completing instantiation... [1.620s CPU, 1.624s wall-clock]
|
||||
Instantiating: [2.570s CPU, 2.579s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
11 initial candidates
|
||||
Finding invariants: [0.040s CPU, 0.035s wall-clock]
|
||||
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
|
||||
Instantiating groups... [0.090s CPU, 0.089s wall-clock]
|
||||
Collecting mutex groups... [0.010s CPU, 0.005s wall-clock]
|
||||
Choosing groups...
|
||||
5 uncovered facts
|
||||
Choosing groups: [0.010s CPU, 0.015s wall-clock]
|
||||
Building translation key... [0.010s CPU, 0.010s wall-clock]
|
||||
Computing fact groups: [0.210s CPU, 0.203s wall-clock]
|
||||
Building STRIPS to SAS dictionary... [0.000s CPU, 0.004s wall-clock]
|
||||
Building dictionary for full mutex groups... [0.000s CPU, 0.004s 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.090s CPU, 0.089s wall-clock]
|
||||
Translating task: [1.780s CPU, 1.780s wall-clock]
|
||||
500 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
30 propositions removed
|
||||
Detecting unreachable propositions: [0.900s CPU, 0.900s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
32 of 35 variables necessary.
|
||||
5 of 35 mutex groups necessary.
|
||||
8360 of 8960 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.220s CPU, 0.221s wall-clock]
|
||||
Translator variables: 32
|
||||
Translator derived variables: 0
|
||||
Translator facts: 825
|
||||
Translator goal facts: 23
|
||||
Translator mutex groups: 5
|
||||
Translator total mutex groups size: 30
|
||||
Translator operators: 8360
|
||||
Translator axioms: 0
|
||||
Translator task size: 35190
|
||||
Translator peak memory: 59480 KB
|
||||
Writing output... [0.640s CPU, 0.699s wall-clock]
|
||||
Done! [6.450s CPU, 6.515s wall-clock]
|
||||
|
Reference in New Issue
Block a user