Average Error: 0.0 → 0.0
Time: 818.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 r36408 = x;
        double r36409 = y;
        double r36410 = r36408 + r36409;
        double r36411 = z;
        double r36412 = r36410 + r36411;
        return r36412;
}
↓
double f(double x, double y, double z) {
        double r36413 = x;
        double r36414 = y;
        double r36415 = r36413 + r36414;
        double r36416 = z;
        double r36417 = r36415 + r36416;
        return r36417;
}

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