probFD

Model:	exploding-blocksworld v.1 (MDP)
Parameter(s)	N = 10
Property:	goal (prob-reach)

python2.7 probfd-qcomp19/builds/release64/bin/translate/translate.py domain.pddl p08-n8-N10-s8.pddl
probfd-qcomp19/builds/release64/bin/downward --sas output.sas --engine fretpi-hdp --heuristic hmax --enable-caching --epsilon 1e-6

Probabilistic-FD FRET-pi + HDP configuration

Walltime:	39.900094985961914s
Return code:	0, 0
Note(s):	Correctness of result is not checked because no reference result is available.

Parsing...
Parsing: [0.010s CPU, 0.005s wall-clock]
Normalizing task... [0.000s CPU, 0.000s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.001s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.000s CPU, 0.002s wall-clock]
Preparing model... [0.000s CPU, 0.001s wall-clock]
Generated 53 rules.
Computing model... [0.020s CPU, 0.016s wall-clock]
623 relevant atoms
410 auxiliary atoms
1033 final queue length
2115 total queue pushes
Completing instantiation... [0.040s CPU, 0.038s wall-clock]
Instantiating: [0.060s CPU, 0.059s wall-clock]
Computing fact groups...
Finding invariants...
15 initial candidates
Finding invariants: [0.020s CPU, 0.020s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.000s CPU, 0.001s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
32 uncovered facts
Choosing groups: [0.000s CPU, 0.001s wall-clock]
Building translation key... [0.000s CPU, 0.001s wall-clock]
Computing fact groups: [0.020s CPU, 0.025s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.000s 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.002s wall-clock]
Translating task: [0.040s CPU, 0.043s wall-clock]
670 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
20 propositions removed
Detecting unreachable propositions: [0.020s CPU, 0.018s wall-clock]
Reordering and filtering variables...
42 of 42 variables necessary.
11 of 21 mutex groups necessary.
400 of 400 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.010s wall-clock]
Translator variables: 42
Translator derived variables: 0
Translator facts: 174
Translator goal facts: 8
Translator mutex groups: 11
Translator total mutex groups size: 121
Translator operators: 400
Translator axioms: 0
Translator task size: 4075
Translator peak memory: 52940 KB
Writing output... [0.010s CPU, 0.006s wall-clock]
Done! [0.180s CPU, 0.169s wall-clock]	

reading input... [t=6.5585e-05s]
done reading input! [t=0.00220651s]
variables: 42
goals: 8
actions: 400
axioms: 0
has conditional effects: 0
reconstructing probabilistic actions... [t=0.00223681s]
done reconstructing probabilistic actions! [t=0.00352587s]
probabilistic actions: 300 (with 400 outcomes)
constructing successor generator... [t=0.00363213s]
done constructing successor generator! [t=0.00386049s]
Bytes per state: 12
Property: MaxProb
Preparing hmax dead end detection heuristic... [t=0.00390167s]
hmax initialization done! [t=0.00424138s]
Engine: FRET-pi with HDP
Starting trap elimination heuristic search wrapper...
Initial state reward: 0.4665599999999999747
Expansions: 84329
Registered states: 197686
Generated states: 279907
Cached transitions: 190502
Expansion cache hits: 76750066
Transition cache hits: 210019503
Approximate transition cache memory usage: 10596KB
Solver time: 39.64049028399999486s
Total time: 39.64477459999999809s