Average Error: 0.1 → 0.1
Time: 18.6s
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 r95305 = x;
        double r95306 = y;
        double r95307 = r95305 * r95306;
        double r95308 = z;
        double r95309 = r95307 + r95308;
        double r95310 = r95309 * r95306;
        double r95311 = t;
        double r95312 = r95310 + r95311;
        return r95312;
}
↓
double f(double x, double y, double z, double t) {
        double r95313 = x;
        double r95314 = y;
        double r95315 = r95313 * r95314;
        double r95316 = z;
        double r95317 = r95315 + r95316;
        double r95318 = r95317 * r95314;
        double r95319 = t;
        double r95320 = r95318 + r95319;
        return r95320;
}

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