Average Error: 0.0 → 0.0
Time: 849.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 r33477 = x;
        double r33478 = y;
        double r33479 = r33477 + r33478;
        double r33480 = z;
        double r33481 = r33479 + r33480;
        return r33481;
}
↓
double f(double x, double y, double z) {
        double r33482 = x;
        double r33483 = y;
        double r33484 = r33482 + r33483;
        double r33485 = z;
        double r33486 = r33484 + r33485;
        return r33486;
}

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