Average Error: 0.1 → 0.1
Time: 12.9s
Precision: 64
\[x \cdot \left(y + z\right) + z \cdot 5\]
\[x \cdot y + z \cdot \left(x + 5\right)\]
x \cdot \left(y + z\right) + z \cdot 5
x \cdot y + z \cdot \left(x + 5\right)
double f(double x, double y, double z) {
        double r389350 = x;
        double r389351 = y;
        double r389352 = z;
        double r389353 = r389351 + r389352;
        double r389354 = r389350 * r389353;
        double r389355 = 5.0;
        double r389356 = r389352 * r389355;
        double r389357 = r389354 + r389356;
        return r389357;
}

double f(double x, double y, double z) {
        double r389358 = x;
        double r389359 = y;
        double r389360 = r389358 * r389359;
        double r389361 = z;
        double r389362 = 5.0;
        double r389363 = r389358 + r389362;
        double r389364 = r389361 * r389363;
        double r389365 = r389360 + r389364;
        return r389365;
}

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

Original0.1
Target0.1
Herbie0.1
\[\left(x + 5\right) \cdot z + x \cdot y\]

Derivation

  1. Initial program 0.1

    \[x \cdot \left(y + z\right) + z \cdot 5\]
  2. Using strategy rm
  3. Applied distribute-lft-in0.1

    \[\leadsto \color{blue}{\left(x \cdot y + x \cdot z\right)} + z \cdot 5\]
  4. Applied associate-+l+0.1

    \[\leadsto \color{blue}{x \cdot y + \left(x \cdot z + z \cdot 5\right)}\]
  5. Simplified0.1

    \[\leadsto x \cdot y + \color{blue}{z \cdot \left(x + 5\right)}\]
  6. Final simplification0.1

    \[\leadsto x \cdot y + z \cdot \left(x + 5\right)\]

Reproduce

herbie shell --seed 2019304 
(FPCore (x y z)
  :name "Graphics.Rendering.Plot.Render.Plot.Legend:renderLegendOutside from plot-0.2.3.4, C"
  :precision binary64

  :herbie-target
  (+ (* (+ x 5) z) (* x y))

  (+ (* x (+ y z)) (* z 5)))