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