Average Error: 0.0 → 0.0
Time: 2.0s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[z \cdot \left(x + y\right) + 1 \cdot \left(x + y\right)\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
z \cdot \left(x + y\right) + 1 \cdot \left(x + y\right)
double f(double x, double y, double z) {
        double r28975 = x;
        double r28976 = y;
        double r28977 = r28975 + r28976;
        double r28978 = z;
        double r28979 = 1.0;
        double r28980 = r28978 + r28979;
        double r28981 = r28977 * r28980;
        return r28981;
}
↓
double f(double x, double y, double z) {
        double r28982 = z;
        double r28983 = x;
        double r28984 = y;
        double r28985 = r28983 + r28984;
        double r28986 = r28982 * r28985;
        double r28987 = 1.0;
        double r28988 = r28987 * r28985;
        double r28989 = r28986 + r28988;
        return r28989;
}

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. Simplified0.0

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

  6. Final simplification0.0

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

Reproduce

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