Average Error: 0.0 → 0.0
Time: 2.4s
Precision: 64
\[\left(x + y\right) + z\]
↓
\[\left(x + y\right) + z\]
\left(x + y\right) + z
↓
\left(x + y\right) + z
double f(double x, double y, double z) {
        double r49905 = x;
        double r49906 = y;
        double r49907 = r49905 + r49906;
        double r49908 = z;
        double r49909 = r49907 + r49908;
        return r49909;
}
↓
double f(double x, double y, double z) {
        double r49910 = x;
        double r49911 = y;
        double r49912 = r49910 + r49911;
        double r49913 = z;
        double r49914 = r49912 + r49913;
        return r49914;
}

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) + z\]

  2. Final simplification0.0

    \[\leadsto \left(x + y\right) + z\]

Reproduce

herbie shell --seed 2019325 +o rules:numerics
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, I"
  :precision binary64
  (+ (+ x y) z))