Average Error: 0.1 → 0.1
Time: 9.4s
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 r121563 = x;
        double r121564 = y;
        double r121565 = r121563 * r121564;
        double r121566 = z;
        double r121567 = r121565 + r121566;
        double r121568 = r121567 * r121564;
        double r121569 = t;
        double r121570 = r121568 + r121569;
        return r121570;
}
↓
double f(double x, double y, double z, double t) {
        double r121571 = x;
        double r121572 = y;
        double r121573 = r121571 * r121572;
        double r121574 = z;
        double r121575 = r121573 + r121574;
        double r121576 = r121575 * r121572;
        double r121577 = t;
        double r121578 = r121576 + r121577;
        return r121578;
}

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