Average Error: 0.1 → 0.1
Time: 2.2s
Precision: binary64
\[x + \left(y \cdot z\right) \cdot z\]
↓
\[x + z \cdot \left(y \cdot z\right)\]
x + \left(y \cdot z\right) \cdot z
↓
x + z \cdot \left(y \cdot z\right)
double code(double x, double y, double z) {
	return ((double) (x + ((double) (((double) (y * z)) * z))));
}
↓
double code(double x, double y, double z) {
	return ((double) (x + ((double) (z * ((double) (y * 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.1

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

  2. Final simplification0.1

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

Reproduce

herbie shell --seed 2020184 
(FPCore (x y z)
  :name "Statistics.Sample:robustSumVarWeighted from math-functions-0.1.5.2"
  :precision binary64
  (+ x (* (* y z) z)))