Average Error: 0.0 → 0.0
Time: 975.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 r24362 = x;
        double r24363 = y;
        double r24364 = r24362 + r24363;
        double r24365 = z;
        double r24366 = r24364 + r24365;
        return r24366;
}
↓
double f(double x, double y, double z) {
        double r24367 = x;
        double r24368 = y;
        double r24369 = r24367 + r24368;
        double r24370 = z;
        double r24371 = r24369 + r24370;
        return r24371;
}

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