Average Error: 0.0 → 0.0
Time: 375.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 r35742 = x;
        double r35743 = y;
        double r35744 = r35742 + r35743;
        double r35745 = z;
        double r35746 = r35744 + r35745;
        return r35746;
}
↓
double f(double x, double y, double z) {
        double r35747 = x;
        double r35748 = y;
        double r35749 = r35747 + r35748;
        double r35750 = z;
        double r35751 = r35749 + r35750;
        return r35751;
}

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