Average Error: 0.0 → 0.0
Time: 9.7s
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 r31123 = x;
        double r31124 = y;
        double r31125 = r31123 + r31124;
        double r31126 = z;
        double r31127 = 1.0;
        double r31128 = r31126 + r31127;
        double r31129 = r31125 * r31128;
        return r31129;
}
↓
double f(double x, double y, double z) {
        double r31130 = x;
        double r31131 = y;
        double r31132 = r31130 + r31131;
        double r31133 = z;
        double r31134 = r31132 * r31133;
        double r31135 = 1.0;
        double r31136 = r31135 * r31132;
        double r31137 = r31134 + r31136;
        return r31137;
}

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 2019325 +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)))