Average Error: 0.1 → 0.1
Time: 9.8s
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 r24807 = x;
        double r24808 = y;
        double r24809 = z;
        double r24810 = r24808 * r24809;
        double r24811 = r24810 * r24809;
        double r24812 = r24807 + r24811;
        return r24812;
}
↓
double f(double x, double y, double z) {
        double r24813 = x;
        double r24814 = y;
        double r24815 = z;
        double r24816 = r24814 * r24815;
        double r24817 = r24816 * r24815;
        double r24818 = r24813 + r24817;
        return r24818;
}

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