Average Error: 0.0 → 0.0
Time: 12.5s
Precision: 64
\[\left(x + y\right) \cdot z\]
↓
\[z \cdot y + x \cdot z\]
\left(x + y\right) \cdot z
↓
z \cdot y + x \cdot z
double f(double x, double y, double z) {
        double r1090283 = x;
        double r1090284 = y;
        double r1090285 = r1090283 + r1090284;
        double r1090286 = z;
        double r1090287 = r1090285 * r1090286;
        return r1090287;
}
↓
double f(double x, double y, double z) {
        double r1090288 = z;
        double r1090289 = y;
        double r1090290 = r1090288 * r1090289;
        double r1090291 = x;
        double r1090292 = r1090291 * r1090288;
        double r1090293 = r1090290 + r1090292;
        return r1090293;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left(x + y\right) \cdot z\]
  2. Using strategy rm

  3. Applied add-sqr-sqrt29.8

    \[\leadsto \color{blue}{\sqrt{\left(x + y\right) \cdot z} \cdot \sqrt{\left(x + y\right) \cdot z}}\]

  4. Taylor expanded around inf 0.0

    \[\leadsto \color{blue}{z \cdot y + x \cdot z}\]

  5. Final simplification0.0

    \[\leadsto z \cdot y + x \cdot z\]

Reproduce

herbie shell --seed 2019164 
(FPCore (x y z)
  :name "Text.Parsec.Token:makeTokenParser from parsec-3.1.9, B"
  (* (+ x y) z))