Average Error: 6.3 → 0.1
Time: 2.3s
Precision: 64
\[x + \frac{y \cdot y}{z}\]
↓
\[x + y \cdot \frac{y}{z}\]
x + \frac{y \cdot y}{z}
↓
x + y \cdot \frac{y}{z}
double f(double x, double y, double z) {
        double r991346 = x;
        double r991347 = y;
        double r991348 = r991347 * r991347;
        double r991349 = z;
        double r991350 = r991348 / r991349;
        double r991351 = r991346 + r991350;
        return r991351;
}
↓
double f(double x, double y, double z) {
        double r991352 = x;
        double r991353 = y;
        double r991354 = z;
        double r991355 = r991353 / r991354;
        double r991356 = r991353 * r991355;
        double r991357 = r991352 + r991356;
        return r991357;
}

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

Reproduce

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