Average Error: 0.0 → 0.0
Time: 13.3s
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 r19006 = x;
        double r19007 = y;
        double r19008 = r19006 + r19007;
        double r19009 = z;
        double r19010 = r19008 * r19009;
        return r19010;
}
↓
double f(double x, double y, double z) {
        double r19011 = x;
        double r19012 = y;
        double r19013 = r19011 + r19012;
        double r19014 = z;
        double r19015 = r19013 * r19014;
        return r19015;
}

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