Average Error: 0.1 → 0.1
Time: 4.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 r162014 = x;
        double r162015 = y;
        double r162016 = r162014 * r162015;
        double r162017 = z;
        double r162018 = r162016 + r162017;
        double r162019 = r162018 * r162015;
        double r162020 = t;
        double r162021 = r162019 + r162020;
        return r162021;
}
↓
double f(double x, double y, double z, double t) {
        double r162022 = x;
        double r162023 = y;
        double r162024 = r162022 * r162023;
        double r162025 = z;
        double r162026 = r162024 + r162025;
        double r162027 = r162026 * r162023;
        double r162028 = t;
        double r162029 = r162027 + r162028;
        return r162029;
}

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