?

Average Error: 0.0 → 0.0
Time: 2.9s
Precision: binary64
Cost: 12992

?

\[\left(-1000 \leq ra \land ra \leq 1000\right) \land \left(-1000 \leq de \land de \leq 1000\right)\]
\[\cos ra \cdot \cos de \]
↓
\[\cos ra \cdot \cos de \]
(FPCore (ra de) :precision binary64 (* (cos ra) (cos de)))
↓
(FPCore (ra de) :precision binary64 (* (cos ra) (cos de)))
double code(double ra, double de) {
	return cos(ra) * cos(de);
}
↓
double code(double ra, double de) {
	return cos(ra) * cos(de);
}

real(8) function code(ra, de)
    real(8), intent (in) :: ra
    real(8), intent (in) :: de
    code = cos(ra) * cos(de)
end function
↓
real(8) function code(ra, de)
    real(8), intent (in) :: ra
    real(8), intent (in) :: de
    code = cos(ra) * cos(de)
end function

public static double code(double ra, double de) {
	return Math.cos(ra) * Math.cos(de);
}
↓
public static double code(double ra, double de) {
	return Math.cos(ra) * Math.cos(de);
}

def code(ra, de):
	return math.cos(ra) * math.cos(de)
↓
def code(ra, de):
	return math.cos(ra) * math.cos(de)

function code(ra, de)
	return Float64(cos(ra) * cos(de))
end
↓
function code(ra, de)
	return Float64(cos(ra) * cos(de))
end

function tmp = code(ra, de)
	tmp = cos(ra) * cos(de);
end
↓
function tmp = code(ra, de)
	tmp = cos(ra) * cos(de);
end

code[ra_, de_] := N[(N[Cos[ra], $MachinePrecision] * N[Cos[de], $MachinePrecision]), $MachinePrecision]
↓
code[ra_, de_] := N[(N[Cos[ra], $MachinePrecision] * N[Cos[de], $MachinePrecision]), $MachinePrecision]

\cos ra \cdot \cos de
↓
\cos ra \cdot \cos de

Error?

Try it out?

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation?

  1. Initial program 0.0

    \[\cos ra \cdot \cos de \]

  2. Final simplification0.0

    \[\leadsto \cos ra \cdot \cos de \]

Reproduce?

herbie shell --seed 1 
(FPCore (ra de)
  :name "cos(ra)*cos(de)"
  :precision binary64
  :pre (and (and (<= -1000.0 ra) (<= ra 1000.0)) (and (<= -1000.0 de) (<= de 1000.0)))
  (* (cos ra) (cos de)))