Average Error: 0.0 → 0.0
Time: 423.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 r29552 = x;
        double r29553 = y;
        double r29554 = r29552 + r29553;
        double r29555 = z;
        double r29556 = r29554 + r29555;
        return r29556;
}
↓
double f(double x, double y, double z) {
        double r29557 = x;
        double r29558 = y;
        double r29559 = r29557 + r29558;
        double r29560 = z;
        double r29561 = r29559 + r29560;
        return r29561;
}

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