Average Error: 0.0 → 0.0
Time: 548.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 r31219 = x;
        double r31220 = y;
        double r31221 = r31219 + r31220;
        double r31222 = z;
        double r31223 = r31221 + r31222;
        return r31223;
}
↓
double f(double x, double y, double z) {
        double r31224 = x;
        double r31225 = y;
        double r31226 = r31224 + r31225;
        double r31227 = z;
        double r31228 = r31226 + r31227;
        return r31228;
}

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