Average Error: 0.1 → 0.1
Time: 12.8s
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 r145425 = x;
        double r145426 = y;
        double r145427 = r145425 * r145426;
        double r145428 = z;
        double r145429 = r145427 + r145428;
        double r145430 = r145429 * r145426;
        double r145431 = t;
        double r145432 = r145430 + r145431;
        return r145432;
}
↓
double f(double x, double y, double z, double t) {
        double r145433 = x;
        double r145434 = y;
        double r145435 = r145433 * r145434;
        double r145436 = z;
        double r145437 = r145435 + r145436;
        double r145438 = r145437 * r145434;
        double r145439 = t;
        double r145440 = r145438 + r145439;
        return r145440;
}

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