Average Error: 6.0 → 0.1
Time: 7.3s
Precision: 64
\[x + \frac{y \cdot y}{z}\]
↓
\[x + \frac{y}{z} \cdot y\]
x + \frac{y \cdot y}{z}
↓
x + \frac{y}{z} \cdot y
double f(double x, double y, double z) {
        double r45484116 = x;
        double r45484117 = y;
        double r45484118 = r45484117 * r45484117;
        double r45484119 = z;
        double r45484120 = r45484118 / r45484119;
        double r45484121 = r45484116 + r45484120;
        return r45484121;
}
↓
double f(double x, double y, double z) {
        double r45484122 = x;
        double r45484123 = y;
        double r45484124 = z;
        double r45484125 = r45484123 / r45484124;
        double r45484126 = r45484125 * r45484123;
        double r45484127 = r45484122 + r45484126;
        return r45484127;
}

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

Derivation

  1. Initial program 6.0

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

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

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

Reproduce

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