Average Error: 0.1 → 0.1
Time: 17.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 r112400 = x;
        double r112401 = y;
        double r112402 = r112400 * r112401;
        double r112403 = z;
        double r112404 = r112402 + r112403;
        double r112405 = r112404 * r112401;
        double r112406 = t;
        double r112407 = r112405 + r112406;
        return r112407;
}
↓
double f(double x, double y, double z, double t) {
        double r112408 = x;
        double r112409 = y;
        double r112410 = r112408 * r112409;
        double r112411 = z;
        double r112412 = r112410 + r112411;
        double r112413 = r112412 * r112409;
        double r112414 = t;
        double r112415 = r112413 + r112414;
        return r112415;
}

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