Average Error: 0.0 → 0.0
Time: 11.4s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1.0\right)\]
↓
\[\left(x + y\right) \cdot 1.0 + \left(x + y\right) \cdot z\]
\left(x + y\right) \cdot \left(z + 1.0\right)
↓
\left(x + y\right) \cdot 1.0 + \left(x + y\right) \cdot z
double f(double x, double y, double z) {
        double r2350651 = x;
        double r2350652 = y;
        double r2350653 = r2350651 + r2350652;
        double r2350654 = z;
        double r2350655 = 1.0;
        double r2350656 = r2350654 + r2350655;
        double r2350657 = r2350653 * r2350656;
        return r2350657;
}
↓
double f(double x, double y, double z) {
        double r2350658 = x;
        double r2350659 = y;
        double r2350660 = r2350658 + r2350659;
        double r2350661 = 1.0;
        double r2350662 = r2350660 * r2350661;
        double r2350663 = z;
        double r2350664 = r2350660 * r2350663;
        double r2350665 = r2350662 + r2350664;
        return r2350665;
}

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.0\right)\]
  2. Using strategy rm

  3. Applied distribute-rgt-in0.0

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

  4. Final simplification0.0

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

Reproduce

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