Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime Complexity: TRS Innermost pair #487112534
details
property
value
status
complete
benchmark
#4.34.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n149.star.cs.uiowa.edu
space
Strategy_removed_AG01
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.498 seconds
cpu usage
463.695
user time
458.486
system time
5.20872
max virtual memory
1.914858E7
max residence set size
7258936.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), O(n^2))
output
WORST_CASE(Omega(n^1), O(n^2)) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^2). (0) CpxTRS (1) CpxTrsToCdtProof [UPPER BOUND(ID), 0 ms] (2) CdtProblem (3) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms] (4) CdtProblem (5) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CdtProblem (7) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 74 ms] (8) CdtProblem (9) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 19 ms] (10) CdtProblem (11) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] (12) CdtProblem (13) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms] (14) CdtProblem (15) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] (16) CdtProblem (17) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms] (18) CdtProblem (19) CdtForwardInstantiationProof [BOTH BOUNDS(ID, ID), 0 ms] (20) CdtProblem (21) CdtForwardInstantiationProof [BOTH BOUNDS(ID, ID), 0 ms] (22) CdtProblem (23) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms] (24) CdtProblem (25) CdtForwardInstantiationProof [BOTH BOUNDS(ID, ID), 0 ms] (26) CdtProblem (27) CdtForwardInstantiationProof [BOTH BOUNDS(ID, ID), 0 ms] (28) CdtProblem (29) CdtForwardInstantiationProof [BOTH BOUNDS(ID, ID), 0 ms] (30) CdtProblem (31) CdtForwardInstantiationProof [BOTH BOUNDS(ID, ID), 0 ms] (32) CdtProblem (33) CdtRuleRemovalProof [UPPER BOUND(ADD(n^2)), 1783 ms] (34) CdtProblem (35) SIsEmptyProof [BOTH BOUNDS(ID, ID), 0 ms] (36) BOUNDS(1, 1) (37) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (38) TRS for Loop Detection (39) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (40) BEST (41) proven lower bound (42) LowerBoundPropagationProof [FINISHED, 0 ms] (43) BOUNDS(n^1, INF) (44) TRS for Loop Detection ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^2). The TRS R consists of the following rules: f(0) -> true f(1) -> false f(s(x)) -> f(x) if(true, x, y) -> x if(false, x, y) -> y g(s(x), s(y)) -> if(f(x), s(x), s(y)) g(x, c(y)) -> g(x, g(s(c(y)), y)) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (1) CpxTrsToCdtProof (UPPER BOUND(ID)) Converted Cpx (relative) TRS to CDT ---------------------------------------- (2) Obligation: Complexity Dependency Tuples Problem Rules: f(0) -> true f(1) -> false f(s(z0)) -> f(z0) if(true, z0, z1) -> z0 if(false, z0, z1) -> z1 g(s(z0), s(z1)) -> if(f(z0), s(z0), s(z1)) g(z0, c(z1)) -> g(z0, g(s(c(z1)), z1)) Tuples: F(0) -> c1 F(1) -> c2 F(s(z0)) -> c3(F(z0)) IF(true, z0, z1) -> c4 IF(false, z0, z1) -> c5 G(s(z0), s(z1)) -> c6(IF(f(z0), s(z0), s(z1)), F(z0)) G(z0, c(z1)) -> c7(G(z0, g(s(c(z1)), z1)), G(s(c(z1)), z1)) S tuples:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runtime Complexity: TRS Innermost