Average Error: 0.0 → 0.0
Time: 38.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 r18172 = x;
        double r18173 = y;
        double r18174 = r18172 + r18173;
        double r18175 = z;
        double r18176 = r18174 * r18175;
        return r18176;
}
↓
double f(double x, double y, double z) {
        double r18177 = x;
        double r18178 = y;
        double r18179 = r18177 + r18178;
        double r18180 = z;
        double r18181 = r18179 * r18180;
        return r18181;
}

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