Average Error: 0.0 → 0.0
Time: 367.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 r31490 = x;
        double r31491 = y;
        double r31492 = r31490 + r31491;
        double r31493 = z;
        double r31494 = r31492 + r31493;
        return r31494;
}
↓
double f(double x, double y, double z) {
        double r31495 = x;
        double r31496 = y;
        double r31497 = r31495 + r31496;
        double r31498 = z;
        double r31499 = r31497 + r31498;
        return r31499;
}

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