Average Error: 0.1 → 0.1
Time: 3.9s
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 r170375 = x;
        double r170376 = y;
        double r170377 = r170375 * r170376;
        double r170378 = z;
        double r170379 = r170377 + r170378;
        double r170380 = r170379 * r170376;
        double r170381 = t;
        double r170382 = r170380 + r170381;
        return r170382;
}
↓
double f(double x, double y, double z, double t) {
        double r170383 = x;
        double r170384 = y;
        double r170385 = r170383 * r170384;
        double r170386 = z;
        double r170387 = r170385 + r170386;
        double r170388 = r170387 * r170384;
        double r170389 = t;
        double r170390 = r170388 + r170389;
        return r170390;
}

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