Average Error: 0.0 → 0.0
Time: 362.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 r29461 = x;
        double r29462 = y;
        double r29463 = r29461 + r29462;
        double r29464 = z;
        double r29465 = r29463 + r29464;
        return r29465;
}
↓
double f(double x, double y, double z) {
        double r29466 = x;
        double r29467 = y;
        double r29468 = r29466 + r29467;
        double r29469 = z;
        double r29470 = r29468 + r29469;
        return r29470;
}

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