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

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left(x \cdot y + x\right) + y\]
  2. Using strategy rm

  3. Applied associate-+l+0.0

    \[\leadsto \color{blue}{x \cdot y + \left(x + y\right)}\]

  4. Final simplification0.0

    \[\leadsto x \cdot y + \left(x + y\right)\]

Reproduce

herbie shell --seed 2020150 
(FPCore (x y)
  :name "Numeric.Log:$cexpm1 from log-domain-0.10.2.1, B"
  :precision binary64
  (+ (+ (* x y) x) y))