Average Error: 0.0 → 0.0
Time: 792.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 r29884 = x;
        double r29885 = y;
        double r29886 = r29884 + r29885;
        double r29887 = z;
        double r29888 = r29886 + r29887;
        return r29888;
}
↓
double f(double x, double y, double z) {
        double r29889 = x;
        double r29890 = y;
        double r29891 = r29889 + r29890;
        double r29892 = z;
        double r29893 = r29891 + r29892;
        return r29893;
}

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