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