Average Error: 0.0 → 0.0
Time: 2.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 r57291 = x;
        double r57292 = y;
        double r57293 = r57291 + r57292;
        double r57294 = z;
        double r57295 = 1.0;
        double r57296 = r57294 + r57295;
        double r57297 = r57293 * r57296;
        return r57297;
}
↓
double f(double x, double y, double z) {
        double r57298 = x;
        double r57299 = y;
        double r57300 = r57298 + r57299;
        double r57301 = z;
        double r57302 = r57300 * r57301;
        double r57303 = 1.0;
        double r57304 = r57300 * r57303;
        double r57305 = r57302 + r57304;
        return r57305;
}

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