Average Error: 0.0 → 0.0
Time: 369.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 r21370 = x;
        double r21371 = y;
        double r21372 = r21370 + r21371;
        double r21373 = z;
        double r21374 = r21372 + r21373;
        return r21374;
}
↓
double f(double x, double y, double z) {
        double r21375 = x;
        double r21376 = y;
        double r21377 = r21375 + r21376;
        double r21378 = z;
        double r21379 = r21377 + r21378;
        return r21379;
}

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