Average Error: 0.1 → 0.1
Time: 15.7s
Precision: 64
\[\left(x \cdot y + z\right) \cdot y + t\]
↓
\[y \cdot \left(z + x \cdot y\right) + t\]
\left(x \cdot y + z\right) \cdot y + t
↓
y \cdot \left(z + x \cdot y\right) + t
double f(double x, double y, double z, double t) {
        double r126962 = x;
        double r126963 = y;
        double r126964 = r126962 * r126963;
        double r126965 = z;
        double r126966 = r126964 + r126965;
        double r126967 = r126966 * r126963;
        double r126968 = t;
        double r126969 = r126967 + r126968;
        return r126969;
}
↓
double f(double x, double y, double z, double t) {
        double r126970 = y;
        double r126971 = z;
        double r126972 = x;
        double r126973 = r126972 * r126970;
        double r126974 = r126971 + r126973;
        double r126975 = r126970 * r126974;
        double r126976 = t;
        double r126977 = r126975 + r126976;
        return r126977;
}

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 y \cdot \left(z + x \cdot y\right) + t\]

Reproduce

herbie shell --seed 2019196 
(FPCore (x y z t)
  :name "Language.Haskell.HsColour.ColourHighlight:unbase from hscolour-1.23"
  (+ (* (+ (* x y) z) y) t))