Average Error: 0.0 → 0.0
Time: 4.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 r47369 = x;
        double r47370 = y;
        double r47371 = r47369 + r47370;
        double r47372 = z;
        double r47373 = 1.0;
        double r47374 = r47372 + r47373;
        double r47375 = r47371 * r47374;
        return r47375;
}
↓
double f(double x, double y, double z) {
        double r47376 = x;
        double r47377 = y;
        double r47378 = r47376 + r47377;
        double r47379 = z;
        double r47380 = 1.0;
        double r47381 = r47379 + r47380;
        double r47382 = r47378 * r47381;
        return r47382;
}

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. Final simplification0.0

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

Reproduce

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