Add benchmark result [gc-ta1-tt1 | ipc-2011 | parking-sequential-satisficing | 20]
This commit is contained in:
69
gc-ta1-tt1/ipc-2011_parking-sequential-satisficing_20.out
Normal file
69
gc-ta1-tt1/ipc-2011_parking-sequential-satisficing_20.out
Normal file
@@ -0,0 +1,69 @@
|
||||
INFO Running translator.
|
||||
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parking-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parking-sequential-satisficing/instances/instance-20.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-2011/domains/parking-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parking-sequential-satisficing/instances/instance-20.pddl
|
||||
Parsing...
|
||||
Parsing: [0.020s CPU, 0.020s wall-clock]
|
||||
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||||
Instantiating...
|
||||
Generating Datalog program... [0.000s CPU, 0.007s wall-clock]
|
||||
Normalizing Datalog program...
|
||||
Normalizing Datalog program: [0.020s CPU, 0.015s wall-clock]
|
||||
Preparing model... [0.010s CPU, 0.017s wall-clock]
|
||||
Generated 32 rules.
|
||||
Computing model... [7.070s CPU, 7.063s wall-clock]
|
||||
78629 relevant atoms
|
||||
6562 auxiliary atoms
|
||||
85191 final queue length
|
||||
254680 total queue pushes
|
||||
Completing instantiation... [29.560s CPU, 29.548s wall-clock]
|
||||
Instantiating: [36.740s CPU, 36.726s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
12 initial candidates
|
||||
Finding invariants: [0.080s CPU, 0.084s wall-clock]
|
||||
Checking invariant weight... [0.000s CPU, 0.005s wall-clock]
|
||||
Instantiating groups... [0.090s CPU, 0.086s wall-clock]
|
||||
Collecting mutex groups... [0.010s CPU, 0.013s wall-clock]
|
||||
Choosing groups...
|
||||
81 uncovered facts
|
||||
Choosing groups: [0.060s CPU, 0.062s wall-clock]
|
||||
Building translation key... [0.020s CPU, 0.021s wall-clock]
|
||||
Computing fact groups: [0.370s CPU, 0.374s wall-clock]
|
||||
Building STRIPS to SAS dictionary... [0.010s CPU, 0.009s wall-clock]
|
||||
Building dictionary for full mutex groups... [0.020s CPU, 0.021s wall-clock]
|
||||
Building mutex information...
|
||||
Building mutex information: [0.030s CPU, 0.038s wall-clock]
|
||||
Translating task...
|
||||
Processing axioms...
|
||||
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||
Processing axioms: [1.460s CPU, 1.448s wall-clock]
|
||||
Translating task: [31.830s CPU, 31.812s wall-clock]
|
||||
91136 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
32 propositions removed
|
||||
Detecting unreachable propositions: [16.080s CPU, 16.077s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
113 of 113 variables necessary.
|
||||
49 of 81 mutex groups necessary.
|
||||
73728 of 73728 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [6.340s CPU, 6.333s wall-clock]
|
||||
Translator variables: 113
|
||||
Translator derived variables: 0
|
||||
Translator facts: 1730
|
||||
Translator goal facts: 32
|
||||
Translator mutex groups: 49
|
||||
Translator total mutex groups size: 1617
|
||||
Translator operators: 73728
|
||||
Translator axioms: 0
|
||||
Translator task size: 600484
|
||||
Translator peak memory: 389148 KB
|
||||
Writing output... [10.470s CPU, 11.200s wall-clock]
|
||||
Done! [103.070s CPU, 103.771s wall-clock]
|
||||
|
Reference in New Issue
Block a user