Average Error: 0.0 → 0.0
Time: 723.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 r20019 = x;
        double r20020 = y;
        double r20021 = r20019 + r20020;
        double r20022 = z;
        double r20023 = r20021 + r20022;
        return r20023;
}
↓
double f(double x, double y, double z) {
        double r20024 = x;
        double r20025 = y;
        double r20026 = r20024 + r20025;
        double r20027 = z;
        double r20028 = r20026 + r20027;
        return r20028;
}

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