Average Error: 6.4 → 0.1
Time: 16.9s
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 r573706 = x;
        double r573707 = y;
        double r573708 = r573707 * r573707;
        double r573709 = z;
        double r573710 = r573708 / r573709;
        double r573711 = r573706 + r573710;
        return r573711;
}
↓
double f(double x, double y, double z) {
        double r573712 = x;
        double r573713 = y;
        double r573714 = z;
        double r573715 = r573713 / r573714;
        double r573716 = r573713 * r573715;
        double r573717 = r573712 + r573716;
        return r573717;
}

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

Derivation

  1. Initial program 6.4

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

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

    \[\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 2019326 
(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)))