Average Error: 0.0 → 0.0
Time: 13.0s
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 r39676 = x;
        double r39677 = y;
        double r39678 = r39676 + r39677;
        double r39679 = z;
        double r39680 = 1.0;
        double r39681 = r39679 + r39680;
        double r39682 = r39678 * r39681;
        return r39682;
}
↓
double f(double x, double y, double z) {
        double r39683 = x;
        double r39684 = y;
        double r39685 = r39683 + r39684;
        double r39686 = z;
        double r39687 = 1.0;
        double r39688 = r39686 + r39687;
        double r39689 = r39685 * r39688;
        return r39689;
}

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