Average Error: 0.0 → 0.0
Time: 7.5s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[\left(y + x\right) \cdot \left(z + 1\right)\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
\left(y + x\right) \cdot \left(z + 1\right)
double f(double x, double y, double z) {
        double r36344 = x;
        double r36345 = y;
        double r36346 = r36344 + r36345;
        double r36347 = z;
        double r36348 = 1.0;
        double r36349 = r36347 + r36348;
        double r36350 = r36346 * r36349;
        return r36350;
}
↓
double f(double x, double y, double z) {
        double r36351 = y;
        double r36352 = x;
        double r36353 = r36351 + r36352;
        double r36354 = z;
        double r36355 = 1.0;
        double r36356 = r36354 + r36355;
        double r36357 = r36353 * r36356;
        return r36357;
}

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

  2. Final simplification0.0

    \[\leadsto \left(y + x\right) \cdot \left(z + 1\right)\]

Reproduce

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