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


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


WORST_CASE(?, O(n^1))
<?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><complexityInput><trsInput><trs><rules><rule><lhs><funapp><name>f</name><arg><var>x</var></arg><arg><funapp><name>a</name></funapp></arg></funapp></lhs><rhs><var>x</var></rhs></rule><rule><lhs><funapp><name>f</name><arg><var>x</var></arg><arg><funapp><name>g</name><arg><var>y</var></arg></funapp></arg></funapp></lhs><rhs><funapp><name>f</name><arg><funapp><name>g</name><arg><var>x</var></arg></funapp></arg><arg><var>y</var></arg></funapp></rhs></rule></rules></trs><strategy><innermost/></strategy></trsInput><runtimeComplexity><signature><symbol><name>a</name><arity>0</arity></symbol><symbol><name>g</name><arity>1</arity></symbol></signature><signature><symbol><name>f</name><arity>2</arity></symbol></signature></runtimeComplexity><polynomial>1</polynomial></complexityInput></input><cpfVersion>2.1</cpfVersion><proof><complexityProof><bounds><type><match/></type><bound>1</bound><finalStates><state>0</state></finalStates><treeAutomaton><finalStates><state>0</state><state>1</state></finalStates><transitions><transition><lhs><name>a</name><height>0</height></lhs><rhs><state>0</state></rhs></transition><transition><lhs><name>g</name><height>0</height><state>0</state></lhs><rhs><state>0</state></rhs></transition><transition><lhs><name>f</name><height>0</height><state>0</state><state>0</state></lhs><rhs><state>1</state></rhs></transition><transition><lhs><name>g</name><height>1</height><state>0</state></lhs><rhs><state>2</state></rhs></transition><transition><lhs><name>f</name><height>1</height><state>2</state><state>0</state></lhs><rhs><state>1</state></rhs></transition><transition><lhs><name>g</name><height>1</height><state>2</state></lhs><rhs><state>2</state></rhs></transition><transition><lhs><state>0</state></lhs><rhs><state>1</state></rhs></transition><transition><lhs><state>2</state></lhs><rhs><state>1</state></rhs></transition></transitions></treeAutomaton></bounds></complexityProof></proof><origin><proofOrigin><tool><name>AProVE</name><version>AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty
</version><strategy>Statistics for single proof: 100.00 % (1 real / 0 unknown / 0 assumptions / 1 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>