Average Error: 0.0 → 0.0
Time: 756.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 r28441 = x;
        double r28442 = y;
        double r28443 = r28441 + r28442;
        double r28444 = z;
        double r28445 = r28443 + r28444;
        return r28445;
}
↓
double f(double x, double y, double z) {
        double r28446 = x;
        double r28447 = y;
        double r28448 = r28446 + r28447;
        double r28449 = z;
        double r28450 = r28448 + r28449;
        return r28450;
}

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