Average Error: 0.1 → 0.1
Time: 4.5s
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 r194098 = x;
        double r194099 = y;
        double r194100 = r194098 * r194099;
        double r194101 = z;
        double r194102 = r194100 + r194101;
        double r194103 = r194102 * r194099;
        double r194104 = t;
        double r194105 = r194103 + r194104;
        return r194105;
}
↓
double f(double x, double y, double z, double t) {
        double r194106 = x;
        double r194107 = y;
        double r194108 = r194106 * r194107;
        double r194109 = z;
        double r194110 = r194108 + r194109;
        double r194111 = r194110 * r194107;
        double r194112 = t;
        double r194113 = r194111 + r194112;
        return r194113;
}

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