Average Error: 0.0 → 0.0
Time: 408.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 r39226 = x;
        double r39227 = y;
        double r39228 = r39226 + r39227;
        double r39229 = z;
        double r39230 = r39228 + r39229;
        return r39230;
}
↓
double f(double x, double y, double z) {
        double r39231 = x;
        double r39232 = y;
        double r39233 = r39231 + r39232;
        double r39234 = z;
        double r39235 = r39233 + r39234;
        return r39235;
}

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