Average Error: 0.0 → 0.0
Time: 1.8s
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 r44310 = x;
        double r44311 = y;
        double r44312 = r44310 + r44311;
        double r44313 = z;
        double r44314 = r44312 + r44313;
        return r44314;
}
↓
double f(double x, double y, double z) {
        double r44315 = x;
        double r44316 = y;
        double r44317 = r44315 + r44316;
        double r44318 = z;
        double r44319 = r44317 + r44318;
        return r44319;
}

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