Average Error: 0.0 → 0.0
Time: 375.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 r18578 = x;
        double r18579 = y;
        double r18580 = r18578 + r18579;
        double r18581 = z;
        double r18582 = r18580 + r18581;
        return r18582;
}
↓
double f(double x, double y, double z) {
        double r18583 = x;
        double r18584 = y;
        double r18585 = r18583 + r18584;
        double r18586 = z;
        double r18587 = r18585 + r18586;
        return r18587;
}

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