Average Error: 0.0 → 0.0
Time: 10.3s
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 r766591 = x;
        double r766592 = y;
        double r766593 = r766591 + r766592;
        double r766594 = z;
        double r766595 = r766593 * r766594;
        return r766595;
}

double f(double x, double y, double z) {
        double r766596 = y;
        double r766597 = x;
        double r766598 = r766596 + r766597;
        double r766599 = z;
        double r766600 = r766598 * r766599;
        return r766600;
}

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