Average Error: 0.1 → 0.1
Time: 4.1s
Precision: 64
\[x \cdot \left(y + z\right) + z \cdot 5\]
↓
\[y \cdot x + z \cdot \left(x + 5\right)\]
x \cdot \left(y + z\right) + z \cdot 5
↓
y \cdot x + z \cdot \left(x + 5\right)
double f(double x, double y, double z) {
        double r332130 = x;
        double r332131 = y;
        double r332132 = z;
        double r332133 = r332131 + r332132;
        double r332134 = r332130 * r332133;
        double r332135 = 5.0;
        double r332136 = r332132 * r332135;
        double r332137 = r332134 + r332136;
        return r332137;
}
↓
double f(double x, double y, double z) {
        double r332138 = y;
        double r332139 = x;
        double r332140 = r332138 * r332139;
        double r332141 = z;
        double r332142 = 5.0;
        double r332143 = r332139 + r332142;
        double r332144 = r332141 * r332143;
        double r332145 = r332140 + r332144;
        return r332145;
}

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-rgt-in0.1

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

  4. Applied associate-+l+0.1

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

  5. Simplified0.1

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

  6. Final simplification0.1

    \[\leadsto y \cdot x + 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)))