Average Error: 0.0 → 0.0
Time: 1.1s
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 r24852 = x;
        double r24853 = y;
        double r24854 = r24852 + r24853;
        double r24855 = z;
        double r24856 = 1.0;
        double r24857 = r24855 + r24856;
        double r24858 = r24854 * r24857;
        return r24858;
}
↓
double f(double x, double y, double z) {
        double r24859 = x;
        double r24860 = y;
        double r24861 = r24859 + r24860;
        double r24862 = z;
        double r24863 = 1.0;
        double r24864 = r24862 + r24863;
        double r24865 = r24861 * r24864;
        return r24865;
}

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