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 r39425 = x;
        double r39426 = y;
        double r39427 = r39425 + r39426;
        double r39428 = z;
        double r39429 = r39427 + r39428;
        return r39429;
}
↓
double f(double x, double y, double z) {
        double r39430 = x;
        double r39431 = y;
        double r39432 = r39430 + r39431;
        double r39433 = z;
        double r39434 = r39432 + r39433;
        return r39434;
}

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