Average Error: 0.0 → 0.0
Time: 3.7s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[\left(z + 1\right) \cdot \left(x + y\right)\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
\left(z + 1\right) \cdot \left(x + y\right)
double f(double x, double y, double z) {
        double r51914 = x;
        double r51915 = y;
        double r51916 = r51914 + r51915;
        double r51917 = z;
        double r51918 = 1.0;
        double r51919 = r51917 + r51918;
        double r51920 = r51916 * r51919;
        return r51920;
}
↓
double f(double x, double y, double z) {
        double r51921 = z;
        double r51922 = 1.0;
        double r51923 = r51921 + r51922;
        double r51924 = x;
        double r51925 = y;
        double r51926 = r51924 + r51925;
        double r51927 = r51923 * r51926;
        return r51927;
}

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. Using strategy rm

  3. Applied *-commutative0.0

    \[\leadsto \color{blue}{\left(z + 1\right) \cdot \left(x + y\right)}\]

  4. Final simplification0.0

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

Reproduce

herbie shell --seed 2020062 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, G"
  :precision binary64
  (* (+ x y) (+ z 1)))