Average Error: 0.0 → 0.0
Time: 403.0ms
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 r19439 = x;
        double r19440 = y;
        double r19441 = r19439 + r19440;
        double r19442 = z;
        double r19443 = r19441 + r19442;
        return r19443;
}
↓
double f(double x, double y, double z) {
        double r19444 = x;
        double r19445 = y;
        double r19446 = r19444 + r19445;
        double r19447 = z;
        double r19448 = r19446 + r19447;
        return r19448;
}

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 2020021 +o rules:numerics
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, I"
  :precision binary64
  (+ (+ x y) z))