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 r38195 = x;
        double r38196 = y;
        double r38197 = r38195 + r38196;
        double r38198 = z;
        double r38199 = 1.0;
        double r38200 = r38198 + r38199;
        double r38201 = r38197 * r38200;
        return r38201;
}
↓
double f(double x, double y, double z) {
        double r38202 = x;
        double r38203 = y;
        double r38204 = r38202 + r38203;
        double r38205 = z;
        double r38206 = r38204 * r38205;
        double r38207 = 1.0;
        double r38208 = r38204 * r38207;
        double r38209 = r38206 + r38208;
        return r38209;
}

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