Average Error: 0.0 → 0.0
Time: 785.0ms
Precision: 64
\[\left(x + y\right) + z\]
\[z + \left(y + x\right)\]
\left(x + y\right) + z
z + \left(y + x\right)
double f(double x, double y, double z) {
        double r2005826 = x;
        double r2005827 = y;
        double r2005828 = r2005826 + r2005827;
        double r2005829 = z;
        double r2005830 = r2005828 + r2005829;
        return r2005830;
}

double f(double x, double y, double z) {
        double r2005831 = z;
        double r2005832 = y;
        double r2005833 = x;
        double r2005834 = r2005832 + r2005833;
        double r2005835 = r2005831 + r2005834;
        return r2005835;
}

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 z + \left(y + x\right)\]

Reproduce

herbie shell --seed 2019158 +o rules:numerics
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, I"
  (+ (+ x y) z))