Average Error: 8.2 → 0.5
Time: 5.8s
Precision: binary64
\[\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z} \]
↓
\[\frac{x}{y} + \left(-2 - \left(-2 + \frac{-2}{z}\right) \cdot \frac{1}{t}\right) \]
\frac{x}{y} + \frac{2 + \left(z \cdot 2\right) \cdot \left(1 - t\right)}{t \cdot z}
↓
\frac{x}{y} + \left(-2 - \left(-2 + \frac{-2}{z}\right) \cdot \frac{1}{t}\right)

(FPCore (x y z t)
 :precision binary64
 (+ (/ x y) (/ (+ 2.0 (* (* z 2.0) (- 1.0 t))) (* t z))))
↓
(FPCore (x y z t)
 :precision binary64
 (+ (/ x y) (- -2.0 (* (+ -2.0 (/ -2.0 z)) (/ 1.0 t)))))
double code(double x, double y, double z, double t) {
	return (x / y) + ((2.0 + ((z * 2.0) * (1.0 - t))) / (t * z));
}
↓
double code(double x, double y, double z, double t) {
	return (x / y) + (-2.0 - ((-2.0 + (-2.0 / z)) * (1.0 / t)));
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Bits error versus t

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original8.2
Target0.5
Herbie0.5
\[\frac{\frac{2}{z} + 2}{t} - \left(2 - \frac{x}{y}\right) \]

Derivation

  1. Initial program 8.2

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

  2. Simplified0.5

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

  3. Applied div-inv_binary640.5

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

  4. Final simplification0.5

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

Reproduce

herbie shell --seed 2022088 
(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))))