Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922146
details
property
value
status
complete
benchmark
17.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n055.star.cs.uiowa.edu
space
Der95
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
38.1923499107 seconds
cpu usage
118.074018953
max memory
7.17930496E8
stage attributes
key
value
output-size
16555
starexec-result
WORST_CASE(?,O(n^6))
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^6)) * Step 1: DecomposeCP WORST_CASE(?,O(n^6)) + Considered Problem: - Strict TRS: .(x,1()) -> x .(x,i(x)) -> 1() .(y,.(i(y),z)) -> z .(.(x,y),z) -> .(x,.(y,z)) .(1(),x) -> x .(i(x),x) -> 1() .(i(y),.(y,z)) -> z i(.(x,y)) -> .(i(y),i(x)) i(1()) -> 1() i(i(x)) -> x - Signature: {./2,i/1} / {1/0} - Obligation: derivational complexity wrt. signature {.,1,i} + Applied Processor: DecomposeCP {onSelectionCP_ = any strict-rules, withBoundCP_ = RelativeComp, withCP_ = NaturalMI {miDimension = 2, miDegree = 2, miKind = Algebraic, uargs = NoUArgs, urules = NoURules, selector = Nothing}} + Details: We first use the processor NaturalMI {miDimension = 2, miDegree = 2, miKind = Algebraic, uargs = NoUArgs, urules = NoURules, selector = Nothing} to orient following rules strictly: i(.(x,y)) -> .(i(y),i(x)) The Processor induces the complexity certificate TIME (?,O(n^2)) SPACE(?,?) Observe that weak rules from Problem (R) are non-size-increasing. Once the complexity of (R) has been assessed, it suffices to consider only rules whose complexity has not been estimated in (R) resulting in the following Problem (S). Overall the certificate is obtained by composition. Problem (S) - Strict TRS: .(x,1()) -> x .(x,i(x)) -> 1() .(y,.(i(y),z)) -> z .(.(x,y),z) -> .(x,.(y,z)) .(1(),x) -> x .(i(x),x) -> 1() .(i(y),.(y,z)) -> z i(1()) -> 1() i(i(x)) -> x - Signature: {./2,i/1} / {1/0} - Obligation: derivational complexity wrt. signature {.,1,i} ** Step 1.a:1: NaturalMI WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: .(x,1()) -> x .(x,i(x)) -> 1() .(y,.(i(y),z)) -> z .(.(x,y),z) -> .(x,.(y,z)) .(1(),x) -> x .(i(x),x) -> 1() .(i(y),.(y,z)) -> z i(.(x,y)) -> .(i(y),i(x)) i(1()) -> 1() i(i(x)) -> x - Signature: {./2,i/1} / {1/0} - Obligation: derivational complexity wrt. signature {.,1,i} + Applied Processor: NaturalMI {miDimension = 2, miDegree = 2, miKind = Algebraic, uargs = NoUArgs, urules = NoURules, selector = Just first alternative for decompose on any strict-rules} + Details: We apply a matrix interpretation of kind triangular matrix interpretation: Following symbols are considered usable: all TcT has computed the following interpretation: p(.) = [1 0] x1 + [1 0] x2 + [0] [0 1] [0 1] [2] p(1) = [0] [0] p(i) = [1 4] x1 + [0] [0 1] [0] Following rules are strictly oriented: i(.(x,y)) = [1 4] x + [1 4] y + [8] [0 1] [0 1] [2] > [1 4] x + [1 4] y + [0] [0 1] [0 1] [2] = .(i(y),i(x)) Following rules are (at-least) weakly oriented: .(x,1()) = [1 0] x + [0] [0 1] [2] >= [1 0] x + [0] [0 1] [0] = x .(x,i(x)) = [2 4] x + [0] [0 2] [2]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Deriv Compl Full Rewri 33144