Data.HashTable.ST.Basic:computeOverhead from hashtables-1.2.0.2

Average Error: 9.2 → 0.1

Time: 5.1s

Precision: binary64

Math

\[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z}\]

↓

\[\frac{x}{y} + \left(2 \cdot \frac{\frac{1}{z} + 1}{t} - 2\right)\]

C

double code(double x, double y, double z, double t) {
	return ((double) ((x / y) + (((double) (2.0 + ((double) (((double) (z * 2.0)) * ((double) (1.0 - t)))))) / ((double) (t * z)))));
}

↓

double code(double x, double y, double z, double t) {
	return ((double) ((x / y) + ((double) (((double) (2.0 * (((double) ((1.0 / z) + 1.0)) / t))) - 2.0))));
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Bits error versus t

Target

Original	9.2
Target	0.1
Herbie	0.1

\[\frac{\frac{2}{z} + 2}{t} - \left(2 - \frac{x}{y}\right)\]

Derivation

1. Initial program 9.2

   \[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z}\]

2. Simplified 0.1

   \[\leadsto \color{blue}{\frac{x}{y} + \left(\frac{2}{t} \cdot \left(\frac{1}{z} + 1\right) - 2\right)}\]
3. Using strategy rm

4. Applied div-inv 0.1

   \[\leadsto \frac{x}{y} + \left(\color{blue}{\left(2 \cdot \frac{1}{t}\right)} \cdot \left(\frac{1}{z} + 1\right) - 2\right)\]

5. Applied associate-*l* 0.1

   \[\leadsto \frac{x}{y} + \left(\color{blue}{2 \cdot \left(\frac{1}{t} \cdot \left(\frac{1}{z} + 1\right)\right)} - 2\right)\]

6. Simplified 0.1

   \[\leadsto \frac{x}{y} + \left(2 \cdot \color{blue}{\frac{\frac{1}{z} + 1}{t}} - 2\right)\]

7. Final simplification 0.1

   \[\leadsto \frac{x}{y} + \left(2 \cdot \frac{\frac{1}{z} + 1}{t} - 2\right)\]

Reproduce

herbie shell --seed 2020196 
(FPCore (x y z t)
  :name "Data.HashTable.ST.Basic:computeOverhead from hashtables-1.2.0.2"
  :precision binary64

  :herbie-target
  (- (/ (+ (/ 2.0 z) 2.0) t) (- 2.0 (/ x y)))

  (+ (/ x y) (/ (+ 2.0 (* (* z 2.0) (- 1.0 t))) (* t z))))