Average Error: 0.0 → 0.0
Time: 13.0s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[\left(y + x\right) \cdot 1 + \left(y + x\right) \cdot z\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
\left(y + x\right) \cdot 1 + \left(y + x\right) \cdot z
double f(double x, double y, double z) {
        double r2891029 = x;
        double r2891030 = y;
        double r2891031 = r2891029 + r2891030;
        double r2891032 = z;
        double r2891033 = 1.0;
        double r2891034 = r2891032 + r2891033;
        double r2891035 = r2891031 * r2891034;
        return r2891035;
}
↓
double f(double x, double y, double z) {
        double r2891036 = y;
        double r2891037 = x;
        double r2891038 = r2891036 + r2891037;
        double r2891039 = 1.0;
        double r2891040 = r2891038 * r2891039;
        double r2891041 = z;
        double r2891042 = r2891038 * r2891041;
        double r2891043 = r2891040 + r2891042;
        return r2891043;
}

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

Reproduce

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