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


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


WORST_CASE(?,O(n^1))
<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="cpfHTML.xsl"?>
<certificationProblem xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:noNamespaceSchemaLocation="cpf.xsd"><input><complexityInput><trsInput><trs><rules><rule><lhs><funapp><name>f</name><arg><funapp><name>a</name></funapp></arg></funapp></lhs><rhs><funapp><name>f</name><arg><funapp><name>b</name></funapp></arg></funapp></rhs></rule><rule><lhs><funapp><name>g</name><arg><funapp><name>b</name></funapp></arg></funapp></lhs><rhs><funapp><name>g</name><arg><funapp><name>a</name></funapp></arg></funapp></rhs></rule></rules></trs><relativeRules><rules/></relativeRules></trsInput><derivationalComplexity><signature><symbol><name>a</name><arity>0</arity></symbol><symbol><name>b</name><arity>0</arity></symbol><symbol><name>f</name><arity>1</arity></symbol><symbol><name>g</name><arity>1</arity></symbol></signature></derivationalComplexity><polynomial>1</polynomial></complexityInput></input><cpfVersion>2.2</cpfVersion><proof><complexityProof><relativeBounds><bounds><type><match/></type><bound>1</bound><finalStates><state>1</state><state>2</state><state>3</state><state>4</state></finalStates><treeAutomaton><finalStates><state>1</state><state>6</state><state>2</state><state>5</state><state>3</state><state>4</state></finalStates><transitions><transition><lhs><name>a</name><height>0</height></lhs><rhs><state>1</state></rhs></transition><transition><lhs><name>a</name><height>1</height></lhs><rhs><state>6</state></rhs></transition><transition><lhs><name>b</name><height>0</height></lhs><rhs><state>2</state></rhs></transition><transition><lhs><name>b</name><height>1</height></lhs><rhs><state>5</state></rhs></transition><transition><lhs><name>f</name><height>0</height><state>1</state></lhs><rhs><state>3</state></rhs></transition><transition><lhs><name>f</name><height>0</height><state>2</state></lhs><rhs><state>3</state></rhs></transition><transition><lhs><name>f</name><height>0</height><state>3</state></lhs><rhs><state>3</state></rhs></transition><transition><lhs><name>f</name><height>0</height><state>4</state></lhs><rhs><state>3</state></rhs></transition><transition><lhs><name>f</name><height>1</height><state>5</state></lhs><rhs><state>3</state></rhs></transition><transition><lhs><name>g</name><height>0</height><state>1</state></lhs><rhs><state>4</state></rhs></transition><transition><lhs><name>g</name><height>0</height><state>2</state></lhs><rhs><state>4</state></rhs></transition><transition><lhs><name>g</name><height>0</height><state>3</state></lhs><rhs><state>4</state></rhs></transition><transition><lhs><name>g</name><height>0</height><state>4</state></lhs><rhs><state>4</state></rhs></transition><transition><lhs><name>g</name><height>1</height><state>6</state></lhs><rhs><state>4</state></rhs></transition></transitions></treeAutomaton></bounds><trs><rules><rule><lhs><funapp><name>f</name><arg><funapp><name>a</name></funapp></arg></funapp></lhs><rhs><funapp><name>f</name><arg><funapp><name>b</name></funapp></arg></funapp></rhs></rule><rule><lhs><funapp><name>g</name><arg><funapp><name>b</name></funapp></arg></funapp></lhs><rhs><funapp><name>g</name><arg><funapp><name>a</name></funapp></arg></funapp></rhs></rule></rules></trs><complexityProof><rIsEmpty/></complexityProof></relativeBounds></complexityProof></proof><origin><proofOrigin><tool><name>TcT</name><version/></tool></proofOrigin></origin></certificationProblem>