Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903745
details
property
value
status
complete
benchmark
PALINDROME_nosorts_noand_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n035.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
292.737401009 seconds
cpu usage
1116.49687497
max memory
1.533319168E10
stage attributes
key
value
output-size
4771
starexec-result
WORST_CASE(Omega(n^1), ?)
output
/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), ?) 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(n^1, 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 ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: a____(__(X, Y), Z) -> a____(mark(X), a____(mark(Y), mark(Z))) a____(X, nil) -> mark(X) a____(nil, X) -> mark(X) a__U11(tt) -> a__U12(tt) a__U12(tt) -> tt a__isNePal(__(I, __(P, I))) -> a__U11(tt) mark(__(X1, X2)) -> a____(mark(X1), mark(X2)) mark(U11(X)) -> a__U11(mark(X)) mark(U12(X)) -> a__U12(mark(X)) mark(isNePal(X)) -> a__isNePal(mark(X)) mark(nil) -> nil mark(tt) -> tt a____(X1, X2) -> __(X1, X2) a__U11(X) -> U11(X) a__U12(X) -> U12(X) a__isNePal(X) -> isNePal(X) 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(n^1, INF). The TRS R consists of the following rules: a____(__(X, Y), Z) -> a____(mark(X), a____(mark(Y), mark(Z))) a____(X, nil) -> mark(X) a____(nil, X) -> mark(X) a__U11(tt) -> a__U12(tt) a__U12(tt) -> tt a__isNePal(__(I, __(P, I))) -> a__U11(tt) mark(__(X1, X2)) -> a____(mark(X1), mark(X2)) mark(U11(X)) -> a__U11(mark(X)) mark(U12(X)) -> a__U12(mark(X)) mark(isNePal(X)) -> a__isNePal(mark(X)) mark(nil) -> nil mark(tt) -> tt a____(X1, X2) -> __(X1, X2) a__U11(X) -> U11(X) a__U12(X) -> U12(X) a__isNePal(X) -> isNePal(X) S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) DecreasingLoopProof (LOWER BOUND(ID)) The following loop(s) give(s) rise to the lower bound Omega(n^1): The rewrite sequence mark(U12(X)) ->^+ a__U12(mark(X)) gives rise to a decreasing loop by considering the right hand sides subterm at position [0]. The pumping substitution is [X / U12(X)]. The result substitution is [ ].
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127