Average Error: 0.0 → 0.0
Time: 14.7s
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 r16064 = x;
        double r16065 = y;
        double r16066 = r16064 + r16065;
        double r16067 = z;
        double r16068 = r16066 * r16067;
        return r16068;
}
↓
double f(double x, double y, double z) {
        double r16069 = x;
        double r16070 = y;
        double r16071 = r16069 + r16070;
        double r16072 = z;
        double r16073 = r16071 * r16072;
        return r16073;
}

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