Average Error: 0.1 → 0.1
Time: 15.7s
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 r106503 = x;
        double r106504 = y;
        double r106505 = r106503 * r106504;
        double r106506 = z;
        double r106507 = r106505 + r106506;
        double r106508 = r106507 * r106504;
        double r106509 = t;
        double r106510 = r106508 + r106509;
        return r106510;
}

double f(double x, double y, double z, double t) {
        double r106511 = x;
        double r106512 = y;
        double r106513 = r106511 * r106512;
        double r106514 = z;
        double r106515 = r106513 + r106514;
        double r106516 = r106515 * r106512;
        double r106517 = t;
        double r106518 = r106516 + r106517;
        return r106518;
}

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