Average Error: 0.0 → 0.0
Time: 4.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 r30112 = x;
        double r30113 = y;
        double r30114 = r30112 + r30113;
        double r30115 = 1.0;
        double r30116 = z;
        double r30117 = r30115 - r30116;
        double r30118 = r30114 * r30117;
        return r30118;
}
↓
double f(double x, double y, double z) {
        double r30119 = x;
        double r30120 = y;
        double r30121 = r30119 + r30120;
        double r30122 = 1.0;
        double r30123 = z;
        double r30124 = r30122 - r30123;
        double r30125 = r30121 * r30124;
        return r30125;
}

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