Average Error: 0.0 → 0.0
Time: 15.8s
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 r34581 = x;
        double r34582 = y;
        double r34583 = r34581 + r34582;
        double r34584 = z;
        double r34585 = r34583 * r34584;
        return r34585;
}
↓
double f(double x, double y, double z) {
        double r34586 = x;
        double r34587 = y;
        double r34588 = r34586 + r34587;
        double r34589 = z;
        double r34590 = r34588 * r34589;
        return r34590;
}

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