Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904711
details
property
value
status
complete
benchmark
#3.8a.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n026.star.cs.uiowa.edu
space
AG01
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
6.87125778198 seconds
cpu usage
32.237257358
max memory
1.30879488E8
stage attributes
key
value
output-size
30822
starexec-result
WORST_CASE(Omega(n^1),O(n^3))
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^3)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^3)) + Considered Problem: - Strict TRS: log(s(0())) -> 0() log(s(s(x))) -> s(log(s(quot(x,s(s(0())))))) minus(x,0()) -> x minus(x,s(y)) -> pred(minus(x,y)) pred(s(x)) -> x quot(0(),s(y)) -> 0() quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) - Signature: {log/1,minus/2,pred/1,quot/2} / {0/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {log,minus,pred,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: log(s(0())) -> 0() log(s(s(x))) -> s(log(s(quot(x,s(s(0())))))) minus(x,0()) -> x minus(x,s(y)) -> pred(minus(x,y)) pred(s(x)) -> x quot(0(),s(y)) -> 0() quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) - Signature: {log/1,minus/2,pred/1,quot/2} / {0/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {log,minus,pred,quot} and constructors {0,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: minus(x,y){y -> s(y)} = minus(x,s(y)) ->^+ pred(minus(x,y)) = C[minus(x,y) = minus(x,y){}] ** Step 1.b:1: DependencyPairs WORST_CASE(?,O(n^3)) + Considered Problem: - Strict TRS: log(s(0())) -> 0() log(s(s(x))) -> s(log(s(quot(x,s(s(0())))))) minus(x,0()) -> x minus(x,s(y)) -> pred(minus(x,y)) pred(s(x)) -> x quot(0(),s(y)) -> 0() quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) - Signature: {log/1,minus/2,pred/1,quot/2} / {0/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {log,minus,pred,quot} and constructors {0,s} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs log#(s(0())) -> c_1() log#(s(s(x))) -> c_2(log#(s(quot(x,s(s(0()))))),quot#(x,s(s(0())))) minus#(x,0()) -> c_3() minus#(x,s(y)) -> c_4(pred#(minus(x,y)),minus#(x,y)) pred#(s(x)) -> c_5() quot#(0(),s(y)) -> c_6() quot#(s(x),s(y)) -> c_7(quot#(minus(x,y),s(y)),minus#(x,y)) Weak DPs and mark the set of starting terms. ** Step 1.b:2: PredecessorEstimation WORST_CASE(?,O(n^3)) + Considered Problem: - Strict DPs: log#(s(0())) -> c_1() log#(s(s(x))) -> c_2(log#(s(quot(x,s(s(0()))))),quot#(x,s(s(0())))) minus#(x,0()) -> c_3() minus#(x,s(y)) -> c_4(pred#(minus(x,y)),minus#(x,y)) pred#(s(x)) -> c_5() quot#(0(),s(y)) -> c_6() quot#(s(x),s(y)) -> c_7(quot#(minus(x,y),s(y)),minus#(x,y)) - Weak TRS: log(s(0())) -> 0() log(s(s(x))) -> s(log(s(quot(x,s(s(0())))))) minus(x,0()) -> x minus(x,s(y)) -> pred(minus(x,y)) pred(s(x)) -> x quot(0(),s(y)) -> 0() quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) - Signature: {log/1,minus/2,pred/1,quot/2,log#/1,minus#/2,pred#/1,quot#/2} / {0/0,s/1,c_1/0,c_2/2,c_3/0,c_4/2,c_5/0,c_6/0 ,c_7/2} - Obligation:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807