Average Error: 0.0 → 0.0
Time: 6.2s
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 r37076 = x;
        double r37077 = y;
        double r37078 = r37076 + r37077;
        double r37079 = z;
        double r37080 = 1.0;
        double r37081 = r37079 + r37080;
        double r37082 = r37078 * r37081;
        return r37082;
}
↓
double f(double x, double y, double z) {
        double r37083 = x;
        double r37084 = y;
        double r37085 = r37083 + r37084;
        double r37086 = z;
        double r37087 = 1.0;
        double r37088 = r37086 + r37087;
        double r37089 = r37085 * r37088;
        return r37089;
}

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