Average Error: 6.2 → 0.1
Time: 10.5s
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 r38056103 = x;
        double r38056104 = y;
        double r38056105 = r38056104 * r38056104;
        double r38056106 = z;
        double r38056107 = r38056105 / r38056106;
        double r38056108 = r38056103 + r38056107;
        return r38056108;
}
↓
double f(double x, double y, double z) {
        double r38056109 = x;
        double r38056110 = y;
        double r38056111 = z;
        double r38056112 = r38056110 / r38056111;
        double r38056113 = r38056112 * r38056110;
        double r38056114 = r38056109 + r38056113;
        return r38056114;
}

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

Reproduce

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