Average Error: 0.1 → 0.1
Time: 4.4s
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 r136517 = x;
        double r136518 = y;
        double r136519 = r136517 * r136518;
        double r136520 = z;
        double r136521 = r136519 + r136520;
        double r136522 = r136521 * r136518;
        double r136523 = t;
        double r136524 = r136522 + r136523;
        return r136524;
}

double f(double x, double y, double z, double t) {
        double r136525 = x;
        double r136526 = y;
        double r136527 = r136525 * r136526;
        double r136528 = z;
        double r136529 = r136527 + r136528;
        double r136530 = r136529 * r136526;
        double r136531 = t;
        double r136532 = r136530 + r136531;
        return r136532;
}

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 2020060 
(FPCore (x y z t)
  :name "Language.Haskell.HsColour.ColourHighlight:unbase from hscolour-1.23"
  :precision binary64
  (+ (* (+ (* x y) z) y) t))