Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922157
details
property
value
status
complete
benchmark
ExConc_Zan97_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n034.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
294.105729103 seconds
cpu usage
1166.67850127
max memory
6.50694656E8
stage attributes
key
value
output-size
57668
starexec-result
WORST_CASE(?,O(n^2))
output
/export/starexec/sandbox2/solver/bin/starexec_run_tct_dc /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^2)) * Step 1: WeightGap WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: active(f(X)) -> f(active(X)) active(f(X)) -> mark(g(h(f(X)))) active(h(X)) -> h(active(X)) f(mark(X)) -> mark(f(X)) f(ok(X)) -> ok(f(X)) g(ok(X)) -> ok(g(X)) h(mark(X)) -> mark(h(X)) h(ok(X)) -> ok(h(X)) proper(f(X)) -> f(proper(X)) proper(g(X)) -> g(proper(X)) proper(h(X)) -> h(proper(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) - Signature: {active/1,f/1,g/1,h/1,proper/1,top/1} / {mark/1,ok/1} - Obligation: derivational complexity wrt. signature {active,f,g,h,mark,ok,proper,top} + Applied Processor: WeightGap {wgDimension = 1, wgDegree = 1, wgKind = Algebraic, wgUArgs = NoUArgs, wgOn = WgOnAny} + Details: The weightgap principle applies using the following nonconstant growth matrix-interpretation: We apply a matrix interpretation of kind triangular matrix interpretation: Following symbols are considered usable: all TcT has computed the following interpretation: p(active) = [1] x1 + [0] p(f) = [1] x1 + [0] p(g) = [1] x1 + [0] p(h) = [1] x1 + [11] p(mark) = [1] x1 + [0] p(ok) = [1] x1 + [13] p(proper) = [1] x1 + [0] p(top) = [1] x1 + [0] Following rules are strictly oriented: top(ok(X)) = [1] X + [13] > [1] X + [0] = top(active(X)) Following rules are (at-least) weakly oriented: active(f(X)) = [1] X + [0] >= [1] X + [0] = f(active(X)) active(f(X)) = [1] X + [0] >= [1] X + [11] = mark(g(h(f(X)))) active(h(X)) = [1] X + [11] >= [1] X + [11] = h(active(X)) f(mark(X)) = [1] X + [0] >= [1] X + [0] = mark(f(X)) f(ok(X)) = [1] X + [13] >= [1] X + [13] = ok(f(X)) g(ok(X)) = [1] X + [13] >= [1] X + [13] = ok(g(X)) h(mark(X)) = [1] X + [11] >= [1] X + [11] = mark(h(X)) h(ok(X)) = [1] X + [24] >= [1] X + [24] = ok(h(X)) proper(f(X)) = [1] X + [0] >= [1] X + [0] = f(proper(X)) proper(g(X)) = [1] X + [0] >= [1] X + [0] = g(proper(X)) proper(h(X)) = [1] X + [11] >= [1] X + [11] = h(proper(X)) top(mark(X)) = [1] X + [0] >= [1] X + [0] = top(proper(X))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Deriv Compl Full Rewri 33144