Average Error: 6.1 → 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 r833631 = x;
        double r833632 = y;
        double r833633 = r833632 * r833632;
        double r833634 = z;
        double r833635 = r833633 / r833634;
        double r833636 = r833631 + r833635;
        return r833636;
}
↓
double f(double x, double y, double z) {
        double r833637 = x;
        double r833638 = y;
        double r833639 = z;
        double r833640 = r833638 / r833639;
        double r833641 = r833638 * r833640;
        double r833642 = r833637 + r833641;
        return r833642;
}

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

Derivation

  1. Initial program 6.1

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

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

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