Average Error: 0.0 → 0.0
Time: 10.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 r17198 = x;
        double r17199 = y;
        double r17200 = r17198 + r17199;
        double r17201 = z;
        double r17202 = r17200 * r17201;
        return r17202;
}
↓
double f(double x, double y, double z) {
        double r17203 = x;
        double r17204 = y;
        double r17205 = r17203 + r17204;
        double r17206 = z;
        double r17207 = r17205 * r17206;
        return r17207;
}

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