Average Error: 0.0 → 0.0
Time: 3.5s
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 r55082 = x;
        double r55083 = y;
        double r55084 = r55082 + r55083;
        double r55085 = z;
        double r55086 = 1.0;
        double r55087 = r55085 + r55086;
        double r55088 = r55084 * r55087;
        return r55088;
}
↓
double f(double x, double y, double z) {
        double r55089 = x;
        double r55090 = y;
        double r55091 = r55089 + r55090;
        double r55092 = z;
        double r55093 = 1.0;
        double r55094 = r55092 + r55093;
        double r55095 = r55091 * r55094;
        return r55095;
}

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