Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime Complexity: TRS pair #487111344
details
property
value
status
complete
benchmark
#3.26.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n141.star.cs.uiowa.edu
space
AG01
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.57 seconds
cpu usage
702.568
user time
695.927
system time
6.6403
max virtual memory
3.7375268E7
max residence set size
8936384.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), ?)
output
WORST_CASE(Omega(n^1), ?) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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), 455 ms] (8) proven lower bound (9) LowerBoundPropagationProof [FINISHED, 0 ms] (10) BOUNDS(n^1, INF) ---------------------------------------- (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: f(x) -> s(x) f(s(s(x))) -> s(f(f(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: f(x) -> s(x) f(s(s(x))) -> s(f(f(x))) S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation: TRS: Rules: f(x) -> s(x) f(s(s(x))) -> s(f(f(x))) Types: f :: s -> s s :: s -> s hole_s1_0 :: s gen_s2_0 :: Nat -> s ---------------------------------------- (5) OrderProof (LOWER BOUND(ID)) Heuristically decided to analyse the following defined symbols: f ---------------------------------------- (6) Obligation: TRS: Rules: f(x) -> s(x) f(s(s(x))) -> s(f(f(x))) Types: f :: s -> s s :: s -> s hole_s1_0 :: s gen_s2_0 :: Nat -> s Generator Equations: gen_s2_0(0) <=> hole_s1_0 gen_s2_0(+(x, 1)) <=> s(gen_s2_0(x)) The following defined symbols remain to be analysed: f ----------------------------------------
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runtime Complexity: TRS