Average Error: 0.0 → 0.0
Time: 411.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 r22020 = x;
        double r22021 = y;
        double r22022 = r22020 + r22021;
        double r22023 = z;
        double r22024 = r22022 + r22023;
        return r22024;
}
↓
double f(double x, double y, double z) {
        double r22025 = x;
        double r22026 = y;
        double r22027 = r22025 + r22026;
        double r22028 = z;
        double r22029 = r22027 + r22028;
        return r22029;
}

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