Average Error: 0.1 → 0.1
Time: 18.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 r127876 = x;
        double r127877 = y;
        double r127878 = r127876 * r127877;
        double r127879 = z;
        double r127880 = r127878 + r127879;
        double r127881 = r127880 * r127877;
        double r127882 = t;
        double r127883 = r127881 + r127882;
        return r127883;
}
↓
double f(double x, double y, double z, double t) {
        double r127884 = x;
        double r127885 = y;
        double r127886 = r127884 * r127885;
        double r127887 = z;
        double r127888 = r127886 + r127887;
        double r127889 = r127888 * r127885;
        double r127890 = t;
        double r127891 = r127889 + r127890;
        return r127891;
}

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