Average Error: 0.0 → 0.0
Time: 2.9s
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 r26282 = x;
        double r26283 = y;
        double r26284 = r26282 + r26283;
        double r26285 = z;
        double r26286 = r26284 + r26285;
        return r26286;
}
↓
double f(double x, double y, double z) {
        double r26287 = x;
        double r26288 = y;
        double r26289 = r26287 + r26288;
        double r26290 = z;
        double r26291 = r26289 + r26290;
        return r26291;
}

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