Average Error: 0.0 → 0
Time: 1.1s
Precision: binary64
\[x + \frac{y - x}{2} \]
↓
\[0.5 \cdot \left(x + y\right) \]
(FPCore (x y) :precision binary64 (+ x (/ (- y x) 2.0)))
↓
(FPCore (x y) :precision binary64 (* 0.5 (+ x y)))
double code(double x, double y) {
	return x + ((y - x) / 2.0);
}
↓
double code(double x, double y) {
	return 0.5 * (x + y);
}

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x + ((y - x) / 2.0d0)
end function
↓
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = 0.5d0 * (x + y)
end function

public static double code(double x, double y) {
	return x + ((y - x) / 2.0);
}
↓
public static double code(double x, double y) {
	return 0.5 * (x + y);
}

def code(x, y):
	return x + ((y - x) / 2.0)
↓
def code(x, y):
	return 0.5 * (x + y)

function code(x, y)
	return Float64(x + Float64(Float64(y - x) / 2.0))
end
↓
function code(x, y)
	return Float64(0.5 * Float64(x + y))
end

function tmp = code(x, y)
	tmp = x + ((y - x) / 2.0);
end
↓
function tmp = code(x, y)
	tmp = 0.5 * (x + y);
end

code[x_, y_] := N[(x + N[(N[(y - x), $MachinePrecision] / 2.0), $MachinePrecision]), $MachinePrecision]
↓
code[x_, y_] := N[(0.5 * N[(x + y), $MachinePrecision]), $MachinePrecision]

x + \frac{y - x}{2}
↓
0.5 \cdot \left(x + y\right)

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.0
Target0
Herbie0
\[0.5 \cdot \left(x + y\right) \]

Derivation

  1. Initial program 0.0

    \[x + \frac{y - x}{2} \]

  2. Simplified0

    \[\leadsto \color{blue}{0.5 \cdot \left(x + y\right)} \]

  3. Final simplification0

    \[\leadsto 0.5 \cdot \left(x + y\right) \]

Reproduce

herbie shell --seed 2022131 
(FPCore (x y)
  :name "Numeric.Interval.Internal:bisect from intervals-0.7.1, A"
  :precision binary64

  :herbie-target
  (* 0.5 (+ x y))

  (+ x (/ (- y x) 2.0)))