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 r166307 = x;
        double r166308 = y;
        double r166309 = r166307 * r166308;
        double r166310 = z;
        double r166311 = r166309 + r166310;
        double r166312 = r166311 * r166308;
        double r166313 = t;
        double r166314 = r166312 + r166313;
        return r166314;
}
↓
double f(double x, double y, double z, double t) {
        double r166315 = x;
        double r166316 = y;
        double r166317 = r166315 * r166316;
        double r166318 = z;
        double r166319 = r166317 + r166318;
        double r166320 = r166319 * r166316;
        double r166321 = t;
        double r166322 = r166320 + r166321;
        return r166322;
}

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