Average Error: 0.0 → 0.0
Time: 518.0ms
Precision: 64
\[x \cdot \left(y + 1\right)\]
↓
\[x \cdot y + x \cdot 1\]
x \cdot \left(y + 1\right)
↓
x \cdot y + x \cdot 1
double f(double x, double y) {
        double r790102 = x;
        double r790103 = y;
        double r790104 = 1.0;
        double r790105 = r790103 + r790104;
        double r790106 = r790102 * r790105;
        return r790106;
}
↓
double f(double x, double y) {
        double r790107 = x;
        double r790108 = y;
        double r790109 = r790107 * r790108;
        double r790110 = 1.0;
        double r790111 = r790107 * r790110;
        double r790112 = r790109 + r790111;
        return r790112;
}

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. Final simplification0.0

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

Reproduce

herbie shell --seed 2020024 
(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)))