Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922534
details
property
value
status
complete
benchmark
z068.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n057.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
293.644428015 seconds
cpu usage
465.309007173
max memory
2.2043648E9
stage attributes
key
value
output-size
13658
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: NaturalMI WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: B(B(x1)) -> b(x1) B(b(x1)) -> x1 C(x1) -> c(x1) C(c(x1)) -> x1 b(B(x1)) -> x1 b(b(x1)) -> B(x1) c(B(c(b(c(x1))))) -> B(c(b(c(B(c(b(x1))))))) c(C(x1)) -> x1 c(c(x1)) -> x1 - Signature: {B/1,C/1,b/1,c/1} / {} - Obligation: derivational complexity wrt. signature {B,C,b,c} + Applied Processor: NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = NoUArgs, urules = NoURules, selector = Just 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(B) = [1] x1 + [0] p(C) = [1] x1 + [2] p(b) = [1] x1 + [0] p(c) = [1] x1 + [0] Following rules are strictly oriented: C(x1) = [1] x1 + [2] > [1] x1 + [0] = c(x1) C(c(x1)) = [1] x1 + [2] > [1] x1 + [0] = x1 c(C(x1)) = [1] x1 + [2] > [1] x1 + [0] = x1 Following rules are (at-least) weakly oriented: B(B(x1)) = [1] x1 + [0] >= [1] x1 + [0] = b(x1) B(b(x1)) = [1] x1 + [0] >= [1] x1 + [0] = x1 b(B(x1)) = [1] x1 + [0] >= [1] x1 + [0] = x1 b(b(x1)) = [1] x1 + [0] >= [1] x1 + [0] = B(x1) c(B(c(b(c(x1))))) = [1] x1 + [0] >= [1] x1 + [0] = B(c(b(c(B(c(b(x1))))))) c(c(x1)) = [1] x1 + [0] >= [1] x1 + [0] = x1 * Step 2: NaturalMI WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: B(B(x1)) -> b(x1) B(b(x1)) -> x1 b(B(x1)) -> x1 b(b(x1)) -> B(x1) c(B(c(b(c(x1))))) -> B(c(b(c(B(c(b(x1))))))) c(c(x1)) -> x1 - Weak TRS: C(x1) -> c(x1) C(c(x1)) -> x1 c(C(x1)) -> x1 - Signature: {B/1,C/1,b/1,c/1} / {} - Obligation: derivational complexity wrt. signature {B,C,b,c} + Applied Processor: NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = NoUArgs, urules = NoURules, selector = Just 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:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Deriv Compl Full Rewri 33144