Average Error: 0.0 → 0.0
Time: 5.2s
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 r16385 = x;
        double r16386 = y;
        double r16387 = r16385 + r16386;
        double r16388 = z;
        double r16389 = r16387 * r16388;
        return r16389;
}
↓
double f(double x, double y, double z) {
        double r16390 = x;
        double r16391 = y;
        double r16392 = r16390 + r16391;
        double r16393 = z;
        double r16394 = r16392 * r16393;
        return r16394;
}

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