Average Error: 0.0 → 0.0
Time: 809.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 r28425 = x;
        double r28426 = y;
        double r28427 = r28425 + r28426;
        double r28428 = z;
        double r28429 = r28427 + r28428;
        return r28429;
}
↓
double f(double x, double y, double z) {
        double r28430 = x;
        double r28431 = y;
        double r28432 = r28430 + r28431;
        double r28433 = z;
        double r28434 = r28432 + r28433;
        return r28434;
}

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