Average Error: 0.0 → 0.0
Time: 10.0s
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 r40373 = x;
        double r40374 = y;
        double r40375 = r40373 + r40374;
        double r40376 = 1.0;
        double r40377 = z;
        double r40378 = r40376 - r40377;
        double r40379 = r40375 * r40378;
        return r40379;
}
↓
double f(double x, double y, double z) {
        double r40380 = x;
        double r40381 = y;
        double r40382 = r40380 + r40381;
        double r40383 = 1.0;
        double r40384 = z;
        double r40385 = r40383 - r40384;
        double r40386 = r40382 * r40385;
        return r40386;
}

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