Average Error: 0.0 → 0.0
Time: 2.8s
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 r597026 = x;
        double r597027 = y;
        double r597028 = 1.0;
        double r597029 = r597027 + r597028;
        double r597030 = r597026 * r597029;
        return r597030;
}
↓
double f(double x, double y) {
        double r597031 = y;
        double r597032 = x;
        double r597033 = r597031 * r597032;
        double r597034 = 1.0;
        double r597035 = r597032 * r597034;
        double r597036 = r597033 + r597035;
        return r597036;
}

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 2019212 +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)))