Average Error: 0.0 → 0.0
Time: 4.7s
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 r34306 = x;
        double r34307 = y;
        double r34308 = r34306 + r34307;
        double r34309 = z;
        double r34310 = 1.0;
        double r34311 = r34309 + r34310;
        double r34312 = r34308 * r34311;
        return r34312;
}
↓
double f(double x, double y, double z) {
        double r34313 = z;
        double r34314 = x;
        double r34315 = y;
        double r34316 = r34314 + r34315;
        double r34317 = r34313 * r34316;
        double r34318 = 1.0;
        double r34319 = r34316 * r34318;
        double r34320 = r34317 + r34319;
        return r34320;
}

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