Average Error: 0.0 → 0.0
Time: 1.0s
Precision: binary64
\[x \cdot y + a \cdot b\]
↓
\[x \cdot y + a \cdot b\]
x \cdot y + a \cdot b
↓
x \cdot y + a \cdot b
double code(double x, double y, double a, double b) {
	return ((double) (((double) (x * y)) + ((double) (a * b))));
}
↓
double code(double x, double y, double a, double b) {
	return ((double) (((double) (x * y)) + ((double) (a * b))));
}

Error

Bits error versus x

Bits error versus y

Bits error versus a

Bits error versus b

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x \cdot y + a \cdot b\]

  2. Final simplification0.0

    \[\leadsto x \cdot y + a \cdot b\]

Reproduce

herbie shell --seed 2020153 
(FPCore (x y a b)
  :name "(+ (* x y) (* a b))"
  :precision binary64
  (+ (* x y) (* a b)))