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

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

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

  2. Final simplification0.0

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

Reproduce

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