Average Error: 0.0 → 0.0
Time: 2.9s
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 r10483 = x;
        double r10484 = y;
        double r10485 = r10483 + r10484;
        double r10486 = z;
        double r10487 = r10485 * r10486;
        return r10487;
}
↓
double f(double x, double y, double z) {
        double r10488 = x;
        double r10489 = y;
        double r10490 = r10488 + r10489;
        double r10491 = z;
        double r10492 = r10490 * r10491;
        return r10492;
}

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