Average Error: 0.0 → 0.0
Time: 712.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 r10356 = x;
        double r10357 = y;
        double r10358 = r10356 + r10357;
        double r10359 = z;
        double r10360 = r10358 + r10359;
        return r10360;
}
↓
double f(double x, double y, double z) {
        double r10361 = x;
        double r10362 = y;
        double r10363 = r10361 + r10362;
        double r10364 = z;
        double r10365 = r10363 + r10364;
        return r10365;
}

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