Average Error: 0.0 → 0.0
Time: 5.4s
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 r2391876 = x;
        double r2391877 = y;
        double r2391878 = r2391876 + r2391877;
        double r2391879 = z;
        double r2391880 = 1.0;
        double r2391881 = r2391879 + r2391880;
        double r2391882 = r2391878 * r2391881;
        return r2391882;
}
↓
double f(double x, double y, double z) {
        double r2391883 = y;
        double r2391884 = x;
        double r2391885 = r2391883 + r2391884;
        double r2391886 = z;
        double r2391887 = 1.0;
        double r2391888 = r2391886 + r2391887;
        double r2391889 = r2391885 * r2391888;
        return r2391889;
}

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