Average Error: 0.0 → 0.0
Time: 371.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 r41086 = x;
        double r41087 = y;
        double r41088 = r41086 + r41087;
        double r41089 = z;
        double r41090 = r41088 + r41089;
        return r41090;
}
↓
double f(double x, double y, double z) {
        double r41091 = x;
        double r41092 = y;
        double r41093 = r41091 + r41092;
        double r41094 = z;
        double r41095 = r41093 + r41094;
        return r41095;
}

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