Average Error: 0.1 → 0.1
Time: 19.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 r111659 = x;
        double r111660 = y;
        double r111661 = r111659 * r111660;
        double r111662 = z;
        double r111663 = r111661 + r111662;
        double r111664 = r111663 * r111660;
        double r111665 = t;
        double r111666 = r111664 + r111665;
        return r111666;
}
↓
double f(double x, double y, double z, double t) {
        double r111667 = x;
        double r111668 = y;
        double r111669 = r111667 * r111668;
        double r111670 = z;
        double r111671 = r111669 + r111670;
        double r111672 = r111671 * r111668;
        double r111673 = t;
        double r111674 = r111672 + r111673;
        return r111674;
}

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))