Average Error: 0.0 → 0.0
Time: 2.0s
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 r44723 = x;
        double r44724 = y;
        double r44725 = r44723 + r44724;
        double r44726 = z;
        double r44727 = r44725 + r44726;
        return r44727;
}
↓
double f(double x, double y, double z) {
        double r44728 = x;
        double r44729 = y;
        double r44730 = r44728 + r44729;
        double r44731 = z;
        double r44732 = r44730 + r44731;
        return r44732;
}

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