Average Error: 0.0 → 0.0
Time: 1.5s
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 r34820 = x;
        double r34821 = y;
        double r34822 = r34820 + r34821;
        double r34823 = z;
        double r34824 = 1.0;
        double r34825 = r34823 + r34824;
        double r34826 = r34822 * r34825;
        return r34826;
}
↓
double f(double x, double y, double z) {
        double r34827 = x;
        double r34828 = y;
        double r34829 = r34827 + r34828;
        double r34830 = z;
        double r34831 = 1.0;
        double r34832 = r34830 + r34831;
        double r34833 = r34829 * r34832;
        return r34833;
}

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