Average Error: 0.0 → 0.0
Time: 2.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 r35502 = x;
        double r35503 = y;
        double r35504 = r35502 + r35503;
        double r35505 = z;
        double r35506 = 1.0;
        double r35507 = r35505 + r35506;
        double r35508 = r35504 * r35507;
        return r35508;
}
↓
double f(double x, double y, double z) {
        double r35509 = x;
        double r35510 = y;
        double r35511 = r35509 + r35510;
        double r35512 = z;
        double r35513 = 1.0;
        double r35514 = r35512 + r35513;
        double r35515 = r35511 * r35514;
        return r35515;
}

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