Average Error: 0.1 → 0.1
Time: 4.2s
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 r145099 = x;
        double r145100 = y;
        double r145101 = r145099 * r145100;
        double r145102 = z;
        double r145103 = r145101 + r145102;
        double r145104 = r145103 * r145100;
        double r145105 = t;
        double r145106 = r145104 + r145105;
        return r145106;
}
↓
double f(double x, double y, double z, double t) {
        double r145107 = x;
        double r145108 = y;
        double r145109 = r145107 * r145108;
        double r145110 = z;
        double r145111 = r145109 + r145110;
        double r145112 = r145111 * r145108;
        double r145113 = t;
        double r145114 = r145112 + r145113;
        return r145114;
}

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