Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381902222
details
property
value
status
complete
benchmark
20.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n038.star.cs.uiowa.edu
space
Der95
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
294.843063831 seconds
cpu usage
1076.41047348
max memory
1.7368215552E10
stage attributes
key
value
output-size
3274
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: not(not(x)) -> x not(or(x, y)) -> and(not(not(not(x))), not(not(not(y)))) not(and(x, y)) -> or(not(not(not(x))), not(not(not(y)))) 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: not(not(x)) -> x not(or(x, y)) -> and(not(not(not(x))), not(not(not(y)))) not(and(x, y)) -> or(not(not(not(x))), not(not(not(y)))) 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 not(or(x, y)) ->^+ and(not(not(not(x))), not(not(not(y)))) gives rise to a decreasing loop by considering the right hand sides subterm at position [0,0,0]. The pumping substitution is [x / or(x, y)]. The result substitution is [ ]. ---------------------------------------- (4) Complex Obligation (BEST) ---------------------------------------- (5) Obligation: Proved the lower bound n^1 for the following 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: not(not(x)) -> x not(or(x, y)) -> and(not(not(not(x))), not(not(not(y)))) not(and(x, y)) -> or(not(not(not(x))), not(not(not(y)))) S is empty. Rewrite Strategy: FULL
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127