Average Error: 0.0 → 0.0
Time: 765.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 r27636 = x;
        double r27637 = y;
        double r27638 = r27636 + r27637;
        double r27639 = z;
        double r27640 = r27638 + r27639;
        return r27640;
}
↓
double f(double x, double y, double z) {
        double r27641 = x;
        double r27642 = y;
        double r27643 = r27641 + r27642;
        double r27644 = z;
        double r27645 = r27643 + r27644;
        return r27645;
}

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