Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433307916
details
property
value
status
complete
benchmark
t002.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n066.star.cs.uiowa.edu
space
HirokawaMiddeldorp_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.611 seconds
cpu usage
317.199
user time
314.227
system time
2.9724
max virtual memory
1.9147296E7
max residence set size
5224824.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), O(n^2))
output
317.05/291.54 WORST_CASE(Omega(n^1), O(n^2)) 317.05/291.56 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 317.05/291.56 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 317.05/291.56 317.05/291.56 317.05/291.56 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^2). 317.05/291.56 317.05/291.56 (0) CpxTRS 317.05/291.56 (1) RcToIrcProof [BOTH BOUNDS(ID, ID), 0 ms] 317.05/291.56 (2) CpxTRS 317.05/291.56 (3) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] 317.05/291.56 (4) CpxWeightedTrs 317.05/291.56 (5) CpxWeightedTrsRenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 317.05/291.56 (6) CpxWeightedTrs 317.05/291.56 (7) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 317.05/291.56 (8) CpxTypedWeightedTrs 317.05/291.56 (9) CompletionProof [UPPER BOUND(ID), 0 ms] 317.05/291.56 (10) CpxTypedWeightedCompleteTrs 317.05/291.56 (11) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] 317.05/291.56 (12) CpxTypedWeightedCompleteTrs 317.05/291.56 (13) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] 317.05/291.56 (14) CpxRNTS 317.05/291.56 (15) InliningProof [UPPER BOUND(ID), 0 ms] 317.05/291.56 (16) CpxRNTS 317.05/291.56 (17) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms] 317.05/291.56 (18) CpxRNTS 317.05/291.56 (19) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 3 ms] 317.05/291.56 (20) CpxRNTS 317.05/291.56 (21) ResultPropagationProof [UPPER BOUND(ID), 1 ms] 317.05/291.56 (22) CpxRNTS 317.05/291.56 (23) IntTrsBoundProof [UPPER BOUND(ID), 479 ms] 317.05/291.56 (24) CpxRNTS 317.05/291.56 (25) IntTrsBoundProof [UPPER BOUND(ID), 159 ms] 317.05/291.56 (26) CpxRNTS 317.05/291.56 (27) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 317.05/291.56 (28) CpxRNTS 317.05/291.56 (29) IntTrsBoundProof [UPPER BOUND(ID), 272 ms] 317.05/291.56 (30) CpxRNTS 317.05/291.56 (31) IntTrsBoundProof [UPPER BOUND(ID), 117 ms] 317.05/291.56 (32) CpxRNTS 317.05/291.56 (33) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 317.05/291.56 (34) CpxRNTS 317.05/291.56 (35) IntTrsBoundProof [UPPER BOUND(ID), 281 ms] 317.05/291.56 (36) CpxRNTS 317.05/291.56 (37) IntTrsBoundProof [UPPER BOUND(ID), 73 ms] 317.05/291.56 (38) CpxRNTS 317.05/291.56 (39) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 317.05/291.56 (40) CpxRNTS 317.05/291.56 (41) IntTrsBoundProof [UPPER BOUND(ID), 1091 ms] 317.05/291.56 (42) CpxRNTS 317.05/291.56 (43) IntTrsBoundProof [UPPER BOUND(ID), 551 ms] 317.05/291.56 (44) CpxRNTS 317.05/291.56 (45) FinalProof [FINISHED, 0 ms] 317.05/291.56 (46) BOUNDS(1, n^2) 317.05/291.56 (47) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] 317.05/291.56 (48) TRS for Loop Detection 317.05/291.56 (49) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] 317.05/291.56 (50) BEST 317.05/291.56 (51) proven lower bound 317.05/291.56 (52) LowerBoundPropagationProof [FINISHED, 0 ms] 317.05/291.56 (53) BOUNDS(n^1, INF) 317.05/291.56 (54) TRS for Loop Detection 317.05/291.56 317.05/291.56 317.05/291.56 ---------------------------------------- 317.05/291.56 317.05/291.56 (0) 317.05/291.56 Obligation: 317.05/291.56 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^2). 317.05/291.56 317.05/291.56 317.05/291.56 The TRS R consists of the following rules: 317.05/291.56 317.05/291.56 leq(0, y) -> true 317.05/291.56 leq(s(x), 0) -> false 317.05/291.56 leq(s(x), s(y)) -> leq(x, y) 317.05/291.56 if(true, x, y) -> x 317.05/291.56 if(false, x, y) -> y 317.05/291.56 -(x, 0) -> x 317.05/291.56 -(s(x), s(y)) -> -(x, y) 317.05/291.56 mod(0, y) -> 0 317.05/291.56 mod(s(x), 0) -> 0 317.05/291.56 mod(s(x), s(y)) -> if(leq(y, x), mod(-(s(x), s(y)), s(y)), s(x)) 317.05/291.56 317.05/291.56 S is empty. 317.05/291.56 Rewrite Strategy: FULL 317.05/291.56 ---------------------------------------- 317.05/291.56 317.05/291.56 (1) RcToIrcProof (BOTH BOUNDS(ID, ID)) 317.05/291.56 Converted rc-obligation to irc-obligation. 317.05/291.56 317.05/291.56 The duplicating contexts are: 317.05/291.56 mod(s(x), s([])) 317.05/291.56 mod(s([]), s(y)) 317.05/291.56 317.05/291.56 317.05/291.56 The defined contexts are: 317.05/291.56 if([], x1, s(x2)) 317.05/291.56 if(x0, [], s(x2)) 317.05/291.56 mod([], s(x1))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runtime_Complexity_Full_Rewriting 2019-04-01 06.11
