Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.43 pair #433314210
details
property
value
status
complete
benchmark
24.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n114.star.cs.uiowa.edu
space
Various_04
run statistics
property
value
solver
AProVE
configuration
certified
runtime (wallclock)
292.454 seconds
cpu usage
376.348
user time
374.339
system time
2.00862
max virtual memory
1.9043192E7
max residence set size
2002224.0
stage attributes
key
value
certification-result
CERTIFIED
output-size
5632
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>max</name><arg><funapp><name>L</name><arg><var>x</var></arg></funapp></arg></funapp></lhs><rhs><var>x</var></rhs></rule><rule><lhs><funapp><name>max</name><arg><funapp><name>N</name><arg><funapp><name>L</name><arg><funapp><name>0</name></funapp></arg></funapp></arg><arg><funapp><name>L</name><arg><var>y</var></arg></funapp></arg></funapp></arg></funapp></lhs><rhs><var>y</var></rhs></rule><rule><lhs><funapp><name>max</name><arg><funapp><name>N</name><arg><funapp><name>L</name><arg><funapp><name>s</name><arg><var>x</var></arg></funapp></arg></funapp></arg><arg><funapp><name>L</name><arg><funapp><name>s</name><arg><var>y</var></arg></funapp></arg></funapp></arg></funapp></arg></funapp></lhs><rhs><funapp><name>s</name><arg><funapp><name>max</name><arg><funapp><name>N</name><arg><funapp><name>L</name><arg><var>x</var></arg></funapp></arg><arg><funapp><name>L</name><arg><var>y</var></arg></funapp></arg></funapp></arg></funapp></arg></funapp></rhs></rule><rule><lhs><funapp><name>max</name><arg><funapp><name>N</name><arg><funapp><name>L</name><arg><var>x</var></arg></funapp></arg><arg><funapp><name>N</name><arg><var>y</var></arg><arg><var>z</var></arg></funapp></arg></funapp></arg></funapp></lhs><rhs><funapp><name>max</name><arg><funapp><name>N</name><arg><funapp><name>L</name><arg><var>x</var></arg></funapp></arg><arg><funapp><name>L</name><arg><funapp><name>max</name><arg><funapp><name>N</name><arg><var>y</var></arg><arg><var>z</var></arg></funapp></arg></funapp></arg></funapp></arg></funapp></arg></funapp></rhs></rule></rules></trs><strategy><innermost/></strategy></trsInput><runtimeComplexity><signature><symbol><name>L</name><arity>1</arity></symbol><symbol><name>N</name><arity>2</arity></symbol><symbol><name>0</name><arity>0</arity></symbol><symbol><name>s</name><arity>1</arity></symbol></signature><signature><symbol><name>max</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>0</state></finalStates><treeAutomaton><finalStates><state>0</state><state>1</state></finalStates><transitions><transition><lhs><name>L</name><height>0</height><state>0</state></lhs><rhs><state>0</state></rhs></transition><transition><lhs><name>N</name><height>0</height><state>0</state><state>0</state></lhs><rhs><state>0</state></rhs></transition><transition><lhs><name>0</name><height>0</height></lhs><rhs><state>0</state></rhs></transition><transition><lhs><name>s</name><height>0</height><state>0</state></lhs><rhs><state>0</state></rhs></transition><transition><lhs><name>max</name><height>0</height><state>0</state></lhs><rhs><state>1</state></rhs></transition><transition><lhs><name>L</name><height>1</height><state>0</state></lhs><rhs><state>4</state></rhs></transition><transition><lhs><name>L</name><height>1</height><state>0</state></lhs><rhs><state>5</state></rhs></transition><transition><lhs><name>N</name><height>1</height><state>4</state><state>5</state></lhs><rhs><state>3</state></rhs></transition><transition><lhs><name>max</name><height>1</height><state>3</state></lhs><rhs><state>2</state></rhs></transition><transition><lhs><name>s</name><height>1</height><state>2</state></lhs><rhs><state>1</state></rhs></transition><transition><lhs><name>N</name><height>1</height><state>0</state><state>0</state></lhs><rhs><state>8</state></rhs></transition><transition><lhs><name>max</name><height>1</height><state>8</state></lhs><rhs><state>7</state></rhs></transition><transition><lhs><name>L</name><height>1</height><state>7</state></lhs><rhs><state>6</state></rhs></transition><transition><lhs><name>N</name><height>1</height><state>4</state><state>6</state></lhs><rhs><state>3</state></rhs></transition><transition><lhs><name>max</name><height>1</height><state>3</state></lhs><rhs><state>1</state></rhs></transition><transition><lhs><name>s</name><height>1</height><state>2</state></lhs><rhs><state>7</state></rhs></transition><transition><lhs><name>max</name><height>1</height><state>3</state></lhs><rhs><state>7</state></rhs></transition><transition><lhs><name>L</name><height>1</height><state>2</state></lhs><rhs><state>5</state></rhs></transition><transition><lhs><state>0</state></lhs><rhs><state>1</state></rhs></transition><transition><lhs><state>0</state></lhs><rhs><state>7</state></rhs></transition><transition><lhs><state>0</state></lhs><rhs><state>2</state></rhs></transition><transition><lhs><state>7</state></lhs><rhs><state>1</state></rhs></transition><transition><lhs><state>7</state></lhs><rhs><state>2</state></rhs></transition><transition><lhs><state>2</state></lhs><rhs><state>1</state></rhs></transition><transition><lhs><state>2</state></lhs><rhs><state>7</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