Average Error: 0.0 → 0.0
Time: 6.1s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[\left(x + y\right) \cdot z + 1 \cdot \left(x + y\right)\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
\left(x + y\right) \cdot z + 1 \cdot \left(x + y\right)
double f(double x, double y, double z) {
        double r25529 = x;
        double r25530 = y;
        double r25531 = r25529 + r25530;
        double r25532 = z;
        double r25533 = 1.0;
        double r25534 = r25532 + r25533;
        double r25535 = r25531 * r25534;
        return r25535;
}
↓
double f(double x, double y, double z) {
        double r25536 = x;
        double r25537 = y;
        double r25538 = r25536 + r25537;
        double r25539 = z;
        double r25540 = r25538 * r25539;
        double r25541 = 1.0;
        double r25542 = r25541 * r25538;
        double r25543 = r25540 + r25542;
        return r25543;
}

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. Simplified0.0

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

  5. Final simplification0.0

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

Reproduce

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