Average Error: 0.0 → 0.0
Time: 481.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 r30579 = x;
        double r30580 = y;
        double r30581 = r30579 + r30580;
        double r30582 = z;
        double r30583 = r30581 + r30582;
        return r30583;
}
↓
double f(double x, double y, double z) {
        double r30584 = x;
        double r30585 = y;
        double r30586 = r30584 + r30585;
        double r30587 = z;
        double r30588 = r30586 + r30587;
        return r30588;
}

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