Average Error: 0.0 → 0.0
Time: 886.0ms
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 r29374 = x;
        double r29375 = y;
        double r29376 = r29374 + r29375;
        double r29377 = z;
        double r29378 = 1.0;
        double r29379 = r29377 + r29378;
        double r29380 = r29376 * r29379;
        return r29380;
}
↓
double f(double x, double y, double z) {
        double r29381 = x;
        double r29382 = y;
        double r29383 = r29381 + r29382;
        double r29384 = z;
        double r29385 = 1.0;
        double r29386 = r29384 + r29385;
        double r29387 = r29383 * r29386;
        return r29387;
}

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