Average Error: 0.0 → 0.0
Time: 8.8s
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 r58731 = x;
        double r58732 = y;
        double r58733 = r58731 + r58732;
        double r58734 = z;
        double r58735 = 1.0;
        double r58736 = r58734 + r58735;
        double r58737 = r58733 * r58736;
        return r58737;
}
↓
double f(double x, double y, double z) {
        double r58738 = x;
        double r58739 = y;
        double r58740 = r58738 + r58739;
        double r58741 = z;
        double r58742 = 1.0;
        double r58743 = r58741 + r58742;
        double r58744 = r58740 * r58743;
        return r58744;
}

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 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, G"
  (* (+ x y) (+ z 1.0)))