Average Error: 0.0 → 0.0
Time: 3.3s
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 r27423 = x;
        double r27424 = y;
        double r27425 = r27423 + r27424;
        double r27426 = z;
        double r27427 = r27425 + r27426;
        return r27427;
}
↓
double f(double x, double y, double z) {
        double r27428 = x;
        double r27429 = y;
        double r27430 = r27428 + r27429;
        double r27431 = z;
        double r27432 = r27430 + r27431;
        return r27432;
}

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