Average Error: 0.0 → 0.0
Time: 11.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 r1022187 = x;
        double r1022188 = y;
        double r1022189 = r1022187 + r1022188;
        double r1022190 = z;
        double r1022191 = r1022189 * r1022190;
        return r1022191;
}
↓
double f(double x, double y, double z) {
        double r1022192 = x;
        double r1022193 = y;
        double r1022194 = r1022192 + r1022193;
        double r1022195 = z;
        double r1022196 = r1022194 * r1022195;
        return r1022196;
}

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