Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903633
details
property
value
status
complete
benchmark
PALINDROME_nokinds-noand_L.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n073.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
1.51104784012 seconds
cpu usage
3.208309648
max memory
2.08211968E8
stage attributes
key
value
output-size
2912
starexec-result
WORST_CASE(NON_POLY, ?)
output
/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(NON_POLY, ?) proof of /export/starexec/sandbox2/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(INF, INF). (0) CpxTRS (1) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (2) TRS for Loop Detection (3) InfiniteLowerBoundProof [FINISHED, 0 ms] (4) BOUNDS(INF, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(INF, INF). The TRS R consists of the following rules: __(__(X, Y), Z) -> __(X, __(Y, Z)) __(X, nil) -> X __(nil, X) -> X U11(tt) -> tt U21(tt) -> U22(isList) U22(tt) -> tt U31(tt) -> tt U41(tt) -> U42(isNeList) U42(tt) -> tt U51(tt) -> U52(isList) U52(tt) -> tt U61(tt) -> tt U71(tt) -> U72(isPal) U72(tt) -> tt U81(tt) -> tt isList -> U11(isNeList) isList -> tt isList -> U21(isList) isNeList -> U31(isQid) isNeList -> U41(isList) isNeList -> U51(isNeList) isNePal -> U61(isQid) isNePal -> U71(isQid) isPal -> U81(isNePal) isPal -> tt isQid -> tt 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(INF, INF). The TRS R consists of the following rules: __(__(X, Y), Z) -> __(X, __(Y, Z)) __(X, nil) -> X __(nil, X) -> X U11(tt) -> tt U21(tt) -> U22(isList) U22(tt) -> tt U31(tt) -> tt U41(tt) -> U42(isNeList) U42(tt) -> tt U51(tt) -> U52(isList) U52(tt) -> tt U61(tt) -> tt U71(tt) -> U72(isPal) U72(tt) -> tt U81(tt) -> tt isList -> U11(isNeList) isList -> tt isList -> U21(isList) isNeList -> U31(isQid) isNeList -> U41(isList) isNeList -> U51(isNeList) isNePal -> U61(isQid) isNePal -> U71(isQid) isPal -> U81(isNePal) isPal -> tt isQid -> tt
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127