details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc_cert
runtime (wallclock)	0.0333321094513 seconds
cpu usage	0.080804472
max memory	1.1583488E7

stage attributes

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

output

/export/starexec/sandbox/solver/bin/starexec_run_tct_rc_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>g</name><arg><var>x</var></arg></funapp></arg></funapp></lhs><rhs><funapp><name>g</name><arg><funapp><name>g</name><arg><funapp><name>f</name><arg><var>x</var></arg></funapp></arg></funapp></arg></funapp></rhs></rule><rule><lhs><funapp><name>f</name><arg><funapp><name>g</name><arg><var>x</var></arg></funapp></arg></funapp></lhs><rhs><funapp><name>g</name><arg><funapp><name>g</name><arg><funapp><name>g</name><arg><var>x</var></arg></funapp></arg></funapp></arg></funapp></rhs></rule></rules></trs><relativeRules><rules/></relativeRules></trsInput><runtimeComplexity><signature><symbol><name>g</name><arity>1</arity></symbol></signature><signature><symbol><name>f</name><arity>1</arity></symbol></signature></runtimeComplexity><polynomial>1</polynomial></complexityInput></input><cpfVersion>2.2</cpfVersion><proof><complexityProof><relativeBounds><bounds><type><match/></type><bound>1</bound><finalStates><state>2</state></finalStates><treeAutomaton><finalStates><state>1</state><state>2</state><state>4</state><state>3</state></finalStates><transitions><transition><lhs><name>f</name><height>0</height><state>2</state></lhs><rhs><state>1</state></rhs></transition><transition><lhs><name>f</name><height>1</height><state>2</state></lhs><rhs><state>4</state></rhs></transition><transition><lhs><name>g</name><height>0</height><state>2</state></lhs><rhs><state>2</state></rhs></transition><transition><lhs><name>g</name><height>1</height><state>2</state></lhs><rhs><state>4</state></rhs></transition><transition><lhs><name>g</name><height>1</height><state>3</state></lhs><rhs><state>1</state></rhs></transition><transition><lhs><name>g</name><height>1</height><state>3</state></lhs><rhs><state>4</state></rhs></transition><transition><lhs><name>g</name><height>1</height><state>4</state></lhs><rhs><state>3</state></rhs></transition></transitions></treeAutomaton></bounds><trs><rules><rule><lhs><funapp><name>f</name><arg><funapp><name>g</name><arg><var>x</var></arg></funapp></arg></funapp></lhs><rhs><funapp><name>g</name><arg><funapp><name>g</name><arg><funapp><name>f</name><arg><var>x</var></arg></funapp></arg></funapp></arg></funapp></rhs></rule><rule><lhs><funapp><name>f</name><arg><funapp><name>g</name><arg><var>x</var></arg></funapp></arg></funapp></lhs><rhs><funapp><name>g</name><arg><funapp><name>g</name><arg><funapp><name>g</name><arg><var>x</var></arg></funapp></arg></funapp></arg></funapp></rhs></rule></rules></trs><complexityProof><rIsEmpty/></complexityProof></relativeBounds></complexityProof></proof><origin><proofOrigin><tool><name>TcT</name><version/></tool></proofOrigin></origin></certificationProblem> popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri certi 81767