Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381902820
details
property
value
status
complete
benchmark
#3.39.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n072.star.cs.uiowa.edu
space
AG01
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
1.04543018341 seconds
cpu usage
4.093417311
max memory
8.6007808E7
stage attributes
key
value
output-size
22138
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: minus(x,0()) -> x minus(s(x),s(y)) -> minus(x,y) plus(0(),y) -> y plus(minus(x,s(0())),minus(y,s(s(z)))) -> plus(minus(y,s(s(z))),minus(x,s(0()))) plus(s(x),y) -> s(plus(x,y)) quot(0(),s(y)) -> 0() quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) - Signature: {minus/2,plus/2,quot/2} / {0/0,s/1} - Obligation: runtime complexity wrt. defined symbols {minus,plus,quot} 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: minus(x,0()) -> x minus(s(x),s(y)) -> minus(x,y) plus(0(),y) -> y plus(minus(x,s(0())),minus(y,s(s(z)))) -> plus(minus(y,s(s(z))),minus(x,s(0()))) plus(s(x),y) -> s(plus(x,y)) quot(0(),s(y)) -> 0() quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) - Signature: {minus/2,plus/2,quot/2} / {0/0,s/1} - Obligation: runtime complexity wrt. defined symbols {minus,plus,quot} and constructors {0,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: minus(x,y){x -> s(x),y -> s(y)} = minus(s(x),s(y)) ->^+ minus(x,y) = C[minus(x,y) = minus(x,y){}] ** Step 1.b:1: DependencyPairs WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: minus(x,0()) -> x minus(s(x),s(y)) -> minus(x,y) plus(0(),y) -> y plus(minus(x,s(0())),minus(y,s(s(z)))) -> plus(minus(y,s(s(z))),minus(x,s(0()))) plus(s(x),y) -> s(plus(x,y)) quot(0(),s(y)) -> 0() quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) - Signature: {minus/2,plus/2,quot/2} / {0/0,s/1} - Obligation: runtime complexity wrt. defined symbols {minus,plus,quot} and constructors {0,s} + Applied Processor: DependencyPairs {dpKind_ = WIDP} + Details: We add the following weak dependency pairs: Strict DPs minus#(x,0()) -> c_1(x) minus#(s(x),s(y)) -> c_2(minus#(x,y)) plus#(0(),y) -> c_3(y) plus#(minus(x,s(0())),minus(y,s(s(z)))) -> c_4(plus#(minus(y,s(s(z))),minus(x,s(0())))) plus#(s(x),y) -> c_5(plus#(x,y)) quot#(0(),s(y)) -> c_6() quot#(s(x),s(y)) -> c_7(quot#(minus(x,y),s(y))) Weak DPs and mark the set of starting terms. ** Step 1.b:2: UsableRules WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: minus#(x,0()) -> c_1(x) minus#(s(x),s(y)) -> c_2(minus#(x,y)) plus#(0(),y) -> c_3(y) plus#(minus(x,s(0())),minus(y,s(s(z)))) -> c_4(plus#(minus(y,s(s(z))),minus(x,s(0())))) plus#(s(x),y) -> c_5(plus#(x,y)) quot#(0(),s(y)) -> c_6() quot#(s(x),s(y)) -> c_7(quot#(minus(x,y),s(y))) - Strict TRS: minus(x,0()) -> x minus(s(x),s(y)) -> minus(x,y) plus(0(),y) -> y plus(minus(x,s(0())),minus(y,s(s(z)))) -> plus(minus(y,s(s(z))),minus(x,s(0()))) plus(s(x),y) -> s(plus(x,y)) quot(0(),s(y)) -> 0() quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) - Signature: {minus/2,plus/2,quot/2,minus#/2,plus#/2,quot#/2} / {0/0,s/1,c_1/1,c_2/1,c_3/1,c_4/1,c_5/1,c_6/0,c_7/1} - Obligation: runtime complexity wrt. defined symbols {minus#,plus#,quot#} and constructors {0,s}
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127