Average Error: 0.0 → 0.0
Time: 763.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 r28113 = x;
        double r28114 = y;
        double r28115 = r28113 + r28114;
        double r28116 = z;
        double r28117 = r28115 + r28116;
        return r28117;
}
↓
double f(double x, double y, double z) {
        double r28118 = x;
        double r28119 = y;
        double r28120 = r28118 + r28119;
        double r28121 = z;
        double r28122 = r28120 + r28121;
        return r28122;
}

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