Average Error: 0.1 → 0.1
Time: 11.2s
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 r900400 = x;
        double r900401 = y;
        double r900402 = z;
        double r900403 = r900401 * r900402;
        double r900404 = r900403 * r900402;
        double r900405 = r900400 + r900404;
        return r900405;
}
↓
double f(double x, double y, double z) {
        double r900406 = x;
        double r900407 = z;
        double r900408 = y;
        double r900409 = r900407 * r900408;
        double r900410 = r900407 * r900409;
        double r900411 = r900406 + r900410;
        return r900411;
}

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