Basic ordering on skip-detect problems.
(sd-problem-> x y) → *
Function:
(defun sd-problem-> (x y) (declare (xargs :guard (and (sd-problem-p x) (sd-problem-p y)))) (let ((__function__ 'sd-problem->)) (declare (ignorable __function__)) (> (sd-problem-score x) (sd-problem-score y))))
Theorem:
(defthm sd-problem->-transitive (implies (and (sd-problem-> x y) (sd-problem-> y z)) (sd-problem-> x z)))