Average Error: 0.0 → 0.0
Time: 394.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 r24515 = x;
        double r24516 = y;
        double r24517 = r24515 + r24516;
        double r24518 = z;
        double r24519 = r24517 + r24518;
        return r24519;
}
↓
double f(double x, double y, double z) {
        double r24520 = x;
        double r24521 = y;
        double r24522 = r24520 + r24521;
        double r24523 = z;
        double r24524 = r24522 + r24523;
        return r24524;
}

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