Average Error: 0.0 → 0.0
Time: 1.4s
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 r28698 = x;
        double r28699 = y;
        double r28700 = r28698 + r28699;
        double r28701 = z;
        double r28702 = 1.0;
        double r28703 = r28701 + r28702;
        double r28704 = r28700 * r28703;
        return r28704;
}
↓
double f(double x, double y, double z) {
        double r28705 = x;
        double r28706 = y;
        double r28707 = r28705 + r28706;
        double r28708 = z;
        double r28709 = 1.0;
        double r28710 = r28708 + r28709;
        double r28711 = r28707 * r28710;
        return r28711;
}

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