Average Error: 0.0 → 0.0
Time: 32.0s
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 r746153 = x;
        double r746154 = y;
        double r746155 = r746153 + r746154;
        double r746156 = z;
        double r746157 = r746155 * r746156;
        return r746157;
}
↓
double f(double x, double y, double z) {
        double r746158 = x;
        double r746159 = y;
        double r746160 = r746158 + r746159;
        double r746161 = z;
        double r746162 = r746160 * r746161;
        return r746162;
}

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))