Add corrupt benchmark result [gc-ta1-tt0 | ipc-2002 | driverlog-strips-automatic | 11]
This commit is contained in:
70
gc-ta1-tt0/ipc-2002_driverlog-strips-automatic_11.out
Normal file
70
gc-ta1-tt0/ipc-2002_driverlog-strips-automatic_11.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-11.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-11.pddl
|
||||
Parsing...
|
||||
Parsing: [0.020s CPU, 0.025s wall-clock]
|
||||
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||||
Instantiating...
|
||||
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
|
||||
Normalizing Datalog program...
|
||||
Normalizing Datalog program: [0.020s CPU, 0.021s wall-clock]
|
||||
Preparing model... [0.020s CPU, 0.019s wall-clock]
|
||||
Generated 35 rules.
|
||||
Computing model... [0.130s CPU, 0.128s wall-clock]
|
||||
917 relevant atoms
|
||||
608 auxiliary atoms
|
||||
1525 final queue length
|
||||
2071 total queue pushes
|
||||
Completing instantiation... [0.120s CPU, 0.122s wall-clock]
|
||||
Instantiating: [0.300s CPU, 0.301s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
11 initial candidates
|
||||
Finding invariants: [0.020s CPU, 0.018s wall-clock]
|
||||
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||||
Instantiating groups... [0.020s CPU, 0.013s wall-clock]
|
||||
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||||
Choosing groups...
|
||||
3 uncovered facts
|
||||
Choosing groups: [0.000s CPU, 0.002s wall-clock]
|
||||
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
||||
Computing fact groups: [0.040s CPU, 0.043s 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.010s CPU, 0.001s wall-clock]
|
||||
Translating task...
|
||||
Processing axioms...
|
||||
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||
Processing axioms: [0.000s CPU, 0.007s wall-clock]
|
||||
Translating task: [0.130s CPU, 0.131s wall-clock]
|
||||
42 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
11 propositions removed
|
||||
Detecting unreachable propositions: [0.070s CPU, 0.074s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
13 of 14 variables necessary.
|
||||
3 of 14 mutex groups necessary.
|
||||
574 of 616 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.020s CPU, 0.019s wall-clock]
|
||||
Translator variables: 13
|
||||
Translator derived variables: 0
|
||||
Translator facts: 119
|
||||
Translator goal facts: 7
|
||||
Translator mutex groups: 3
|
||||
Translator total mutex groups size: 9
|
||||
Translator operators: 574
|
||||
Translator axioms: 0
|
||||
Translator task size: 2482
|
||||
Translator peak memory: 38092 KB
|
||||
Writing output... [0.040s CPU, 0.054s wall-clock]
|
||||
Done! [0.640s CPU, 0.656s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
Reference in New Issue
Block a user