Average Error: 0.0 → 0.0
Time: 358.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 r32596 = x;
        double r32597 = y;
        double r32598 = r32596 + r32597;
        double r32599 = z;
        double r32600 = r32598 + r32599;
        return r32600;
}
↓
double f(double x, double y, double z) {
        double r32601 = x;
        double r32602 = y;
        double r32603 = r32601 + r32602;
        double r32604 = z;
        double r32605 = r32603 + r32604;
        return r32605;
}

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