Average Error: 0.0 → 0.0
Time: 366.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 r31550 = x;
        double r31551 = y;
        double r31552 = r31550 + r31551;
        double r31553 = z;
        double r31554 = r31552 + r31553;
        return r31554;
}
↓
double f(double x, double y, double z) {
        double r31555 = x;
        double r31556 = y;
        double r31557 = r31555 + r31556;
        double r31558 = z;
        double r31559 = r31557 + r31558;
        return r31559;
}

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