Average Error: 0.0 → 0.0
Time: 15.6s
Precision: 64
\[\left(x + y\right) \cdot z\]
\[\left(y + x\right) \cdot z\]
\left(x + y\right) \cdot z
\left(y + x\right) \cdot z
double f(double x, double y, double z) {
        double r1024190 = x;
        double r1024191 = y;
        double r1024192 = r1024190 + r1024191;
        double r1024193 = z;
        double r1024194 = r1024192 * r1024193;
        return r1024194;
}

double f(double x, double y, double z) {
        double r1024195 = y;
        double r1024196 = x;
        double r1024197 = r1024195 + r1024196;
        double r1024198 = z;
        double r1024199 = r1024197 * r1024198;
        return r1024199;
}

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(y + x\right) \cdot z\]

Reproduce

herbie shell --seed 2019162 +o rules:numerics
(FPCore (x y z)
  :name "Text.Parsec.Token:makeTokenParser from parsec-3.1.9, B"
  (* (+ x y) z))