Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903017
details
property
value
status
complete
benchmark
PEANO_nosorts-noand_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n055.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
0.464010000229 seconds
cpu usage
2.494224701
max memory
4.6952448E7
stage attributes
key
value
output-size
19404
starexec-result
WORST_CASE(Omega(n^1),O(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),O(n^1)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^1)) + Considered Problem: - Strict TRS: U11(tt(),M,N) -> U12(tt(),activate(M),activate(N)) U12(tt(),M,N) -> s(plus(activate(N),activate(M))) activate(X) -> X plus(N,0()) -> N plus(N,s(M)) -> U11(tt(),M,N) - Signature: {U11/3,U12/3,activate/1,plus/2} / {0/0,s/1,tt/0} - Obligation: runtime complexity wrt. defined symbols {U11,U12,activate,plus} and constructors {0,s,tt} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: U11(tt(),M,N) -> U12(tt(),activate(M),activate(N)) U12(tt(),M,N) -> s(plus(activate(N),activate(M))) activate(X) -> X plus(N,0()) -> N plus(N,s(M)) -> U11(tt(),M,N) - Signature: {U11/3,U12/3,activate/1,plus/2} / {0/0,s/1,tt/0} - Obligation: runtime complexity wrt. defined symbols {U11,U12,activate,plus} and constructors {0,s,tt} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: U11(tt(),z,x_31){z -> s(z)} = U11(tt(),s(z),x_31) ->^+ s(U11(tt(),z,activate(activate(x_31)))) = C[U11(tt(),z,activate(activate(x_31))) = U11(tt(),z,x_31){x_31 -> activate(activate(x_31))}] ** Step 1.b:1: ToInnermost WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: U11(tt(),M,N) -> U12(tt(),activate(M),activate(N)) U12(tt(),M,N) -> s(plus(activate(N),activate(M))) activate(X) -> X plus(N,0()) -> N plus(N,s(M)) -> U11(tt(),M,N) - Signature: {U11/3,U12/3,activate/1,plus/2} / {0/0,s/1,tt/0} - Obligation: runtime complexity wrt. defined symbols {U11,U12,activate,plus} and constructors {0,s,tt} + Applied Processor: ToInnermost + Details: switch to innermost, as the system is overlay and right linear and does not contain weak rules ** Step 1.b:2: DependencyPairs WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: U11(tt(),M,N) -> U12(tt(),activate(M),activate(N)) U12(tt(),M,N) -> s(plus(activate(N),activate(M))) activate(X) -> X plus(N,0()) -> N plus(N,s(M)) -> U11(tt(),M,N) - Signature: {U11/3,U12/3,activate/1,plus/2} / {0/0,s/1,tt/0} - Obligation: innermost runtime complexity wrt. defined symbols {U11,U12,activate,plus} and constructors {0,s,tt} + Applied Processor: DependencyPairs {dpKind_ = WIDP} + Details: We add the following weak innermost dependency pairs: Strict DPs U11#(tt(),M,N) -> c_1(U12#(tt(),activate(M),activate(N))) U12#(tt(),M,N) -> c_2(plus#(activate(N),activate(M))) activate#(X) -> c_3() plus#(N,0()) -> c_4() plus#(N,s(M)) -> c_5(U11#(tt(),M,N)) Weak DPs and mark the set of starting terms. ** Step 1.b:3: UsableRules WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: U11#(tt(),M,N) -> c_1(U12#(tt(),activate(M),activate(N))) U12#(tt(),M,N) -> c_2(plus#(activate(N),activate(M))) activate#(X) -> c_3() plus#(N,0()) -> c_4() plus#(N,s(M)) -> c_5(U11#(tt(),M,N)) - Strict TRS: U11(tt(),M,N) -> U12(tt(),activate(M),activate(N)) U12(tt(),M,N) -> s(plus(activate(N),activate(M))) activate(X) -> X plus(N,0()) -> N plus(N,s(M)) -> U11(tt(),M,N)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127