Average Error: 0.1 → 0.1
Time: 50.5s
Precision: 64
\[x + \left(y \cdot z\right) \cdot z\]
↓
\[x + \left(y \cdot z\right) \cdot z\]
x + \left(y \cdot z\right) \cdot z
↓
x + \left(y \cdot z\right) \cdot z
double f(double x, double y, double z) {
        double r24906 = x;
        double r24907 = y;
        double r24908 = z;
        double r24909 = r24907 * r24908;
        double r24910 = r24909 * r24908;
        double r24911 = r24906 + r24910;
        return r24911;
}
↓
double f(double x, double y, double z) {
        double r24912 = x;
        double r24913 = y;
        double r24914 = z;
        double r24915 = r24913 * r24914;
        double r24916 = r24915 * r24914;
        double r24917 = r24912 + r24916;
        return r24917;
}

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 + \left(y \cdot z\right) \cdot z\]

Reproduce

herbie shell --seed 2019198 +o rules:numerics
(FPCore (x y z)
  :name "Statistics.Sample:robustSumVarWeighted from math-functions-0.1.5.2"
  (+ x (* (* y z) z)))