Average Error: 0.0 → 0.0
Time: 657.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 r15346 = x;
        double r15347 = y;
        double r15348 = r15346 + r15347;
        double r15349 = z;
        double r15350 = r15348 + r15349;
        return r15350;
}
↓
double f(double x, double y, double z) {
        double r15351 = x;
        double r15352 = y;
        double r15353 = r15351 + r15352;
        double r15354 = z;
        double r15355 = r15353 + r15354;
        return r15355;
}

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