Add corrupt benchmark result [gc-ta1-tt0 | ipc-2002 | driverlog-strips-automatic | 12]
This commit is contained in:
70
gc-ta1-tt0/ipc-2002_driverlog-strips-automatic_12.out
Normal file
70
gc-ta1-tt0/ipc-2002_driverlog-strips-automatic_12.out
Normal file
@@ -0,0 +1,70 @@
|
||||
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-12.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-12.pddl
|
||||
Parsing...
|
||||
Parsing: [0.030s CPU, 0.034s wall-clock]
|
||||
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||||
Instantiating...
|
||||
Generating Datalog program... [0.010s CPU, 0.011s wall-clock]
|
||||
Normalizing Datalog program...
|
||||
Normalizing Datalog program: [0.020s CPU, 0.023s wall-clock]
|
||||
Preparing model... [0.030s CPU, 0.026s wall-clock]
|
||||
Generated 35 rules.
|
||||
Computing model... [0.190s CPU, 0.186s wall-clock]
|
||||
1376 relevant atoms
|
||||
903 auxiliary atoms
|
||||
2279 final queue length
|
||||
3128 total queue pushes
|
||||
Completing instantiation... [0.180s CPU, 0.187s wall-clock]
|
||||
Instantiating: [0.440s CPU, 0.436s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
11 initial candidates
|
||||
Finding invariants: [0.010s CPU, 0.018s wall-clock]
|
||||
Checking invariant weight... [0.010s CPU, 0.002s wall-clock]
|
||||
Instantiating groups... [0.010s CPU, 0.018s wall-clock]
|
||||
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||||
Choosing groups...
|
||||
3 uncovered facts
|
||||
Choosing groups: [0.000s CPU, 0.003s wall-clock]
|
||||
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
||||
Computing fact groups: [0.050s CPU, 0.051s wall-clock]
|
||||
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
||||
Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||||
Building mutex information...
|
||||
Building mutex information: [0.000s CPU, 0.001s wall-clock]
|
||||
Translating task...
|
||||
Processing axioms...
|
||||
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||
Processing axioms: [0.010s CPU, 0.011s wall-clock]
|
||||
Translating task: [0.200s CPU, 0.200s wall-clock]
|
||||
60 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
11 propositions removed
|
||||
Detecting unreachable propositions: [0.110s CPU, 0.109s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
14 of 14 variables necessary.
|
||||
3 of 14 mutex groups necessary.
|
||||
948 of 948 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.030s CPU, 0.029s wall-clock]
|
||||
Translator variables: 14
|
||||
Translator derived variables: 0
|
||||
Translator facts: 176
|
||||
Translator goal facts: 10
|
||||
Translator mutex groups: 3
|
||||
Translator total mutex groups size: 9
|
||||
Translator operators: 948
|
||||
Translator axioms: 0
|
||||
Translator task size: 4037
|
||||
Translator peak memory: 39116 KB
|
||||
Writing output... [0.080s CPU, 0.086s wall-clock]
|
||||
Done! [0.950s CPU, 0.961s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
Reference in New Issue
Block a user