Average Error: 6.3 → 0.1
Time: 29.1s
Precision: 64
\[x + \frac{y \cdot y}{z}\]
↓
\[x + \frac{y}{z} \cdot y\]
x + \frac{y \cdot y}{z}
↓
x + \frac{y}{z} \cdot y
double f(double x, double y, double z) {
        double r42859490 = x;
        double r42859491 = y;
        double r42859492 = r42859491 * r42859491;
        double r42859493 = z;
        double r42859494 = r42859492 / r42859493;
        double r42859495 = r42859490 + r42859494;
        return r42859495;
}
↓
double f(double x, double y, double z) {
        double r42859496 = x;
        double r42859497 = y;
        double r42859498 = z;
        double r42859499 = r42859497 / r42859498;
        double r42859500 = r42859499 * r42859497;
        double r42859501 = r42859496 + r42859500;
        return r42859501;
}

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.3
Target0.1
Herbie0.1
\[x + y \cdot \frac{y}{z}\]

Derivation

  1. Initial program 6.3

    \[x + \frac{y \cdot y}{z}\]
  2. Using strategy rm

  3. Applied *-un-lft-identity6.3

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

  4. Applied times-frac0.1

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

  5. Simplified0.1

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

  6. Final simplification0.1

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

Reproduce

herbie shell --seed 2019165 
(FPCore (x y z)
  :name "Crypto.Random.Test:calculate from crypto-random-0.0.9"

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

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