?

Average Error: 0 → 0
Time: 1.5s
Precision: binary64
Cost: 320

?

\[-1000 \leq x \land x \leq 1000\]
\[\frac{x}{2} + 1 \]
↓
\[\frac{x}{2} + 1 \]
(FPCore (x) :precision binary64 (+ (/ x 2.0) 1.0))
↓
(FPCore (x) :precision binary64 (+ (/ x 2.0) 1.0))
double code(double x) {
	return (x / 2.0) + 1.0;
}
↓
double code(double x) {
	return (x / 2.0) + 1.0;
}

real(8) function code(x)
    real(8), intent (in) :: x
    code = (x / 2.0d0) + 1.0d0
end function
↓
real(8) function code(x)
    real(8), intent (in) :: x
    code = (x / 2.0d0) + 1.0d0
end function

public static double code(double x) {
	return (x / 2.0) + 1.0;
}
↓
public static double code(double x) {
	return (x / 2.0) + 1.0;
}

def code(x):
	return (x / 2.0) + 1.0
↓
def code(x):
	return (x / 2.0) + 1.0

function code(x)
	return Float64(Float64(x / 2.0) + 1.0)
end
↓
function code(x)
	return Float64(Float64(x / 2.0) + 1.0)
end

function tmp = code(x)
	tmp = (x / 2.0) + 1.0;
end
↓
function tmp = code(x)
	tmp = (x / 2.0) + 1.0;
end

code[x_] := N[(N[(x / 2.0), $MachinePrecision] + 1.0), $MachinePrecision]
↓
code[x_] := N[(N[(x / 2.0), $MachinePrecision] + 1.0), $MachinePrecision]

\frac{x}{2} + 1
↓
\frac{x}{2} + 1

Error?

Try it out?

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation?

  1. Initial program 0

    \[\frac{x}{2} + 1 \]

  2. Final simplification0

    \[\leadsto \frac{x}{2} + 1 \]

Reproduce?

herbie shell --seed 1 
(FPCore (x)
  :name "(x / 2) + 1"
  :precision binary64
  :pre (and (<= -1000.0 x) (<= x 1000.0))
  (+ (/ x 2.0) 1.0))