Average Error: 0.0 → 0.0
Time: 1.2s
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 r44513 = x;
        double r44514 = y;
        double r44515 = r44513 + r44514;
        double r44516 = z;
        double r44517 = r44515 + r44516;
        return r44517;
}
↓
double f(double x, double y, double z) {
        double r44518 = x;
        double r44519 = y;
        double r44520 = r44518 + r44519;
        double r44521 = z;
        double r44522 = r44520 + r44521;
        return r44522;
}

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