Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904861
details
property
value
status
complete
benchmark
eq.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n077.star.cs.uiowa.edu
space
Frederiksen_Others
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
0.179867982864 seconds
cpu usage
0.780890067
max memory
3.1064064E7
stage attributes
key
value
output-size
2568
starexec-result
WORST_CASE(Omega(n^1),O(n^1))
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^1)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^1)) + Considered Problem: - Strict TRS: eq0(0(),0()) -> S(0()) eq0(0(),S(x)) -> 0() eq0(S(x),0()) -> 0() eq0(S(x'),S(x)) -> eq0(x',x) - Signature: {eq0/2} / {0/0,S/1} - Obligation: innermost runtime complexity wrt. defined symbols {eq0} and constructors {0,S} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: eq0(0(),0()) -> S(0()) eq0(0(),S(x)) -> 0() eq0(S(x),0()) -> 0() eq0(S(x'),S(x)) -> eq0(x',x) - Signature: {eq0/2} / {0/0,S/1} - Obligation: innermost runtime complexity wrt. defined symbols {eq0} and constructors {0,S} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: eq0(x,y){x -> S(x),y -> S(y)} = eq0(S(x),S(y)) ->^+ eq0(x,y) = C[eq0(x,y) = eq0(x,y){}] ** Step 1.b:1: Ara WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: eq0(0(),0()) -> S(0()) eq0(0(),S(x)) -> 0() eq0(S(x),0()) -> 0() eq0(S(x'),S(x)) -> eq0(x',x) - Signature: {eq0/2} / {0/0,S/1} - Obligation: innermost runtime complexity wrt. defined symbols {eq0} and constructors {0,S} + Applied Processor: Ara {araHeuristics = Heuristics, minDegree = 1, maxDegree = 2, araTimeout = 3, araRuleShifting = Nothing} + Details: Signatures used: ---------------- 0 :: [] -(0)-> "A"(1) 0 :: [] -(0)-> "A"(0) S :: ["A"(0)] -(0)-> "A"(0) S :: ["A"(1)] -(1)-> "A"(1) eq0 :: ["A"(1) x "A"(0)] -(1)-> "A"(0) Cost-free Signatures used: -------------------------- Base Constructor Signatures used: --------------------------------- "0_A" :: [] -(0)-> "A"(0) "S_A" :: ["A"(0)] -(0)-> "A"(0) WORST_CASE(Omega(n^1),O(n^1))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807