Average Error: 0.0 → 0.0
Time: 11.6s
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 r3142218 = x;
        double r3142219 = y;
        double r3142220 = r3142218 + r3142219;
        double r3142221 = 1.0;
        double r3142222 = z;
        double r3142223 = r3142221 - r3142222;
        double r3142224 = r3142220 * r3142223;
        return r3142224;
}
↓
double f(double x, double y, double z) {
        double r3142225 = x;
        double r3142226 = y;
        double r3142227 = r3142225 + r3142226;
        double r3142228 = 1.0;
        double r3142229 = z;
        double r3142230 = r3142228 - r3142229;
        double r3142231 = r3142227 * r3142230;
        return r3142231;
}

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