Average Error: 0.0 → 0.0
Time: 8.6s
Precision: 64
\[\left(x + y\right) \cdot \left(z + 1\right)\]
↓
\[\left(x + y\right) \cdot \left(z + 1\right)\]
\left(x + y\right) \cdot \left(z + 1\right)
↓
\left(x + y\right) \cdot \left(z + 1\right)
double f(double x, double y, double z) {
        double r73736 = x;
        double r73737 = y;
        double r73738 = r73736 + r73737;
        double r73739 = z;
        double r73740 = 1.0;
        double r73741 = r73739 + r73740;
        double r73742 = r73738 * r73741;
        return r73742;
}
↓
double f(double x, double y, double z) {
        double r73743 = x;
        double r73744 = y;
        double r73745 = r73743 + r73744;
        double r73746 = z;
        double r73747 = 1.0;
        double r73748 = r73746 + r73747;
        double r73749 = r73745 * r73748;
        return r73749;
}

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

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

  3. Final simplification0.0

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

Reproduce

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