Average Error: 0.0 → 0.0
Time: 968.0ms
Precision: 64
\[x \cdot \left(y + 1\right)\]
↓
\[\left(y + 1\right) \cdot x\]
x \cdot \left(y + 1\right)
↓
\left(y + 1\right) \cdot x
double f(double x, double y) {
        double r652108 = x;
        double r652109 = y;
        double r652110 = 1.0;
        double r652111 = r652109 + r652110;
        double r652112 = r652108 * r652111;
        return r652112;
}
↓
double f(double x, double y) {
        double r652113 = y;
        double r652114 = 1.0;
        double r652115 = r652113 + r652114;
        double r652116 = x;
        double r652117 = r652115 * r652116;
        return r652117;
}

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 \left(y + 1\right) \cdot x\]

Reproduce

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

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

  (* x (+ y 1.0)))