Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.43 pair #433314283

details

property	value
status	complete
benchmark	4.35.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n044.star.cs.uiowa.edu
space	SK90

run statistics

property	value
solver	AProVE
configuration	certified
runtime (wallclock)	1.73756 seconds
cpu usage	3.59458
user time	3.40131
system time	0.193273
max virtual memory	1.8722224E7
max residence set size	294076.0

stage attributes

key	value
certification-result	CERTIFIED
output-size	2298
starexec-result	WORST_CASE(?,O(n^1))
certification-time	0.0

output

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>a</name><arg><funapp><name>b</name><arg><var>x</var></arg></funapp></arg></funapp></lhs><rhs><funapp><name>a</name><arg><funapp><name>c</name><arg><funapp><name>b</name><arg><var>x</var></arg></funapp></arg></funapp></arg></funapp></rhs></rule></rules></trs><strategy><innermost/></strategy></trsInput><runtimeComplexity><signature><symbol><name>b</name><arity>1</arity></symbol><symbol><name>c</name><arity>1</arity></symbol></signature><signature><symbol><name>a</name><arity>1</arity></symbol></signature></runtimeComplexity><polynomial>1</polynomial></complexityInput></input><cpfVersion>2.1</cpfVersion><proof><complexityProof><bounds><type><match/></type><bound>1</bound><finalStates><state>2</state></finalStates><treeAutomaton><finalStates><state>1</state><state>2</state></finalStates><transitions><transition><lhs><name>a</name><height>0</height><state>2</state></lhs><rhs><state>1</state></rhs></transition><transition><lhs><name>a</name><height>1</height><state>3</state></lhs><rhs><state>1</state></rhs></transition><transition><lhs><name>b</name><height>0</height><state>2</state></lhs><rhs><state>2</state></rhs></transition><transition><lhs><name>c</name><height>0</height><state>2</state></lhs><rhs><state>2</state></rhs></transition><transition><lhs><name>c</name><height>1</height><state>4</state></lhs><rhs><state>3</state></rhs></transition><transition><lhs><name>b</name><height>1</height><state>2</state></lhs><rhs><state>4</state></rhs></transition></transitions></treeAutomaton></bounds></complexityProof></proof><origin><proofOrigin><tool><name>AProVE</name><version>AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 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>

popout

output may be truncated. 'popout' for the full output.

job log

popout

actions all output return to Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.43