Average Error: 0.0 → 0.0
Time: 383.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 r33006 = x;
        double r33007 = y;
        double r33008 = r33006 + r33007;
        double r33009 = z;
        double r33010 = r33008 + r33009;
        return r33010;
}
↓
double f(double x, double y, double z) {
        double r33011 = x;
        double r33012 = y;
        double r33013 = r33011 + r33012;
        double r33014 = z;
        double r33015 = r33013 + r33014;
        return r33015;
}

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