Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381902624
details
property
value
status
complete
benchmark
times.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n051.star.cs.uiowa.edu
space
Secret_06_TRS
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
295.224823952 seconds
cpu usage
492.484468773
max memory
2.210562048E9
stage attributes
key
value
output-size
3077
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: eq(x,x) -> true() eq(0(),0()) -> true() eq(0(),s(x)) -> false() eq(s(x),0()) -> false() eq(s(x),s(y)) -> eq(x,y) f() -> g() f() -> h() ifPlus(false(),x,y,z) -> plus(x,z) ifPlus(true(),x,y,z) -> y ifTimes(false(),x,y,z,u) -> timesIter(x,y,u) ifTimes(true(),x,y,z,u) -> z inc(0()) -> s(0()) inc(s(x)) -> s(inc(x)) minus(x,x) -> 0() minus(x,0()) -> x minus(0(),x) -> 0() minus(s(x),s(y)) -> minus(x,y) plus(x,y) -> ifPlus(eq(x,0()),minus(x,s(0())),x,inc(x)) times(x,y) -> timesIter(x,y,0()) timesIter(x,y,z) -> ifTimes(eq(x,0()),minus(x,s(0())),y,z,plus(y,z)) - Signature: {eq/2,f/0,ifPlus/4,ifTimes/5,inc/1,minus/2,plus/2,times/2,timesIter/3} / {0/0,false/0,g/0,h/0,s/1,true/0} - Obligation: runtime complexity wrt. defined symbols {eq,f,ifPlus,ifTimes,inc,minus,plus,times ,timesIter} and constructors {0,false,g,h,s,true} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: eq(x,x) -> true() eq(0(),0()) -> true() eq(0(),s(x)) -> false() eq(s(x),0()) -> false() eq(s(x),s(y)) -> eq(x,y) f() -> g() f() -> h() ifPlus(false(),x,y,z) -> plus(x,z) ifPlus(true(),x,y,z) -> y ifTimes(false(),x,y,z,u) -> timesIter(x,y,u) ifTimes(true(),x,y,z,u) -> z inc(0()) -> s(0()) inc(s(x)) -> s(inc(x)) minus(x,x) -> 0() minus(x,0()) -> x minus(0(),x) -> 0() minus(s(x),s(y)) -> minus(x,y) plus(x,y) -> ifPlus(eq(x,0()),minus(x,s(0())),x,inc(x)) times(x,y) -> timesIter(x,y,0()) timesIter(x,y,z) -> ifTimes(eq(x,0()),minus(x,s(0())),y,z,plus(y,z)) - Signature: {eq/2,f/0,ifPlus/4,ifTimes/5,inc/1,minus/2,plus/2,times/2,timesIter/3} / {0/0,false/0,g/0,h/0,s/1,true/0} - Obligation: runtime complexity wrt. defined symbols {eq,f,ifPlus,ifTimes,inc,minus,plus,times ,timesIter} and constructors {0,false,g,h,s,true} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: eq(x,y){x -> s(x),y -> s(y)} = eq(s(x),s(y)) ->^+ eq(x,y) = C[eq(x,y) = eq(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