details

property	value
status	complete
benchmark	2.29.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	SK90

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	1.37152099609 seconds
cpu usage	5.368553899
max memory	6.9210112E7

stage attributes

key	value
output-size	11817
starexec-result	WORST_CASE(Omega(n^1),O(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),O(n^1)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^1)) + Considered Problem: - Strict TRS: divp(x,y) -> =(rem(x,y),0()) prime(0()) -> false() prime(s(0())) -> false() prime(s(s(x))) -> prime1(s(s(x)),s(x)) prime1(x,0()) -> false() prime1(x,s(0())) -> true() prime1(x,s(s(y))) -> and(not(divp(s(s(y)),x)),prime1(x,s(y))) - Signature: {divp/2,prime/1,prime1/2} / {0/0,=/2,and/2,false/0,not/1,rem/2,s/1,true/0} - Obligation: runtime complexity wrt. defined symbols {divp,prime,prime1} and constructors {0,=,and,false,not,rem,s,true} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: divp(x,y) -> =(rem(x,y),0()) prime(0()) -> false() prime(s(0())) -> false() prime(s(s(x))) -> prime1(s(s(x)),s(x)) prime1(x,0()) -> false() prime1(x,s(0())) -> true() prime1(x,s(s(y))) -> and(not(divp(s(s(y)),x)),prime1(x,s(y))) - Signature: {divp/2,prime/1,prime1/2} / {0/0,=/2,and/2,false/0,not/1,rem/2,s/1,true/0} - Obligation: runtime complexity wrt. defined symbols {divp,prime,prime1} and constructors {0,=,and,false,not,rem,s,true} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: prime1(x,s(y)){y -> s(y)} = prime1(x,s(s(y))) ->^+ and(not(divp(s(s(y)),x)),prime1(x,s(y))) = C[prime1(x,s(y)) = prime1(x,s(y)){}] ** Step 1.b:1: NaturalMI WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: divp(x,y) -> =(rem(x,y),0()) prime(0()) -> false() prime(s(0())) -> false() prime(s(s(x))) -> prime1(s(s(x)),s(x)) prime1(x,0()) -> false() prime1(x,s(0())) -> true() prime1(x,s(s(y))) -> and(not(divp(s(s(y)),x)),prime1(x,s(y))) - Signature: {divp/2,prime/1,prime1/2} / {0/0,=/2,and/2,false/0,not/1,rem/2,s/1,true/0} - Obligation: runtime complexity wrt. defined symbols {divp,prime,prime1} and constructors {0,=,and,false,not,rem,s,true} + Applied Processor: NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Just any strict-rules} + Details: We apply a matrix interpretation of kind constructor based matrix interpretation: The following argument positions are considered usable: uargs(and) = {1,2}, uargs(not) = {1} Following symbols are considered usable: all TcT has computed the following interpretation: p(0) = [0] p(=) = [1] x1 + [0] p(and) = [1] x1 + [1] x2 + [0] p(divp) = [9] x1 + [0] p(false) = [1] p(not) = [1] x1 + [0] p(prime) = [11] p(prime1) = [2] p(rem) = [0] p(s) = [0] p(true) = [1] Following rules are strictly oriented: prime(0()) = [11] > [1] = false() prime(s(0())) = [11] > [1] = false() prime(s(s(x))) = [11] > [2] = prime1(s(s(x)),s(x)) prime1(x,0()) = [2] > [1] = false() popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127