Average Error: 0.0 → 0.0
Time: 653.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 r10298 = x;
        double r10299 = y;
        double r10300 = r10298 + r10299;
        double r10301 = z;
        double r10302 = r10300 + r10301;
        return r10302;
}
↓
double f(double x, double y, double z) {
        double r10303 = x;
        double r10304 = y;
        double r10305 = r10303 + r10304;
        double r10306 = z;
        double r10307 = r10305 + r10306;
        return r10307;
}

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