Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903209
details
property
value
status
complete
benchmark
PEANO_nokinds-noand_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n038.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
295.318996906 seconds
cpu usage
705.038208635
max memory
1.9472474112E10
stage attributes
key
value
output-size
3099
starexec-result
WORST_CASE(Omega(n^1),?)
output
/export/starexec/sandbox2/solver/bin/starexec_run_tct_rc /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1),?) * Step 1: Sum WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: 0() -> n__0() U11(tt(),V2) -> U12(isNat(activate(V2))) U12(tt()) -> tt() U21(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> U42(isNat(activate(N)),activate(M),activate(N)) U42(tt(),M,N) -> s(plus(activate(N),activate(M))) activate(X) -> X activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__s(X)) -> s(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(isNat(activate(V1)),activate(V2)) isNat(n__s(V1)) -> U21(isNat(activate(V1))) plus(N,0()) -> U31(isNat(N),N) plus(N,s(M)) -> U41(isNat(M),M,N) plus(X1,X2) -> n__plus(X1,X2) s(X) -> n__s(X) - Signature: {0/0,U11/2,U12/1,U21/1,U31/2,U41/3,U42/3,activate/1,isNat/1,plus/2,s/1} / {n__0/0,n__plus/2,n__s/1,tt/0} - Obligation: runtime complexity wrt. defined symbols {0,U11,U12,U21,U31,U41,U42,activate,isNat,plus ,s} and constructors {n__0,n__plus,n__s,tt} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: 0() -> n__0() U11(tt(),V2) -> U12(isNat(activate(V2))) U12(tt()) -> tt() U21(tt()) -> tt() U31(tt(),N) -> activate(N) U41(tt(),M,N) -> U42(isNat(activate(N)),activate(M),activate(N)) U42(tt(),M,N) -> s(plus(activate(N),activate(M))) activate(X) -> X activate(n__0()) -> 0() activate(n__plus(X1,X2)) -> plus(X1,X2) activate(n__s(X)) -> s(X) isNat(n__0()) -> tt() isNat(n__plus(V1,V2)) -> U11(isNat(activate(V1)),activate(V2)) isNat(n__s(V1)) -> U21(isNat(activate(V1))) plus(N,0()) -> U31(isNat(N),N) plus(N,s(M)) -> U41(isNat(M),M,N) plus(X1,X2) -> n__plus(X1,X2) s(X) -> n__s(X) - Signature: {0/0,U11/2,U12/1,U21/1,U31/2,U41/3,U42/3,activate/1,isNat/1,plus/2,s/1} / {n__0/0,n__plus/2,n__s/1,tt/0} - Obligation: runtime complexity wrt. defined symbols {0,U11,U12,U21,U31,U41,U42,activate,isNat,plus ,s} and constructors {n__0,n__plus,n__s,tt} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: isNat(x){x -> n__plus(x,u)} = isNat(n__plus(x,u)) ->^+ U11(isNat(x),activate(u)) = C[isNat(x) = isNat(x){}] 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