Average Error: 0.0 → 0.0
Time: 865.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 r32718 = x;
        double r32719 = y;
        double r32720 = r32718 + r32719;
        double r32721 = z;
        double r32722 = r32720 + r32721;
        return r32722;
}
↓
double f(double x, double y, double z) {
        double r32723 = x;
        double r32724 = y;
        double r32725 = r32723 + r32724;
        double r32726 = z;
        double r32727 = r32725 + r32726;
        return r32727;
}

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