Average Error: 0.0 → 0.0
Time: 7.3s
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 r15150 = x;
        double r15151 = y;
        double r15152 = r15150 + r15151;
        double r15153 = z;
        double r15154 = r15152 * r15153;
        return r15154;
}
↓
double f(double x, double y, double z) {
        double r15155 = x;
        double r15156 = y;
        double r15157 = r15155 + r15156;
        double r15158 = z;
        double r15159 = r15157 * r15158;
        return r15159;
}

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 2019294 
(FPCore (x y z)
  :name "Text.Parsec.Token:makeTokenParser from parsec-3.1.9, B"
  :precision binary64
  (* (+ x y) z))