Average Error: 0.1 → 0.1
Time: 10.2s
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 r126478 = x;
        double r126479 = y;
        double r126480 = r126478 * r126479;
        double r126481 = z;
        double r126482 = r126480 + r126481;
        double r126483 = r126482 * r126479;
        double r126484 = t;
        double r126485 = r126483 + r126484;
        return r126485;
}
↓
double f(double x, double y, double z, double t) {
        double r126486 = y;
        double r126487 = z;
        double r126488 = x;
        double r126489 = r126488 * r126486;
        double r126490 = r126487 + r126489;
        double r126491 = r126486 * r126490;
        double r126492 = t;
        double r126493 = r126491 + r126492;
        return r126493;
}

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