Average Error: 0.1 → 0.1
Time: 4.3s
Precision: 64
\[\left(x \cdot y + z\right) \cdot y + t\]
↓
\[\left(x \cdot y + z\right) \cdot y + t\]
\left(x \cdot y + z\right) \cdot y + t
↓
\left(x \cdot y + z\right) \cdot y + t
double f(double x, double y, double z, double t) {
        double r162513 = x;
        double r162514 = y;
        double r162515 = r162513 * r162514;
        double r162516 = z;
        double r162517 = r162515 + r162516;
        double r162518 = r162517 * r162514;
        double r162519 = t;
        double r162520 = r162518 + r162519;
        return r162520;
}
↓
double f(double x, double y, double z, double t) {
        double r162521 = x;
        double r162522 = y;
        double r162523 = r162521 * r162522;
        double r162524 = z;
        double r162525 = r162523 + r162524;
        double r162526 = r162525 * r162522;
        double r162527 = t;
        double r162528 = r162526 + r162527;
        return r162528;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Bits error versus t

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.1

    \[\left(x \cdot y + z\right) \cdot y + t\]

  2. Final simplification0.1

    \[\leadsto \left(x \cdot y + z\right) \cdot y + t\]

Reproduce

herbie shell --seed 2019347 
(FPCore (x y z t)
  :name "Language.Haskell.HsColour.ColourHighlight:unbase from hscolour-1.23"
  :precision binary64
  (+ (* (+ (* x y) z) y) t))