Add corrupt benchmark result [gc-ta1-tt0 | ipc-2002 | driverlog-strips-automatic | 15]
This commit is contained in:
70
gc-ta1-tt0/ipc-2002_driverlog-strips-automatic_15.out
Normal file
70
gc-ta1-tt0/ipc-2002_driverlog-strips-automatic_15.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-15.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-15.pddl
|
||||
Parsing...
|
||||
Parsing: [0.030s CPU, 0.025s wall-clock]
|
||||
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||||
Instantiating...
|
||||
Generating Datalog program... [0.010s CPU, 0.009s wall-clock]
|
||||
Normalizing Datalog program...
|
||||
Normalizing Datalog program: [0.020s CPU, 0.027s wall-clock]
|
||||
Preparing model... [0.050s CPU, 0.042s wall-clock]
|
||||
Generated 35 rules.
|
||||
Computing model... [0.380s CPU, 0.383s wall-clock]
|
||||
3250 relevant atoms
|
||||
1604 auxiliary atoms
|
||||
4854 final queue length
|
||||
7326 total queue pushes
|
||||
Completing instantiation... [0.510s CPU, 0.508s wall-clock]
|
||||
Instantiating: [0.970s CPU, 0.974s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
11 initial candidates
|
||||
Finding invariants: [0.030s CPU, 0.024s wall-clock]
|
||||
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
|
||||
Instantiating groups... [0.030s CPU, 0.035s wall-clock]
|
||||
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
|
||||
Choosing groups...
|
||||
4 uncovered facts
|
||||
Choosing groups: [0.010s CPU, 0.007s wall-clock]
|
||||
Building translation key... [0.000s CPU, 0.004s wall-clock]
|
||||
Computing fact groups: [0.090s CPU, 0.090s wall-clock]
|
||||
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
|
||||
Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||||
Building mutex information...
|
||||
Building mutex information: [0.010s CPU, 0.002s wall-clock]
|
||||
Translating task...
|
||||
Processing axioms...
|
||||
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||
Processing axioms: [0.030s CPU, 0.029s wall-clock]
|
||||
Translating task: [0.580s CPU, 0.585s wall-clock]
|
||||
192 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
16 propositions removed
|
||||
Detecting unreachable propositions: [0.300s CPU, 0.295s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
20 of 20 variables necessary.
|
||||
4 of 20 mutex groups necessary.
|
||||
2592 of 2592 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.070s CPU, 0.076s wall-clock]
|
||||
Translator variables: 20
|
||||
Translator derived variables: 0
|
||||
Translator facts: 336
|
||||
Translator goal facts: 10
|
||||
Translator mutex groups: 4
|
||||
Translator total mutex groups size: 20
|
||||
Translator operators: 2592
|
||||
Translator axioms: 0
|
||||
Translator task size: 10978
|
||||
Translator peak memory: 43980 KB
|
||||
Writing output... [0.210s CPU, 0.236s wall-clock]
|
||||
Done! [2.290s CPU, 2.315s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
Reference in New Issue
Block a user