Average Error: 0.0 → 0.0
Time: 718.0ms
Precision: 64
\[x \cdot \left(y + 1\right)\]
\[x \cdot \left(y + 1\right)\]
x \cdot \left(y + 1\right)
x \cdot \left(y + 1\right)
double f(double x, double y) {
        double r719323 = x;
        double r719324 = y;
        double r719325 = 1.0;
        double r719326 = r719324 + r719325;
        double r719327 = r719323 * r719326;
        return r719327;
}

double f(double x, double y) {
        double r719328 = x;
        double r719329 = y;
        double r719330 = 1.0;
        double r719331 = r719329 + r719330;
        double r719332 = r719328 * r719331;
        return r719332;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.0
Target0.0
Herbie0.0
\[x + x \cdot y\]

Derivation

  1. Initial program 0.0

    \[x \cdot \left(y + 1\right)\]
  2. Final simplification0.0

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

Reproduce

herbie shell --seed 2020062 +o rules:numerics
(FPCore (x y)
  :name "Data.Colour.RGBSpace.HSL:hsl from colour-2.3.3, B"
  :precision binary64

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

  (* x (+ y 1)))