Average Error: 0.1 → 0.1
Time: 13.1s
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 r193095 = x;
        double r193096 = y;
        double r193097 = r193095 * r193096;
        double r193098 = z;
        double r193099 = r193097 + r193098;
        double r193100 = r193099 * r193096;
        double r193101 = t;
        double r193102 = r193100 + r193101;
        return r193102;
}
↓
double f(double x, double y, double z, double t) {
        double r193103 = x;
        double r193104 = y;
        double r193105 = r193103 * r193104;
        double r193106 = z;
        double r193107 = r193105 + r193106;
        double r193108 = r193107 * r193104;
        double r193109 = t;
        double r193110 = r193108 + r193109;
        return r193110;
}

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