Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381905216
details
property
value
status
complete
benchmark
Ex6_GM04_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n075.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
0.115345954895 seconds
cpu usage
0.383781107
max memory
1.9972096E7
stage attributes
key
value
output-size
4940
starexec-result
WORST_CASE(?,O(1))
output
/export/starexec/sandbox/solver/bin/starexec_run_tct_rci /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(1)) * Step 1: Sum WORST_CASE(?,O(1)) + Considered Problem: - Strict TRS: a__c() -> a__f(g(c())) a__c() -> c() a__f(X) -> f(X) a__f(g(X)) -> g(X) mark(c()) -> a__c() mark(f(X)) -> a__f(X) mark(g(X)) -> g(X) - Signature: {a__c/0,a__f/1,mark/1} / {c/0,f/1,g/1} - Obligation: innermost runtime complexity wrt. defined symbols {a__c,a__f,mark} and constructors {c,f,g} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DependencyPairs WORST_CASE(?,O(1)) + Considered Problem: - Strict TRS: a__c() -> a__f(g(c())) a__c() -> c() a__f(X) -> f(X) a__f(g(X)) -> g(X) mark(c()) -> a__c() mark(f(X)) -> a__f(X) mark(g(X)) -> g(X) - Signature: {a__c/0,a__f/1,mark/1} / {c/0,f/1,g/1} - Obligation: innermost runtime complexity wrt. defined symbols {a__c,a__f,mark} and constructors {c,f,g} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs a__c#() -> c_1(a__f#(g(c()))) a__c#() -> c_2() a__f#(X) -> c_3() a__f#(g(X)) -> c_4() mark#(c()) -> c_5(a__c#()) mark#(f(X)) -> c_6(a__f#(X)) mark#(g(X)) -> c_7() Weak DPs and mark the set of starting terms. * Step 3: UsableRules WORST_CASE(?,O(1)) + Considered Problem: - Strict DPs: a__c#() -> c_1(a__f#(g(c()))) a__c#() -> c_2() a__f#(X) -> c_3() a__f#(g(X)) -> c_4() mark#(c()) -> c_5(a__c#()) mark#(f(X)) -> c_6(a__f#(X)) mark#(g(X)) -> c_7() - Weak TRS: a__c() -> a__f(g(c())) a__c() -> c() a__f(X) -> f(X) a__f(g(X)) -> g(X) mark(c()) -> a__c() mark(f(X)) -> a__f(X) mark(g(X)) -> g(X) - Signature: {a__c/0,a__f/1,mark/1,a__c#/0,a__f#/1,mark#/1} / {c/0,f/1,g/1,c_1/1,c_2/0,c_3/0,c_4/0,c_5/1,c_6/1,c_7/0} - Obligation: innermost runtime complexity wrt. defined symbols {a__c#,a__f#,mark#} and constructors {c,f,g} + Applied Processor: UsableRules + Details: We replace rewrite rules by usable rules: a__c#() -> c_1(a__f#(g(c()))) a__c#() -> c_2() a__f#(X) -> c_3() a__f#(g(X)) -> c_4() mark#(c()) -> c_5(a__c#()) mark#(f(X)) -> c_6(a__f#(X)) mark#(g(X)) -> c_7() * Step 4: Trivial WORST_CASE(?,O(1)) + Considered Problem: - Strict DPs: a__c#() -> c_1(a__f#(g(c()))) a__c#() -> c_2() a__f#(X) -> c_3() a__f#(g(X)) -> c_4() mark#(c()) -> c_5(a__c#()) mark#(f(X)) -> c_6(a__f#(X)) mark#(g(X)) -> c_7() - Signature:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807