Average Error: 0.0 → 0.0
Time: 7.1s
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 r12692 = x;
        double r12693 = y;
        double r12694 = r12692 + r12693;
        double r12695 = z;
        double r12696 = r12694 * r12695;
        return r12696;
}
↓
double f(double x, double y, double z) {
        double r12697 = x;
        double r12698 = y;
        double r12699 = r12697 + r12698;
        double r12700 = z;
        double r12701 = r12699 * r12700;
        return r12701;
}

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