Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381902120
details
property
value
status
complete
benchmark
tpa2.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n050.star.cs.uiowa.edu
space
Secret_05_TRS
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.470839024 seconds
cpu usage
302.280734445
max memory
5.439328256E9
stage attributes
key
value
output-size
5137
starexec-result
WORST_CASE(Omega(n^1), ?)
output
/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), ?) 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(n^1, INF). (0) CpxTRS (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxTRS (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (4) typed CpxTrs (5) OrderProof [LOWER BOUND(ID), 0 ms] (6) typed CpxTrs (7) RewriteLemmaProof [LOWER BOUND(ID), 287 ms] (8) BEST (9) proven lower bound (10) LowerBoundPropagationProof [FINISHED, 0 ms] (11) BOUNDS(n^1, INF) (12) typed CpxTrs ---------------------------------------- (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: -(x, 0) -> x -(s(x), s(y)) -> -(x, y) p(s(x)) -> x f(s(x), y) -> f(p(-(s(x), y)), p(-(y, s(x)))) f(x, s(y)) -> f(p(-(x, s(y))), p(-(s(y), x))) S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) RenamingProof (BOTH BOUNDS(ID, ID)) Renamed function symbols to avoid clashes with predefined symbol. ---------------------------------------- (2) 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: -(x, 0') -> x -(s(x), s(y)) -> -(x, y) p(s(x)) -> x f(s(x), y) -> f(p(-(s(x), y)), p(-(y, s(x)))) f(x, s(y)) -> f(p(-(x, s(y))), p(-(s(y), x))) S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation: TRS: Rules: -(x, 0') -> x -(s(x), s(y)) -> -(x, y) p(s(x)) -> x f(s(x), y) -> f(p(-(s(x), y)), p(-(y, s(x)))) f(x, s(y)) -> f(p(-(x, s(y))), p(-(s(y), x))) Types: - :: 0':s -> 0':s -> 0':s 0' :: 0':s s :: 0':s -> 0':s p :: 0':s -> 0':s f :: 0':s -> 0':s -> f hole_0':s1_0 :: 0':s hole_f2_0 :: f gen_0':s3_0 :: Nat -> 0':s ---------------------------------------- (5) OrderProof (LOWER BOUND(ID)) Heuristically decided to analyse the following defined symbols: -, f They will be analysed ascendingly in the following order: - < f
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127