Average Error: 0.0 → 0.0
Time: 472.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 r25041 = x;
        double r25042 = y;
        double r25043 = r25041 + r25042;
        double r25044 = z;
        double r25045 = r25043 + r25044;
        return r25045;
}
↓
double f(double x, double y, double z) {
        double r25046 = x;
        double r25047 = y;
        double r25048 = r25046 + r25047;
        double r25049 = z;
        double r25050 = r25048 + r25049;
        return r25050;
}

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