Average Error: 0.0 → 0.0
Time: 812.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 r44372 = x;
        double r44373 = y;
        double r44374 = r44372 + r44373;
        double r44375 = z;
        double r44376 = r44374 + r44375;
        return r44376;
}
↓
double f(double x, double y, double z) {
        double r44377 = x;
        double r44378 = y;
        double r44379 = r44377 + r44378;
        double r44380 = z;
        double r44381 = r44379 + r44380;
        return r44381;
}

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