Average Error: 0.0 → 0.0
Time: 1.1s
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 r1127317 = x;
        double r1127318 = y;
        double r1127319 = r1127317 + r1127318;
        double r1127320 = z;
        double r1127321 = r1127319 + r1127320;
        return r1127321;
}

double f(double x, double y, double z) {
        double r1127322 = z;
        double r1127323 = y;
        double r1127324 = x;
        double r1127325 = r1127323 + r1127324;
        double r1127326 = r1127322 + r1127325;
        return r1127326;
}

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