details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	295.59443593 seconds
cpu usage	474.575504692
max memory	4.848279552E9

stage attributes

key	value
output-size	1780
starexec-result	WORST_CASE(Omega(n^1),?)

output

/export/starexec/sandbox/solver/bin/starexec_run_tct_rc /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1),?) * Step 1: Sum WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: min(X,0()) -> X min(min(X,Y),Z()) -> min(X,plus(Y,Z())) min(s(X),s(Y)) -> min(X,Y) plus(0(),Y) -> Y plus(s(X),Y) -> s(plus(X,Y)) quot(0(),s(Y)) -> 0() quot(s(X),s(Y)) -> s(quot(min(X,Y),s(Y))) - Signature: {min/2,plus/2,quot/2} / {0/0,Z/0,s/1} - Obligation: runtime complexity wrt. defined symbols {min,plus,quot} and constructors {0,Z,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: min(X,0()) -> X min(min(X,Y),Z()) -> min(X,plus(Y,Z())) min(s(X),s(Y)) -> min(X,Y) plus(0(),Y) -> Y plus(s(X),Y) -> s(plus(X,Y)) quot(0(),s(Y)) -> 0() quot(s(X),s(Y)) -> s(quot(min(X,Y),s(Y))) - Signature: {min/2,plus/2,quot/2} / {0/0,Z/0,s/1} - Obligation: runtime complexity wrt. defined symbols {min,plus,quot} and constructors {0,Z,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: min(x,y){x -> s(x),y -> s(y)} = min(s(x),s(y)) ->^+ min(x,y) = C[min(x,y) = min(x,y){}] WORST_CASE(Omega(n^1),?) popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127