Average Error: 0.0 → 0.0
Time: 423.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 r41419 = x;
        double r41420 = y;
        double r41421 = r41419 + r41420;
        double r41422 = z;
        double r41423 = r41421 + r41422;
        return r41423;
}
↓
double f(double x, double y, double z) {
        double r41424 = x;
        double r41425 = y;
        double r41426 = r41424 + r41425;
        double r41427 = z;
        double r41428 = r41426 + r41427;
        return r41428;
}

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