Average Error: 0.0 → 0.0
Time: 5.5s
Precision: 64
\[x \cdot \left(y + 1\right)\]
↓
\[y \cdot x + x \cdot 1\]
x \cdot \left(y + 1\right)
↓
y \cdot x + x \cdot 1
double f(double x, double y) {
        double r753354 = x;
        double r753355 = y;
        double r753356 = 1.0;
        double r753357 = r753355 + r753356;
        double r753358 = r753354 * r753357;
        return r753358;
}
↓
double f(double x, double y) {
        double r753359 = y;
        double r753360 = x;
        double r753361 = r753359 * r753360;
        double r753362 = 1.0;
        double r753363 = r753360 * r753362;
        double r753364 = r753361 + r753363;
        return r753364;
}

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. Using strategy rm

  3. Applied distribute-lft-in0.0

    \[\leadsto \color{blue}{x \cdot y + x \cdot 1}\]

  4. Simplified0.0

    \[\leadsto \color{blue}{y \cdot x} + x \cdot 1\]

  5. Final simplification0.0

    \[\leadsto y \cdot x + x \cdot 1\]

Reproduce

herbie shell --seed 2020047 +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)))