Average Error: 0.0 → 0.0
Time: 8.5s
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 r41571 = x;
        double r41572 = y;
        double r41573 = r41571 + r41572;
        double r41574 = z;
        double r41575 = 1.0;
        double r41576 = r41574 + r41575;
        double r41577 = r41573 * r41576;
        return r41577;
}
↓
double f(double x, double y, double z) {
        double r41578 = x;
        double r41579 = y;
        double r41580 = r41578 + r41579;
        double r41581 = z;
        double r41582 = r41580 * r41581;
        double r41583 = 1.0;
        double r41584 = r41580 * r41583;
        double r41585 = r41582 + r41584;
        return r41585;
}

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