Average Error: 0.0 → 0.0
Time: 359.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 r23341 = x;
        double r23342 = y;
        double r23343 = r23341 + r23342;
        double r23344 = z;
        double r23345 = r23343 + r23344;
        return r23345;
}
↓
double f(double x, double y, double z) {
        double r23346 = x;
        double r23347 = y;
        double r23348 = r23346 + r23347;
        double r23349 = z;
        double r23350 = r23348 + r23349;
        return r23350;
}

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