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 r41221 = x;
        double r41222 = y;
        double r41223 = r41221 + r41222;
        double r41224 = z;
        double r41225 = r41223 + r41224;
        return r41225;
}
↓
double f(double x, double y, double z) {
        double r41226 = x;
        double r41227 = y;
        double r41228 = r41226 + r41227;
        double r41229 = z;
        double r41230 = r41228 + r41229;
        return r41230;
}

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