Average Error: 0.0 → 0.0
Time: 21.4s
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 r12863 = x;
        double r12864 = y;
        double r12865 = r12863 + r12864;
        double r12866 = z;
        double r12867 = r12865 * r12866;
        return r12867;
}
↓
double f(double x, double y, double z) {
        double r12868 = x;
        double r12869 = y;
        double r12870 = r12868 + r12869;
        double r12871 = z;
        double r12872 = r12870 * r12871;
        return r12872;
}

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