Average Error: 0.1 → 0.1
Time: 14.3s
Precision: 64
\[\frac{1}{2} \cdot \left(x + y \cdot \sqrt{z}\right)\]
↓
\[\frac{1}{2} \cdot \left(x + y \cdot \sqrt{z}\right)\]
\frac{1}{2} \cdot \left(x + y \cdot \sqrt{z}\right)
↓
\frac{1}{2} \cdot \left(x + y \cdot \sqrt{z}\right)
double f(double x, double y, double z) {
        double r287294 = 1.0;
        double r287295 = 2.0;
        double r287296 = r287294 / r287295;
        double r287297 = x;
        double r287298 = y;
        double r287299 = z;
        double r287300 = sqrt(r287299);
        double r287301 = r287298 * r287300;
        double r287302 = r287297 + r287301;
        double r287303 = r287296 * r287302;
        return r287303;
}
↓
double f(double x, double y, double z) {
        double r287304 = 1.0;
        double r287305 = 2.0;
        double r287306 = r287304 / r287305;
        double r287307 = x;
        double r287308 = y;
        double r287309 = z;
        double r287310 = sqrt(r287309);
        double r287311 = r287308 * r287310;
        double r287312 = r287307 + r287311;
        double r287313 = r287306 * r287312;
        return r287313;
}

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.1

    \[\frac{1}{2} \cdot \left(x + y \cdot \sqrt{z}\right)\]

  2. Final simplification0.1

    \[\leadsto \frac{1}{2} \cdot \left(x + y \cdot \sqrt{z}\right)\]

Reproduce

herbie shell --seed 2019350 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, B"
  :precision binary64
  (* (/ 1 2) (+ x (* y (sqrt z)))))