Average Error: 6.2 → 0.1
Time: 2.1s
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 r882693 = x;
        double r882694 = y;
        double r882695 = r882694 * r882694;
        double r882696 = z;
        double r882697 = r882695 / r882696;
        double r882698 = r882693 + r882697;
        return r882698;
}
↓
double f(double x, double y, double z) {
        double r882699 = x;
        double r882700 = y;
        double r882701 = z;
        double r882702 = r882700 / r882701;
        double r882703 = r882700 * r882702;
        double r882704 = r882699 + r882703;
        return r882704;
}

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

Reproduce

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