Average Error: 0.0 → 0.0
Time: 800.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 r44733 = x;
        double r44734 = y;
        double r44735 = r44733 + r44734;
        double r44736 = z;
        double r44737 = r44735 + r44736;
        return r44737;
}
↓
double f(double x, double y, double z) {
        double r44738 = x;
        double r44739 = y;
        double r44740 = r44738 + r44739;
        double r44741 = z;
        double r44742 = r44740 + r44741;
        return r44742;
}

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