Average Error: 0.1 → 0.1
Time: 9.0s
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 r12144 = x;
        double r12145 = y;
        double r12146 = z;
        double r12147 = r12145 * r12146;
        double r12148 = r12147 * r12146;
        double r12149 = r12144 + r12148;
        return r12149;
}
↓
double f(double x, double y, double z) {
        double r12150 = x;
        double r12151 = y;
        double r12152 = z;
        double r12153 = r12151 * r12152;
        double r12154 = r12153 * r12152;
        double r12155 = r12150 + r12154;
        return r12155;
}

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 2020047 
(FPCore (x y z)
  :name "Statistics.Sample:robustSumVarWeighted from math-functions-0.1.5.2"
  :precision binary64
  (+ x (* (* y z) z)))