Average Error: 0.1 → 0.1
Time: 11.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 r178403 = x;
        double r178404 = y;
        double r178405 = r178403 * r178404;
        double r178406 = z;
        double r178407 = r178405 + r178406;
        double r178408 = r178407 * r178404;
        double r178409 = t;
        double r178410 = r178408 + r178409;
        return r178410;
}

double f(double x, double y, double z, double t) {
        double r178411 = x;
        double r178412 = y;
        double r178413 = r178411 * r178412;
        double r178414 = z;
        double r178415 = r178413 + r178414;
        double r178416 = r178415 * r178412;
        double r178417 = t;
        double r178418 = r178416 + r178417;
        return r178418;
}

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