Average Error: 0.1 → 0.1
Time: 4.0s
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 r163174 = x;
        double r163175 = y;
        double r163176 = r163174 * r163175;
        double r163177 = z;
        double r163178 = r163176 + r163177;
        double r163179 = r163178 * r163175;
        double r163180 = t;
        double r163181 = r163179 + r163180;
        return r163181;
}
↓
double f(double x, double y, double z, double t) {
        double r163182 = x;
        double r163183 = y;
        double r163184 = r163182 * r163183;
        double r163185 = z;
        double r163186 = r163184 + r163185;
        double r163187 = r163186 * r163183;
        double r163188 = t;
        double r163189 = r163187 + r163188;
        return r163189;
}

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 2020083 +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))