Average Error: 0.0 → 0.0
Time: 401.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 r29921 = x;
        double r29922 = y;
        double r29923 = r29921 + r29922;
        double r29924 = z;
        double r29925 = r29923 + r29924;
        return r29925;
}
↓
double f(double x, double y, double z) {
        double r29926 = x;
        double r29927 = y;
        double r29928 = r29926 + r29927;
        double r29929 = z;
        double r29930 = r29928 + r29929;
        return r29930;
}

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