Average Error: 0.0 → 0.0
Time: 373.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 r32982 = x;
        double r32983 = y;
        double r32984 = r32982 + r32983;
        double r32985 = z;
        double r32986 = r32984 + r32985;
        return r32986;
}
↓
double f(double x, double y, double z) {
        double r32987 = x;
        double r32988 = y;
        double r32989 = r32987 + r32988;
        double r32990 = z;
        double r32991 = r32989 + r32990;
        return r32991;
}

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