Average Error: 0.0 → 0.0
Time: 18.2s
Precision: 64
\[\left(x + y\right) \cdot \left(1 - z\right)\]
↓
\[\left(x + y\right) \cdot \left(1 - z\right)\]
\left(x + y\right) \cdot \left(1 - z\right)
↓
\left(x + y\right) \cdot \left(1 - z\right)
double f(double x, double y, double z) {
        double r8243912 = x;
        double r8243913 = y;
        double r8243914 = r8243912 + r8243913;
        double r8243915 = 1.0;
        double r8243916 = z;
        double r8243917 = r8243915 - r8243916;
        double r8243918 = r8243914 * r8243917;
        return r8243918;
}
↓
double f(double x, double y, double z) {
        double r8243919 = x;
        double r8243920 = y;
        double r8243921 = r8243919 + r8243920;
        double r8243922 = 1.0;
        double r8243923 = z;
        double r8243924 = r8243922 - r8243923;
        double r8243925 = r8243921 * r8243924;
        return r8243925;
}

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(1 - z\right)\]

  2. Final simplification0.0

    \[\leadsto \left(x + y\right) \cdot \left(1 - z\right)\]

Reproduce

herbie shell --seed 2019173 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, H"
  (* (+ x y) (- 1.0 z)))