Average Error: 0.1 → 0.1
Time: 3.3s
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 r121430 = x;
        double r121431 = y;
        double r121432 = r121430 * r121431;
        double r121433 = z;
        double r121434 = r121432 + r121433;
        double r121435 = r121434 * r121431;
        double r121436 = t;
        double r121437 = r121435 + r121436;
        return r121437;
}
↓
double f(double x, double y, double z, double t) {
        double r121438 = x;
        double r121439 = y;
        double r121440 = r121438 * r121439;
        double r121441 = z;
        double r121442 = r121440 + r121441;
        double r121443 = r121442 * r121439;
        double r121444 = t;
        double r121445 = r121443 + r121444;
        return r121445;
}

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