Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.43 pair #433314121
details
property
value
status
complete
benchmark
Ex15_Luc06_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n036.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
certified
runtime (wallclock)
2.15023 seconds
cpu usage
5.00751
user time
4.77521
system time
0.232297
max virtual memory
1.8723024E7
max residence set size
347760.0
stage attributes
key
value
certification-result
CERTIFIED
output-size
5669
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>f</name><arg><funapp><name>n__f</name><arg><funapp><name>n__a</name></funapp></arg></funapp></arg></funapp></lhs><rhs><funapp><name>f</name><arg><funapp><name>n__g</name><arg><funapp><name>f</name><arg><funapp><name>n__a</name></funapp></arg></funapp></arg></funapp></arg></funapp></rhs></rule><rule><lhs><funapp><name>f</name><arg><var>X</var></arg></funapp></lhs><rhs><funapp><name>n__f</name><arg><var>X</var></arg></funapp></rhs></rule><rule><lhs><funapp><name>a</name></funapp></lhs><rhs><funapp><name>n__a</name></funapp></rhs></rule><rule><lhs><funapp><name>g</name><arg><var>X</var></arg></funapp></lhs><rhs><funapp><name>n__g</name><arg><var>X</var></arg></funapp></rhs></rule><rule><lhs><funapp><name>activate</name><arg><funapp><name>n__f</name><arg><var>X</var></arg></funapp></arg></funapp></lhs><rhs><funapp><name>f</name><arg><var>X</var></arg></funapp></rhs></rule><rule><lhs><funapp><name>activate</name><arg><funapp><name>n__a</name></funapp></arg></funapp></lhs><rhs><funapp><name>a</name></funapp></rhs></rule><rule><lhs><funapp><name>activate</name><arg><funapp><name>n__g</name><arg><var>X</var></arg></funapp></arg></funapp></lhs><rhs><funapp><name>g</name><arg><var>X</var></arg></funapp></rhs></rule><rule><lhs><funapp><name>activate</name><arg><var>X</var></arg></funapp></lhs><rhs><var>X</var></rhs></rule></rules></trs><strategy><innermost/></strategy></trsInput><runtimeComplexity><signature><symbol><name>n__f</name><arity>1</arity></symbol><symbol><name>n__a</name><arity>0</arity></symbol><symbol><name>n__g</name><arity>1</arity></symbol></signature><signature><symbol><name>f</name><arity>1</arity></symbol><symbol><name>a</name><arity>0</arity></symbol><symbol><name>g</name><arity>1</arity></symbol><symbol><name>activate</name><arity>1</arity></symbol></signature></runtimeComplexity><polynomial>1</polynomial></complexityInput></input><cpfVersion>2.1</cpfVersion><proof><complexityProof><bounds><type><match/></type><bound>2</bound><finalStates><state>0</state></finalStates><treeAutomaton><finalStates><state>0</state><state>1</state><state>2</state><state>3</state><state>4</state></finalStates><transitions><transition><lhs><name>n__f</name><height>0</height><state>0</state></lhs><rhs><state>0</state></rhs></transition><transition><lhs><name>n__a</name><height>0</height></lhs><rhs><state>0</state></rhs></transition><transition><lhs><name>n__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></lhs><rhs><state>1</state></rhs></transition><transition><lhs><name>a</name><height>0</height></lhs><rhs><state>2</state></rhs></transition><transition><lhs><name>g</name><height>0</height><state>0</state></lhs><rhs><state>3</state></rhs></transition><transition><lhs><name>activate</name><height>0</height><state>0</state></lhs><rhs><state>4</state></rhs></transition><transition><lhs><name>n__a</name><height>1</height></lhs><rhs><state>7</state></rhs></transition><transition><lhs><name>f</name><height>1</height><state>7</state></lhs><rhs><state>6</state></rhs></transition><transition><lhs><name>n__g</name><height>1</height><state>6</state></lhs><rhs><state>5</state></rhs></transition><transition><lhs><name>f</name><height>1</height><state>5</state></lhs><rhs><state>1</state></rhs></transition><transition><lhs><name>n__f</name><height>1</height><state>0</state></lhs><rhs><state>1</state></rhs></transition><transition><lhs><name>n__a</name><height>1</height></lhs><rhs><state>2</state></rhs></transition><transition><lhs><name>n__g</name><height>1</height><state>0</state></lhs><rhs><state>3</state></rhs></transition><transition><lhs><name>f</name><height>1</height><state>0</state></lhs><rhs><state>4</state></rhs></transition><transition><lhs><name>a</name><height>1</height></lhs><rhs><state>4</state></rhs></transition><transition><lhs><name>g</name><height>1</height><state>0</state></lhs><rhs><state>4</state></rhs></transition><transition><lhs><name>f</name><height>1</height><state>5</state></lhs><rhs><state>4</state></rhs></transition><transition><lhs><name>n__f</name><height>2</height><state>5</state></lhs><rhs><state>1</state></rhs></transition><transition><lhs><name>n__f</name><height>2</height><state>0</state></lhs><rhs><state>4</state></rhs></transition><transition><lhs><name>n__f</name><height>2</height><state>7</state></lhs><rhs><state>6</state></rhs></transition><transition><lhs><name>n__a</name><height>2</height></lhs><rhs><state>4</state></rhs></transition><transition><lhs><name>n__g</name><height>2</height><state>0</state></lhs><rhs><state>4</state></rhs></transition><transition><lhs><name>n__f</name><height>2</height><state>5</state></lhs><rhs><state>4</state></rhs></transition><transition><lhs><state>0</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