Average Error: 0.0 → 0.0
Time: 2.3s
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 r38129 = x;
        double r38130 = y;
        double r38131 = r38129 + r38130;
        double r38132 = z;
        double r38133 = 1.0;
        double r38134 = r38132 + r38133;
        double r38135 = r38131 * r38134;
        return r38135;
}
↓
double f(double x, double y, double z) {
        double r38136 = z;
        double r38137 = 1.0;
        double r38138 = r38136 + r38137;
        double r38139 = x;
        double r38140 = y;
        double r38141 = r38139 + r38140;
        double r38142 = r38138 * r38141;
        return r38142;
}

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 2019353 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, G"
  :precision binary64
  (* (+ x y) (+ z 1)))