Average Error: 0.0 → 0.0
Time: 774.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 r9805 = x;
        double r9806 = y;
        double r9807 = r9805 + r9806;
        double r9808 = z;
        double r9809 = r9807 + r9808;
        return r9809;
}
↓
double f(double x, double y, double z) {
        double r9810 = x;
        double r9811 = y;
        double r9812 = r9810 + r9811;
        double r9813 = z;
        double r9814 = r9812 + r9813;
        return r9814;
}

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