Average Error: 0.0 → 0.0
Time: 3.9s
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 r40294 = x;
        double r40295 = y;
        double r40296 = r40294 + r40295;
        double r40297 = z;
        double r40298 = r40296 + r40297;
        return r40298;
}
↓
double f(double x, double y, double z) {
        double r40299 = x;
        double r40300 = y;
        double r40301 = r40299 + r40300;
        double r40302 = z;
        double r40303 = r40301 + r40302;
        return r40303;
}

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