Average Error: 0.0 → 0.0
Time: 10.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 r2821032 = x;
        double r2821033 = y;
        double r2821034 = r2821032 + r2821033;
        double r2821035 = z;
        double r2821036 = 1.0;
        double r2821037 = r2821035 + r2821036;
        double r2821038 = r2821034 * r2821037;
        return r2821038;
}
↓
double f(double x, double y, double z) {
        double r2821039 = x;
        double r2821040 = y;
        double r2821041 = r2821039 + r2821040;
        double r2821042 = z;
        double r2821043 = 1.0;
        double r2821044 = r2821042 + r2821043;
        double r2821045 = r2821041 * r2821044;
        return r2821045;
}

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 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)))