Average Error: 0.0 → 0.0
Time: 396.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 r30014 = x;
        double r30015 = y;
        double r30016 = r30014 + r30015;
        double r30017 = z;
        double r30018 = r30016 + r30017;
        return r30018;
}
↓
double f(double x, double y, double z) {
        double r30019 = x;
        double r30020 = y;
        double r30021 = r30019 + r30020;
        double r30022 = z;
        double r30023 = r30021 + r30022;
        return r30023;
}

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