Average Error: 0.0 → 0.0
Time: 21.7s
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 r48937 = x;
        double r48938 = y;
        double r48939 = r48937 + r48938;
        double r48940 = 1.0;
        double r48941 = z;
        double r48942 = r48940 - r48941;
        double r48943 = r48939 * r48942;
        return r48943;
}
↓
double f(double x, double y, double z) {
        double r48944 = x;
        double r48945 = y;
        double r48946 = r48944 + r48945;
        double r48947 = 1.0;
        double r48948 = z;
        double r48949 = r48947 - r48948;
        double r48950 = r48946 * r48949;
        return r48950;
}

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