Average Error: 0.0 → 0.0
Time: 4.4s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[z \cdot \left(x + y\right) + \left(x + y\right) \cdot 1\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
z \cdot \left(x + y\right) + \left(x + y\right) \cdot 1
double f(double x, double y, double z) {
        double r51740 = x;
        double r51741 = y;
        double r51742 = r51740 + r51741;
        double r51743 = z;
        double r51744 = 1.0;
        double r51745 = r51743 + r51744;
        double r51746 = r51742 * r51745;
        return r51746;
}
↓
double f(double x, double y, double z) {
        double r51747 = z;
        double r51748 = x;
        double r51749 = y;
        double r51750 = r51748 + r51749;
        double r51751 = r51747 * r51750;
        double r51752 = 1.0;
        double r51753 = r51750 * r51752;
        double r51754 = r51751 + r51753;
        return r51754;
}

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 \color{blue}{z \cdot \left(x + y\right)} + \left(x + y\right) \cdot 1\]

  5. Final simplification0.0

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

Reproduce

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