Average Error: 0.0 → 0.0
Time: 555.0ms
Precision: 64
\[\left(x + y\right) + z\]
↓
\[x + \left(y + z\right)\]
\left(x + y\right) + z
↓
x + \left(y + z\right)
double f(double x, double y, double z) {
        double r24766 = x;
        double r24767 = y;
        double r24768 = r24766 + r24767;
        double r24769 = z;
        double r24770 = r24768 + r24769;
        return r24770;
}
↓
double f(double x, double y, double z) {
        double r24771 = x;
        double r24772 = y;
        double r24773 = z;
        double r24774 = r24772 + r24773;
        double r24775 = r24771 + r24774;
        return r24775;
}

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. Using strategy rm

  3. Applied associate-+l+0.0

    \[\leadsto \color{blue}{x + \left(y + z\right)}\]

  4. Final simplification0.0

    \[\leadsto x + \left(y + z\right)\]

Reproduce

herbie shell --seed 2019353 +o rules:numerics
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, I"
  :precision binary64
  (+ (+ x y) z))