Average Error: 0.0 → 0.0
Time: 914.0ms
Precision: binary64
\[x \cdot \left(y + 1\right)\]
↓
\[x \cdot y + x \cdot 1\]
x \cdot \left(y + 1\right)
↓
x \cdot y + x \cdot 1
(FPCore (x y) :precision binary64 (* x (+ y 1.0)))
↓
(FPCore (x y) :precision binary64 (+ (* x y) (* x 1.0)))
double code(double x, double y) {
	return ((double) (x * ((double) (y + 1.0))));
}
↓
double code(double x, double y) {
	return ((double) (((double) (x * y)) + ((double) (x * 1.0))));
}

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 2020198 
(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.0)))