Average Error: 0.0 → 0.0
Time: 362.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 r27900 = x;
        double r27901 = y;
        double r27902 = r27900 + r27901;
        double r27903 = z;
        double r27904 = r27902 + r27903;
        return r27904;
}
↓
double f(double x, double y, double z) {
        double r27905 = x;
        double r27906 = y;
        double r27907 = r27905 + r27906;
        double r27908 = z;
        double r27909 = r27907 + r27908;
        return r27909;
}

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