YES
<?xml version="1.0" encoding="UTF-8" standalone="no"?><?xml-stylesheet type="text/xsl" href="cpfHTML.xsl"?><certificationProblem xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:noNamespaceSchemaLocation="cpf.xsd"><input><trsInput><trs><rules><rule><lhs><funapp><name>fst</name><arg><funapp><name>0</name></funapp></arg><arg><var>Z</var></arg></funapp></lhs><rhs><funapp><name>nil</name></funapp></rhs></rule><rule><lhs><funapp><name>fst</name><arg><funapp><name>s</name></funapp></arg><arg><funapp><name>cons</name><arg><var>Y</var></arg></funapp></arg></funapp></lhs><rhs><funapp><name>cons</name><arg><var>Y</var></arg></funapp></rhs></rule><rule><lhs><funapp><name>from</name><arg><var>X</var></arg></funapp></lhs><rhs><funapp><name>cons</name><arg><var>X</var></arg></funapp></rhs></rule><rule><lhs><funapp><name>add</name><arg><funapp><name>0</name></funapp></arg><arg><var>X</var></arg></funapp></lhs><rhs><var>X</var></rhs></rule><rule><lhs><funapp><name>add</name><arg><funapp><name>s</name></funapp></arg><arg><var>Y</var></arg></funapp></lhs><rhs><funapp><name>s</name></funapp></rhs></rule><rule><lhs><funapp><name>len</name><arg><funapp><name>nil</name></funapp></arg></funapp></lhs><rhs><funapp><name>0</name></funapp></rhs></rule><rule><lhs><funapp><name>len</name><arg><funapp><name>cons</name><arg><var>X</var></arg></funapp></arg></funapp></lhs><rhs><funapp><name>s</name></funapp></rhs></rule></rules></trs><strategy><innermost/></strategy></trsInput></input><cpfVersion>2.1</cpfVersion><proof><trsTerminationProof><ruleRemoval><orderingConstraintProof><redPair><knuthBendixOrder><w0>1</w0><precedenceWeight><precedenceWeightEntry><name>0</name><arity>0</arity><precedence>1</precedence><weight>2</weight></precedenceWeightEntry><precedenceWeightEntry><name>nil</name><arity>0</arity><precedence>7</precedence><weight>1</weight></precedenceWeightEntry><precedenceWeightEntry><name>s</name><arity>0</arity><precedence>5</precedence><weight>3</weight></precedenceWeightEntry><precedenceWeightEntry><name>cons</name><arity>1</arity><precedence>2</precedence><weight>1</weight></precedenceWeightEntry><precedenceWeightEntry><name>from</name><arity>1</arity><precedence>3</precedence><weight>2</weight></precedenceWeightEntry><precedenceWeightEntry><name>len</name><arity>1</arity><precedence>6</precedence><weight>1</weight></precedenceWeightEntry><precedenceWeightEntry><name>fst</name><arity>2</arity><precedence>0</precedence><weight>0</weight></precedenceWeightEntry><precedenceWeightEntry><name>add</name><arity>2</arity><precedence>4</precedence><weight>0</weight></precedenceWeightEntry></precedenceWeight></knuthBendixOrder></redPair></orderingConstraintProof><trs><rules/></trs><trsTerminationProof><rIsEmpty/></trsTerminationProof></ruleRemoval></trsTerminationProof></proof><origin><proofOrigin><tool><name>AProVE</name><version>AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
</version><strategy>Statistics for single proof: 100.00 % (2 real / 0 unknown / 0 assumptions / 2 total proof steps)</strategy><url>http://aprove.informatik.rwth-aachen.de</url></tool><toolUser><firstName>John</firstName><lastName>Doe</lastName></toolUser></proofOrigin><inputOrigin/></origin></certificationProblem>