Average Error: 0.0 → 0.0
Time: 361.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 r39695 = x;
        double r39696 = y;
        double r39697 = r39695 + r39696;
        double r39698 = z;
        double r39699 = r39697 + r39698;
        return r39699;
}
↓
double f(double x, double y, double z) {
        double r39700 = x;
        double r39701 = y;
        double r39702 = r39700 + r39701;
        double r39703 = z;
        double r39704 = r39702 + r39703;
        return r39704;
}

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