Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904553
details
property
value
status
complete
benchmark
elimdupl.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n037.star.cs.uiowa.edu
space
Rubio_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
6.50099301338 seconds
cpu usage
20.424714679
max memory
1.24276736E8
stage attributes
key
value
output-size
51278
starexec-result
WORST_CASE(Omega(n^1),O(n^3))
output
/export/starexec/sandbox2/solver/bin/starexec_run_tct_rci /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1),O(n^3)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^3)) + Considered Problem: - Strict TRS: eq(0(),0()) -> true() eq(0(),s(X)) -> false() eq(s(X),0()) -> false() eq(s(X),s(Y)) -> eq(X,Y) ifrm(false(),N,add(M,X)) -> add(M,rm(N,X)) ifrm(true(),N,add(M,X)) -> rm(N,X) purge(add(N,X)) -> add(N,purge(rm(N,X))) purge(nil()) -> nil() rm(N,add(M,X)) -> ifrm(eq(N,M),N,add(M,X)) rm(N,nil()) -> nil() - Signature: {eq/2,ifrm/3,purge/1,rm/2} / {0/0,add/2,false/0,nil/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {eq,ifrm,purge,rm} and constructors {0,add,false,nil,s ,true} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: eq(0(),0()) -> true() eq(0(),s(X)) -> false() eq(s(X),0()) -> false() eq(s(X),s(Y)) -> eq(X,Y) ifrm(false(),N,add(M,X)) -> add(M,rm(N,X)) ifrm(true(),N,add(M,X)) -> rm(N,X) purge(add(N,X)) -> add(N,purge(rm(N,X))) purge(nil()) -> nil() rm(N,add(M,X)) -> ifrm(eq(N,M),N,add(M,X)) rm(N,nil()) -> nil() - Signature: {eq/2,ifrm/3,purge/1,rm/2} / {0/0,add/2,false/0,nil/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {eq,ifrm,purge,rm} and constructors {0,add,false,nil,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){}] ** Step 1.b:1: DependencyPairs WORST_CASE(?,O(n^3)) + Considered Problem: - Strict TRS: eq(0(),0()) -> true() eq(0(),s(X)) -> false() eq(s(X),0()) -> false() eq(s(X),s(Y)) -> eq(X,Y) ifrm(false(),N,add(M,X)) -> add(M,rm(N,X)) ifrm(true(),N,add(M,X)) -> rm(N,X) purge(add(N,X)) -> add(N,purge(rm(N,X))) purge(nil()) -> nil() rm(N,add(M,X)) -> ifrm(eq(N,M),N,add(M,X)) rm(N,nil()) -> nil() - Signature: {eq/2,ifrm/3,purge/1,rm/2} / {0/0,add/2,false/0,nil/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {eq,ifrm,purge,rm} and constructors {0,add,false,nil,s ,true} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs eq#(0(),0()) -> c_1() eq#(0(),s(X)) -> c_2() eq#(s(X),0()) -> c_3() eq#(s(X),s(Y)) -> c_4(eq#(X,Y)) ifrm#(false(),N,add(M,X)) -> c_5(rm#(N,X)) ifrm#(true(),N,add(M,X)) -> c_6(rm#(N,X)) purge#(add(N,X)) -> c_7(purge#(rm(N,X)),rm#(N,X)) purge#(nil()) -> c_8() rm#(N,add(M,X)) -> c_9(ifrm#(eq(N,M),N,add(M,X)),eq#(N,M)) rm#(N,nil()) -> c_10() Weak DPs and mark the set of starting terms. ** Step 1.b:2: PredecessorEstimation WORST_CASE(?,O(n^3)) + Considered Problem: - Strict DPs: eq#(0(),0()) -> c_1() eq#(0(),s(X)) -> c_2() eq#(s(X),0()) -> c_3() eq#(s(X),s(Y)) -> c_4(eq#(X,Y))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807