Average Error: 0.0 → 0.0
Time: 419.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 r27413 = x;
        double r27414 = y;
        double r27415 = r27413 + r27414;
        double r27416 = z;
        double r27417 = r27415 + r27416;
        return r27417;
}
↓
double f(double x, double y, double z) {
        double r27418 = x;
        double r27419 = y;
        double r27420 = r27418 + r27419;
        double r27421 = z;
        double r27422 = r27420 + r27421;
        return r27422;
}

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