Average Error: 0.0 → 0.0
Time: 358.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 r28881 = x;
        double r28882 = y;
        double r28883 = r28881 + r28882;
        double r28884 = z;
        double r28885 = r28883 + r28884;
        return r28885;
}
↓
double f(double x, double y, double z) {
        double r28886 = x;
        double r28887 = y;
        double r28888 = r28886 + r28887;
        double r28889 = z;
        double r28890 = r28888 + r28889;
        return r28890;
}

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