Average Error: 5.9 → 0.1
Time: 12.2s
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 r271878010 = x;
        double r271878011 = y;
        double r271878012 = r271878011 * r271878011;
        double r271878013 = z;
        double r271878014 = r271878012 / r271878013;
        double r271878015 = r271878010 + r271878014;
        return r271878015;
}
↓
double f(double x, double y, double z) {
        double r271878016 = x;
        double r271878017 = y;
        double r271878018 = z;
        double r271878019 = r271878017 / r271878018;
        double r271878020 = r271878017 * r271878019;
        double r271878021 = r271878016 + r271878020;
        return r271878021;
}

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

Original5.9
Target0.1
Herbie0.1
\[x + y \cdot \frac{y}{z}\]

Derivation

  1. Initial program 5.9

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

  3. Applied *-un-lft-identity5.9

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