Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903116
details
property
value
status
complete
benchmark
#3.37.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n052.star.cs.uiowa.edu
space
AG01
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
0.114507913589 seconds
cpu usage
0.405692927
max memory
2.9474816E7
stage attributes
key
value
output-size
4623
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: evenodd(x,0()) -> not(evenodd(x,s(0()))) evenodd(0(),s(0())) -> false() evenodd(s(x),s(0())) -> evenodd(x,0()) not(false()) -> true() not(true()) -> false() - Signature: {evenodd/2,not/1} / {0/0,false/0,s/1,true/0} - Obligation: runtime complexity wrt. defined symbols {evenodd,not} and constructors {0,false,s,true} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: evenodd(x,0()) -> not(evenodd(x,s(0()))) evenodd(0(),s(0())) -> false() evenodd(s(x),s(0())) -> evenodd(x,0()) not(false()) -> true() not(true()) -> false() - Signature: {evenodd/2,not/1} / {0/0,false/0,s/1,true/0} - Obligation: runtime complexity wrt. defined symbols {evenodd,not} and constructors {0,false,s,true} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: evenodd(x,0()){x -> s(x)} = evenodd(s(x),0()) ->^+ not(evenodd(x,0())) = C[evenodd(x,0()) = evenodd(x,0()){}] ** Step 1.b:1: ToInnermost WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: evenodd(x,0()) -> not(evenodd(x,s(0()))) evenodd(0(),s(0())) -> false() evenodd(s(x),s(0())) -> evenodd(x,0()) not(false()) -> true() not(true()) -> false() - Signature: {evenodd/2,not/1} / {0/0,false/0,s/1,true/0} - Obligation: runtime complexity wrt. defined symbols {evenodd,not} and constructors {0,false,s,true} + 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: Bounds WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: evenodd(x,0()) -> not(evenodd(x,s(0()))) evenodd(0(),s(0())) -> false() evenodd(s(x),s(0())) -> evenodd(x,0()) not(false()) -> true() not(true()) -> false() - Signature: {evenodd/2,not/1} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {evenodd,not} and constructors {0,false,s,true} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 3. The enriched problem is compatible with follwoing automaton. 0_0() -> 2 0_1() -> 5 0_2() -> 8 evenodd_0(2,2) -> 1 evenodd_1(2,4) -> 3 evenodd_1(2,5) -> 1 evenodd_1(2,5) -> 3 evenodd_1(2,5) -> 6 evenodd_2(2,7) -> 6 false_0() -> 2 false_1() -> 1 false_1() -> 3 false_1() -> 6 false_2() -> 1 false_3() -> 1 false_3() -> 3 false_3() -> 6 not_0(2) -> 1 not_1(3) -> 1 not_2(6) -> 1 not_2(6) -> 3 not_2(6) -> 6 s_0(2) -> 2 s_1(5) -> 4
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127