Average Error: 0.1 → 0.1
Time: 9.6s
Precision: 64
\[x + \left(y \cdot z\right) \cdot z\]
↓
\[x + z \cdot \left(z \cdot y\right)\]
x + \left(y \cdot z\right) \cdot z
↓
x + z \cdot \left(z \cdot y\right)
double f(double x, double y, double z) {
        double r23887 = x;
        double r23888 = y;
        double r23889 = z;
        double r23890 = r23888 * r23889;
        double r23891 = r23890 * r23889;
        double r23892 = r23887 + r23891;
        return r23892;
}
↓
double f(double x, double y, double z) {
        double r23893 = x;
        double r23894 = z;
        double r23895 = y;
        double r23896 = r23894 * r23895;
        double r23897 = r23894 * r23896;
        double r23898 = r23893 + r23897;
        return r23898;
}

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

Reproduce

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