Average Error: 0.0 → 0.0
Time: 4.6s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[\left(x + y\right) \cdot z + \left(x + y\right) \cdot 1\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
\left(x + y\right) \cdot z + \left(x + y\right) \cdot 1
double f(double x, double y, double z) {
        double r35176 = x;
        double r35177 = y;
        double r35178 = r35176 + r35177;
        double r35179 = z;
        double r35180 = 1.0;
        double r35181 = r35179 + r35180;
        double r35182 = r35178 * r35181;
        return r35182;
}
↓
double f(double x, double y, double z) {
        double r35183 = x;
        double r35184 = y;
        double r35185 = r35183 + r35184;
        double r35186 = z;
        double r35187 = r35185 * r35186;
        double r35188 = 1.0;
        double r35189 = r35185 * r35188;
        double r35190 = r35187 + r35189;
        return r35190;
}

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 distribute-lft-in0.0

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

  4. Final simplification0.0

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

Reproduce

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