Average Error: 0.0 → 0.0
Time: 699.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 r39374 = x;
        double r39375 = y;
        double r39376 = r39374 + r39375;
        double r39377 = z;
        double r39378 = r39376 + r39377;
        return r39378;
}
↓
double f(double x, double y, double z) {
        double r39379 = x;
        double r39380 = y;
        double r39381 = r39379 + r39380;
        double r39382 = z;
        double r39383 = r39381 + r39382;
        return r39383;
}

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