Average Error: 0.0 → 0.0
Time: 6.2s
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 r79605 = x;
        double r79606 = y;
        double r79607 = 1.0;
        double r79608 = r79606 + r79607;
        double r79609 = r79605 * r79608;
        return r79609;
}
↓
double f(double x, double y) {
        double r79610 = y;
        double r79611 = x;
        double r79612 = r79610 * r79611;
        double r79613 = 1.0;
        double r79614 = r79611 * r79613;
        double r79615 = r79612 + r79614;
        return r79615;
}

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 2019310 
(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)))