Average Error: 6.2 → 0.1
Time: 18.6s
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 f(double x, double y, double z) {
        double r41991283 = x;
        double r41991284 = y;
        double r41991285 = r41991284 * r41991284;
        double r41991286 = z;
        double r41991287 = r41991285 / r41991286;
        double r41991288 = r41991283 + r41991287;
        return r41991288;
}
↓
double f(double x, double y, double z) {
        double r41991289 = y;
        double r41991290 = z;
        double r41991291 = r41991289 / r41991290;
        double r41991292 = r41991291 * r41991289;
        double r41991293 = x;
        double r41991294 = r41991292 + r41991293;
        return r41991294;
}

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

Derivation

  1. Initial program 6.2

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

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

    \[\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 \frac{y}{z} \cdot y + x\]

Reproduce

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