Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433307717
details
property
value
status
complete
benchmark
#3.2.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n160.star.cs.uiowa.edu
space
AG01
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
11.2534 seconds
cpu usage
22.1913
user time
20.6928
system time
1.49851
max virtual memory
1.9241544E7
max residence set size
3870580.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), O(n^1))
output
22.11/7.49 WORST_CASE(Omega(n^1), O(n^1)) 22.11/7.49 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 22.11/7.49 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 22.11/7.49 22.11/7.49 22.11/7.49 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). 22.11/7.49 22.11/7.49 (0) CpxTRS 22.11/7.49 (1) RcToIrcProof [BOTH BOUNDS(ID, ID), 0 ms] 22.11/7.49 (2) CpxTRS 22.11/7.49 (3) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] 22.11/7.49 (4) CpxWeightedTrs 22.11/7.49 (5) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 22.11/7.49 (6) CpxTypedWeightedTrs 22.11/7.49 (7) CompletionProof [UPPER BOUND(ID), 0 ms] 22.11/7.49 (8) CpxTypedWeightedCompleteTrs 22.11/7.49 (9) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] 22.11/7.49 (10) CpxRNTS 22.11/7.49 (11) CompleteCoflocoProof [FINISHED, 283 ms] 22.11/7.49 (12) BOUNDS(1, n^1) 22.11/7.49 (13) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] 22.11/7.49 (14) TRS for Loop Detection 22.11/7.49 (15) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] 22.11/7.49 (16) BEST 22.11/7.49 (17) proven lower bound 22.11/7.49 (18) LowerBoundPropagationProof [FINISHED, 0 ms] 22.11/7.49 (19) BOUNDS(n^1, INF) 22.11/7.49 (20) TRS for Loop Detection 22.11/7.49 22.11/7.49 22.11/7.49 ---------------------------------------- 22.11/7.49 22.11/7.49 (0) 22.11/7.49 Obligation: 22.11/7.49 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). 22.11/7.49 22.11/7.49 22.11/7.49 The TRS R consists of the following rules: 22.11/7.49 22.11/7.49 pred(s(x)) -> x 22.11/7.49 minus(x, 0) -> x 22.11/7.49 minus(x, s(y)) -> pred(minus(x, y)) 22.11/7.49 quot(0, s(y)) -> 0 22.11/7.49 quot(s(x), s(y)) -> s(quot(minus(x, y), s(y))) 22.11/7.49 22.11/7.49 S is empty. 22.11/7.49 Rewrite Strategy: FULL 22.11/7.49 ---------------------------------------- 22.11/7.49 22.11/7.49 (1) RcToIrcProof (BOTH BOUNDS(ID, ID)) 22.11/7.49 Converted rc-obligation to irc-obligation. 22.11/7.49 22.11/7.49 The duplicating contexts are: 22.11/7.49 quot(s(x), s([])) 22.11/7.49 22.11/7.49 22.11/7.49 The defined contexts are: 22.11/7.49 quot([], s(x1)) 22.11/7.49 pred([]) 22.11/7.49 minus([], x1) 22.11/7.49 22.11/7.49 22.11/7.49 As the TRS is an overlay system and the defined contexts and the duplicating contexts don't overlap, we have rc = irc. 22.11/7.49 ---------------------------------------- 22.11/7.49 22.11/7.49 (2) 22.11/7.49 Obligation: 22.11/7.49 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, n^1). 22.11/7.49 22.11/7.49 22.11/7.49 The TRS R consists of the following rules: 22.11/7.49 22.11/7.49 pred(s(x)) -> x 22.11/7.49 minus(x, 0) -> x 22.11/7.49 minus(x, s(y)) -> pred(minus(x, y)) 22.11/7.50 quot(0, s(y)) -> 0 22.11/7.50 quot(s(x), s(y)) -> s(quot(minus(x, y), s(y))) 22.11/7.50 22.11/7.50 S is empty. 22.11/7.50 Rewrite Strategy: INNERMOST 22.11/7.50 ---------------------------------------- 22.11/7.50 22.11/7.50 (3) RelTrsToWeightedTrsProof (BOTH BOUNDS(ID, ID)) 22.11/7.50 Transformed relative TRS to weighted TRS 22.11/7.50 ---------------------------------------- 22.11/7.50 22.11/7.50 (4) 22.11/7.50 Obligation: 22.11/7.50 The Runtime Complexity (innermost) of the given CpxWeightedTrs could be proven to be BOUNDS(1, n^1). 22.11/7.50 22.11/7.50 22.11/7.50 The TRS R consists of the following rules: 22.11/7.50 22.11/7.50 pred(s(x)) -> x [1] 22.11/7.50 minus(x, 0) -> x [1] 22.11/7.50 minus(x, s(y)) -> pred(minus(x, y)) [1] 22.11/7.50 quot(0, s(y)) -> 0 [1] 22.11/7.50 quot(s(x), s(y)) -> s(quot(minus(x, y), s(y))) [1] 22.11/7.50 22.11/7.50 Rewrite Strategy: INNERMOST
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