Average Error: 0.0 → 0.0
Time: 370.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 r55726 = x;
        double r55727 = y;
        double r55728 = r55726 + r55727;
        double r55729 = z;
        double r55730 = r55728 + r55729;
        return r55730;
}
↓
double f(double x, double y, double z) {
        double r55731 = x;
        double r55732 = y;
        double r55733 = r55731 + r55732;
        double r55734 = z;
        double r55735 = r55733 + r55734;
        return r55735;
}

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