Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381902676
details
property
value
status
complete
benchmark
cime3.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n041.star.cs.uiowa.edu
space
Secret_05_TRS
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
1.76172995567 seconds
cpu usage
4.063600078
max memory
2.28184064E8
stage attributes
key
value
output-size
6796
starexec-result
WORST_CASE(NON_POLY, ?)
output
/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(NON_POLY, ?) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(EXP, INF). (0) CpxTRS (1) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (2) TRS for Loop Detection (3) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (4) BEST (5) proven lower bound (6) LowerBoundPropagationProof [FINISHED, 0 ms] (7) BOUNDS(n^1, INF) (8) TRS for Loop Detection (9) DecreasingLoopProof [FINISHED, 32 ms] (10) BOUNDS(EXP, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(EXP, INF). The TRS R consists of the following rules: a__a -> a__c a__b -> a__c a__c -> e a__k -> l a__d -> m a__a -> a__d a__b -> a__d a__c -> l a__k -> m a__A -> a__h(a__f(a__a), a__f(a__b)) a__h(X, X) -> a__g(mark(X), mark(X), a__f(a__k)) a__g(d, X, X) -> a__A a__f(X) -> a__z(mark(X), X) a__z(e, X) -> mark(X) mark(A) -> a__A mark(a) -> a__a mark(b) -> a__b mark(c) -> a__c mark(d) -> a__d mark(k) -> a__k mark(z(X1, X2)) -> a__z(mark(X1), X2) mark(f(X)) -> a__f(mark(X)) mark(h(X1, X2)) -> a__h(mark(X1), mark(X2)) mark(g(X1, X2, X3)) -> a__g(mark(X1), mark(X2), mark(X3)) mark(e) -> e mark(l) -> l mark(m) -> m a__A -> A a__a -> a a__b -> b a__c -> c a__d -> d a__k -> k a__z(X1, X2) -> z(X1, X2) a__f(X) -> f(X) a__h(X1, X2) -> h(X1, X2) a__g(X1, X2, X3) -> g(X1, X2, X3) S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) RelTrsToDecreasingLoopProblemProof (LOWER BOUND(ID)) Transformed a relative TRS into a decreasing-loop problem. ---------------------------------------- (2) Obligation: Analyzing the following TRS for decreasing loops: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(EXP, INF). The TRS R consists of the following rules: a__a -> a__c a__b -> a__c a__c -> e a__k -> l a__d -> m a__a -> a__d a__b -> a__d a__c -> l a__k -> m a__A -> a__h(a__f(a__a), a__f(a__b))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127