Average Error: 0.0 → 0.0
Time: 939.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 r19021 = x;
        double r19022 = y;
        double r19023 = r19021 + r19022;
        double r19024 = z;
        double r19025 = r19023 + r19024;
        return r19025;
}
↓
double f(double x, double y, double z) {
        double r19026 = x;
        double r19027 = y;
        double r19028 = r19026 + r19027;
        double r19029 = z;
        double r19030 = r19028 + r19029;
        return r19030;
}

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