Average Error: 0.0 → 0.0
Time: 373.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 r737 = x;
        double r738 = y;
        double r739 = r737 + r738;
        double r740 = z;
        double r741 = r739 + r740;
        return r741;
}
↓
double f(double x, double y, double z) {
        double r742 = x;
        double r743 = y;
        double r744 = r742 + r743;
        double r745 = z;
        double r746 = r744 + r745;
        return r746;
}

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