Average Error: 0.0 → 0.0
Time: 2.3s
Precision: binary64
Cost: 448
\[x \cdot y + z \cdot t \]
↓
\[x \cdot y + z \cdot t \]
(FPCore (x y z t) :precision binary64 (+ (* x y) (* z t)))
↓
(FPCore (x y z t) :precision binary64 (+ (* x y) (* z t)))
double code(double x, double y, double z, double t) {
	return (x * y) + (z * t);
}
↓
double code(double x, double y, double z, double t) {
	return (x * y) + (z * t);
}

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (x * y) + (z * t)
end function
↓
real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (x * y) + (z * t)
end function

public static double code(double x, double y, double z, double t) {
	return (x * y) + (z * t);
}
↓
public static double code(double x, double y, double z, double t) {
	return (x * y) + (z * t);
}

def code(x, y, z, t):
	return (x * y) + (z * t)
↓
def code(x, y, z, t):
	return (x * y) + (z * t)

function code(x, y, z, t)
	return Float64(Float64(x * y) + Float64(z * t))
end
↓
function code(x, y, z, t)
	return Float64(Float64(x * y) + Float64(z * t))
end

function tmp = code(x, y, z, t)
	tmp = (x * y) + (z * t);
end
↓
function tmp = code(x, y, z, t)
	tmp = (x * y) + (z * t);
end

code[x_, y_, z_, t_] := N[(N[(x * y), $MachinePrecision] + N[(z * t), $MachinePrecision]), $MachinePrecision]
↓
code[x_, y_, z_, t_] := N[(N[(x * y), $MachinePrecision] + N[(z * t), $MachinePrecision]), $MachinePrecision]

x \cdot y + z \cdot t
↓
x \cdot y + z \cdot t

Error

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x \cdot y + z \cdot t \]

  2. Final simplification0.0

    \[\leadsto x \cdot y + z \cdot t \]

Reproduce

herbie shell --seed 2022291 
(FPCore (x y z t)
  :name "Linear.V2:$cdot from linear-1.19.1.3, A"
  :precision binary64
  (+ (* x y) (* z t)))