Average Error: 0.0 → 0.0
Time: 2.5s
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 r8173 = x;
        double r8174 = y;
        double r8175 = r8173 + r8174;
        double r8176 = z;
        double r8177 = r8175 * r8176;
        return r8177;
}
↓
double f(double x, double y, double z) {
        double r8178 = x;
        double r8179 = y;
        double r8180 = r8178 + r8179;
        double r8181 = z;
        double r8182 = r8180 * r8181;
        return r8182;
}

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