Average Error: 0.0 → 0.0
Time: 488.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 r23599 = x;
        double r23600 = y;
        double r23601 = r23599 + r23600;
        double r23602 = z;
        double r23603 = r23601 + r23602;
        return r23603;
}
↓
double f(double x, double y, double z) {
        double r23604 = x;
        double r23605 = y;
        double r23606 = r23604 + r23605;
        double r23607 = z;
        double r23608 = r23606 + r23607;
        return r23608;
}

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