Average Error: 0.0 → 0.0
Time: 1.2s
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 r28463 = x;
        double r28464 = y;
        double r28465 = r28463 + r28464;
        double r28466 = z;
        double r28467 = r28465 + r28466;
        return r28467;
}
↓
double f(double x, double y, double z) {
        double r28468 = x;
        double r28469 = y;
        double r28470 = r28468 + r28469;
        double r28471 = z;
        double r28472 = r28470 + r28471;
        return r28472;
}

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))