Average Error: 0.0 → 0.0
Time: 4.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 r37352 = x;
        double r37353 = y;
        double r37354 = r37352 + r37353;
        double r37355 = z;
        double r37356 = 1.0;
        double r37357 = r37355 + r37356;
        double r37358 = r37354 * r37357;
        return r37358;
}
↓
double f(double x, double y, double z) {
        double r37359 = x;
        double r37360 = y;
        double r37361 = r37359 + r37360;
        double r37362 = z;
        double r37363 = 1.0;
        double r37364 = r37362 + r37363;
        double r37365 = r37361 * r37364;
        return r37365;
}

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