Average Error: 6.6 → 0.1
Time: 2.1s
Precision: 64
\[x + \frac{y \cdot y}{z}\]
↓
\[\frac{y}{z} \cdot y + x\]
x + \frac{y \cdot y}{z}
↓
\frac{y}{z} \cdot y + x
double code(double x, double y, double z) {
	return (x + ((y * y) / z));
}
↓
double code(double x, double y, double z) {
	return (((y / z) * y) + x);
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original6.6
Target0.1
Herbie0.1
\[x + y \cdot \frac{y}{z}\]

Derivation

  1. Initial program 6.6

    \[x + \frac{y \cdot y}{z}\]

  2. Simplified0.1

    \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{y}{z}, y, x\right)}\]
  3. Using strategy rm

  4. Applied fma-udef0.1

    \[\leadsto \color{blue}{\frac{y}{z} \cdot y + x}\]

  5. Final simplification0.1

    \[\leadsto \frac{y}{z} \cdot y + x\]

Reproduce

herbie shell --seed 2020102 +o rules:numerics
(FPCore (x y z)
  :name "Crypto.Random.Test:calculate from crypto-random-0.0.9"
  :precision binary64

  :herbie-target
  (+ x (* y (/ y z)))

  (+ x (/ (* y y) z)))