Average Error: 0.0 → 0.0
Time: 7.3s
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 r32702 = x;
        double r32703 = y;
        double r32704 = r32702 + r32703;
        double r32705 = z;
        double r32706 = 1.0;
        double r32707 = r32705 + r32706;
        double r32708 = r32704 * r32707;
        return r32708;
}
↓
double f(double x, double y, double z) {
        double r32709 = x;
        double r32710 = y;
        double r32711 = r32709 + r32710;
        double r32712 = z;
        double r32713 = 1.0;
        double r32714 = r32712 + r32713;
        double r32715 = r32711 * r32714;
        return r32715;
}

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 2019212 +o rules:numerics
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, G"
  :precision binary64
  (* (+ x y) (+ z 1)))