Average Error: 0.0 → 0.0
Time: 478.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 r36470 = x;
        double r36471 = y;
        double r36472 = r36470 + r36471;
        double r36473 = z;
        double r36474 = r36472 + r36473;
        return r36474;
}
↓
double f(double x, double y, double z) {
        double r36475 = x;
        double r36476 = y;
        double r36477 = r36475 + r36476;
        double r36478 = z;
        double r36479 = r36477 + r36478;
        return r36479;
}

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