Average Error: 0.0 → 0.0
Time: 422.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 r25904 = x;
        double r25905 = y;
        double r25906 = r25904 + r25905;
        double r25907 = z;
        double r25908 = r25906 + r25907;
        return r25908;
}
↓
double f(double x, double y, double z) {
        double r25909 = x;
        double r25910 = y;
        double r25911 = r25909 + r25910;
        double r25912 = z;
        double r25913 = r25911 + r25912;
        return r25913;
}

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