Average Error: 0.0 → 0.0
Time: 11.8s
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 r35013 = x;
        double r35014 = y;
        double r35015 = r35013 + r35014;
        double r35016 = z;
        double r35017 = 1.0;
        double r35018 = r35016 + r35017;
        double r35019 = r35015 * r35018;
        return r35019;
}
↓
double f(double x, double y, double z) {
        double r35020 = x;
        double r35021 = y;
        double r35022 = r35020 + r35021;
        double r35023 = z;
        double r35024 = 1.0;
        double r35025 = r35023 + r35024;
        double r35026 = r35022 * r35025;
        return r35026;
}

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