Average Error: 0.1 → 0.1
Time: 12.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 r106701 = x;
        double r106702 = y;
        double r106703 = r106701 * r106702;
        double r106704 = z;
        double r106705 = r106703 + r106704;
        double r106706 = r106705 * r106702;
        double r106707 = t;
        double r106708 = r106706 + r106707;
        return r106708;
}
↓
double f(double x, double y, double z, double t) {
        double r106709 = x;
        double r106710 = y;
        double r106711 = r106709 * r106710;
        double r106712 = z;
        double r106713 = r106711 + r106712;
        double r106714 = r106713 * r106710;
        double r106715 = t;
        double r106716 = r106714 + r106715;
        return r106716;
}

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