Average Error: 0.0 → 0.0
Time: 418.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 r23518 = x;
        double r23519 = y;
        double r23520 = r23518 + r23519;
        double r23521 = z;
        double r23522 = r23520 + r23521;
        return r23522;
}
↓
double f(double x, double y, double z) {
        double r23523 = x;
        double r23524 = y;
        double r23525 = r23523 + r23524;
        double r23526 = z;
        double r23527 = r23525 + r23526;
        return r23527;
}

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