Average Error: 0.0 → 0.0
Time: 387.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 r23652 = x;
        double r23653 = y;
        double r23654 = r23652 + r23653;
        double r23655 = z;
        double r23656 = r23654 + r23655;
        return r23656;
}
↓
double f(double x, double y, double z) {
        double r23657 = x;
        double r23658 = y;
        double r23659 = r23657 + r23658;
        double r23660 = z;
        double r23661 = r23659 + r23660;
        return r23661;
}

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