Average Error: 0.0 → 0.0
Time: 379.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 r40032 = x;
        double r40033 = y;
        double r40034 = r40032 + r40033;
        double r40035 = z;
        double r40036 = r40034 + r40035;
        return r40036;
}
↓
double f(double x, double y, double z) {
        double r40037 = x;
        double r40038 = y;
        double r40039 = r40037 + r40038;
        double r40040 = z;
        double r40041 = r40039 + r40040;
        return r40041;
}

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