/export/starexec/sandbox/solver/bin/starexec_run_certified /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


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>or</name><arg><funapp><name>true</name></funapp></arg><arg><var>y</var></arg></funapp></lhs><rhs><funapp><name>true</name></funapp></rhs></rule><rule><lhs><funapp><name>or</name><arg><var>x</var></arg><arg><funapp><name>true</name></funapp></arg></funapp></lhs><rhs><funapp><name>true</name></funapp></rhs></rule><rule><lhs><funapp><name>or</name><arg><funapp><name>false</name></funapp></arg><arg><funapp><name>false</name></funapp></arg></funapp></lhs><rhs><funapp><name>false</name></funapp></rhs></rule><rule><lhs><funapp><name>mem</name><arg><var>x</var></arg><arg><funapp><name>nil</name></funapp></arg></funapp></lhs><rhs><funapp><name>false</name></funapp></rhs></rule><rule><lhs><funapp><name>mem</name><arg><var>x</var></arg><arg><funapp><name>set</name><arg><var>y</var></arg></funapp></arg></funapp></lhs><rhs><funapp><name>=</name><arg><var>x</var></arg><arg><var>y</var></arg></funapp></rhs></rule><rule><lhs><funapp><name>mem</name><arg><var>x</var></arg><arg><funapp><name>union</name><arg><var>y</var></arg><arg><var>z</var></arg></funapp></arg></funapp></lhs><rhs><funapp><name>or</name><arg><funapp><name>mem</name><arg><var>x</var></arg><arg><var>y</var></arg></funapp></arg><arg><funapp><name>mem</name><arg><var>x</var></arg><arg><var>z</var></arg></funapp></arg></funapp></rhs></rule></rules></trs></trsInput></input><cpfVersion>2.1</cpfVersion><proof><trsTerminationProof><ruleRemoval><orderingConstraintProof><redPair><pathOrder><statusPrecedence><statusPrecedenceEntry><name>or</name><arity>2</arity><precedence>1</precedence><lex/></statusPrecedenceEntry><statusPrecedenceEntry><name>true</name><arity>0</arity><precedence>0</precedence><lex/></statusPrecedenceEntry><statusPrecedenceEntry><name>false</name><arity>0</arity><precedence>0</precedence><lex/></statusPrecedenceEntry><statusPrecedenceEntry><name>mem</name><arity>2</arity><precedence>2</precedence><lex/></statusPrecedenceEntry><statusPrecedenceEntry><name>nil</name><arity>0</arity><precedence>0</precedence><lex/></statusPrecedenceEntry><statusPrecedenceEntry><name>=</name><arity>2</arity><precedence>2</precedence><lex/></statusPrecedenceEntry><statusPrecedenceEntry><name>union</name><arity>2</arity><precedence>3</precedence><lex/></statusPrecedenceEntry></statusPrecedence><argumentFilter><argumentFilterEntry><name>or</name><arity>2</arity><nonCollapsing><position>2</position><position>1</position></nonCollapsing></argumentFilterEntry><argumentFilterEntry><name>true</name><arity>0</arity><nonCollapsing/></argumentFilterEntry><argumentFilterEntry><name>false</name><arity>0</arity><nonCollapsing/></argumentFilterEntry><argumentFilterEntry><name>mem</name><arity>2</arity><nonCollapsing><position>1</position><position>2</position></nonCollapsing></argumentFilterEntry><argumentFilterEntry><name>nil</name><arity>0</arity><nonCollapsing/></argumentFilterEntry><argumentFilterEntry><name>set</name><arity>1</arity><collapsing>1</collapsing></argumentFilterEntry><argumentFilterEntry><name>=</name><arity>2</arity><nonCollapsing><position>1</position><position>2</position></nonCollapsing></argumentFilterEntry><argumentFilterEntry><name>union</name><arity>2</arity><nonCollapsing><position>2</position><position>1</position></nonCollapsing></argumentFilterEntry></argumentFilter></pathOrder></redPair></orderingConstraintProof><trs><rules><rule><lhs><funapp><name>mem</name><arg><var>x</var></arg><arg><funapp><name>set</name><arg><var>y</var></arg></funapp></arg></funapp></lhs><rhs><funapp><name>=</name><arg><var>x</var></arg><arg><var>y</var></arg></funapp></rhs></rule></rules></trs><trsTerminationProof><ruleRemoval><orderingConstraintProof><redPair><knuthBendixOrder><w0>1</w0><precedenceWeight><precedenceWeightEntry><name>set</name><arity>1</arity><precedence>2</precedence><weight>1</weight></precedenceWeightEntry><precedenceWeightEntry><name>mem</name><arity>2</arity><precedence>1</precedence><weight>0</weight></precedenceWeightEntry><precedenceWeightEntry><name>=</name><arity>2</arity><precedence>0</precedence><weight>1</weight></precedenceWeightEntry></precedenceWeight></knuthBendixOrder></redPair></orderingConstraintProof><trs><rules/></trs><trsTerminationProof><rIsEmpty/></trsTerminationProof></ruleRemoval></trsTerminationProof></ruleRemoval></trsTerminationProof></proof><origin><proofOrigin><tool><name>AProVE</name><version>AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty
</version><strategy>Statistics for single proof: 100.00 % (3 real / 0 unknown / 0 assumptions / 3 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>