Average Error: 0.0 → 0.0
Time: 3.6s
Precision: 64
\[\left(x + y\right) \cdot z\]
↓
\[\left(x + y\right) \cdot z\]
\left(x + y\right) \cdot z
↓
\left(x + y\right) \cdot z
double f(double x, double y, double z) {
        double r3642 = x;
        double r3643 = y;
        double r3644 = r3642 + r3643;
        double r3645 = z;
        double r3646 = r3644 * r3645;
        return r3646;
}
↓
double f(double x, double y, double z) {
        double r3647 = x;
        double r3648 = y;
        double r3649 = r3647 + r3648;
        double r3650 = z;
        double r3651 = r3649 * r3650;
        return r3651;
}

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. Final simplification0.0

    \[\leadsto \left(x + y\right) \cdot z\]

Reproduce

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