Average Error: 0.0 → 0.0
Time: 360.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 r33596 = x;
        double r33597 = y;
        double r33598 = r33596 + r33597;
        double r33599 = z;
        double r33600 = r33598 + r33599;
        return r33600;
}
↓
double f(double x, double y, double z) {
        double r33601 = x;
        double r33602 = y;
        double r33603 = r33601 + r33602;
        double r33604 = z;
        double r33605 = r33603 + r33604;
        return r33605;
}

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