Average Error: 0.0 → 0.0
Time: 2.0s
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 r7148 = x;
        double r7149 = y;
        double r7150 = r7148 + r7149;
        double r7151 = z;
        double r7152 = r7150 * r7151;
        return r7152;
}
↓
double f(double x, double y, double z) {
        double r7153 = x;
        double r7154 = y;
        double r7155 = r7153 + r7154;
        double r7156 = z;
        double r7157 = r7155 * r7156;
        return r7157;
}

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