Average Error: 0.0 → 0.0
Time: 365.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 r34600 = x;
        double r34601 = y;
        double r34602 = r34600 + r34601;
        double r34603 = z;
        double r34604 = r34602 + r34603;
        return r34604;
}
↓
double f(double x, double y, double z) {
        double r34605 = x;
        double r34606 = y;
        double r34607 = r34605 + r34606;
        double r34608 = z;
        double r34609 = r34607 + r34608;
        return r34609;
}

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