Average Error: 0.0 → 0.0
Time: 372.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 r23024 = x;
        double r23025 = y;
        double r23026 = r23024 + r23025;
        double r23027 = z;
        double r23028 = r23026 + r23027;
        return r23028;
}
↓
double f(double x, double y, double z) {
        double r23029 = x;
        double r23030 = y;
        double r23031 = r23029 + r23030;
        double r23032 = z;
        double r23033 = r23031 + r23032;
        return r23033;
}

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