# ?

Average Error: 0.0 → 0.0
Time: 3.3s
Precision: binary64
Cost: 6656

# ?

$-1000 \leq x \land x \leq 1000$
${x}^{5} - 10$
${x}^{5} + -10$
(FPCore (x) :precision binary64 (- (pow x 5.0) 10.0))
(FPCore (x) :precision binary64 (+ (pow x 5.0) -10.0))
double code(double x) {
return pow(x, 5.0) - 10.0;
}

double code(double x) {
return pow(x, 5.0) + -10.0;
}

real(8) function code(x)
real(8), intent (in) :: x
code = (x ** 5.0d0) - 10.0d0
end function

real(8) function code(x)
real(8), intent (in) :: x
code = (x ** 5.0d0) + (-10.0d0)
end function

public static double code(double x) {
return Math.pow(x, 5.0) - 10.0;
}

public static double code(double x) {
return Math.pow(x, 5.0) + -10.0;
}

def code(x):
return math.pow(x, 5.0) - 10.0

def code(x):
return math.pow(x, 5.0) + -10.0

function code(x)
return Float64((x ^ 5.0) - 10.0)
end

function code(x)
return Float64((x ^ 5.0) + -10.0)
end

function tmp = code(x)
tmp = (x ^ 5.0) - 10.0;
end

function tmp = code(x)
tmp = (x ^ 5.0) + -10.0;
end

code[x_] := N[(N[Power[x, 5.0], $MachinePrecision] - 10.0),$MachinePrecision]

code[x_] := N[(N[Power[x, 5.0], $MachinePrecision] + -10.0),$MachinePrecision]

{x}^{5} - 10

{x}^{5} + -10


# Try it out?

Results

 In Out
Enter valid numbers for all inputs

# Derivation?

1. Initial program 0.0

${x}^{5} - 10$
2. Final simplification0.0

$\leadsto {x}^{5} + -10$

# Reproduce?

herbie shell --seed 1
(FPCore (x)
:name "x^5 - 10"
:precision binary64
:pre (and (<= -1000.0 x) (<= x 1000.0))
(- (pow x 5.0) 10.0))