Average Error: 0.1 → 0.1
Time: 18.0s
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 r983663 = x;
        double r983664 = y;
        double r983665 = z;
        double r983666 = r983664 * r983665;
        double r983667 = r983666 * r983665;
        double r983668 = r983663 + r983667;
        return r983668;
}
↓
double f(double x, double y, double z) {
        double r983669 = x;
        double r983670 = z;
        double r983671 = y;
        double r983672 = r983670 * r983671;
        double r983673 = r983670 * r983672;
        double r983674 = r983669 + r983673;
        return r983674;
}

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