Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433307950
details
property
value
status
complete
benchmark
ex6.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_mixed_05
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.624 seconds
cpu usage
622.221
user time
619.204
system time
3.0168
max virtual memory
1.8895088E7
max residence set size
5187512.0
stage attributes
key
value
starexec-result
MAYBE
output
622.00/291.57 KILLED 622.13/291.59 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 622.13/291.59 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 622.13/291.59 622.13/291.59 622.13/291.59 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, INF). 622.13/291.59 622.13/291.59 (0) CpxTRS 622.13/291.59 (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 622.13/291.59 (2) CpxTRS 622.13/291.59 (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 622.13/291.59 (4) typed CpxTrs 622.13/291.59 (5) OrderProof [LOWER BOUND(ID), 0 ms] 622.13/291.59 (6) typed CpxTrs 622.13/291.59 (7) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] 622.13/291.59 (8) TRS for Loop Detection 622.13/291.59 (9) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms] 622.13/291.59 (10) CpxTRS 622.13/291.59 (11) NonCtorToCtorProof [UPPER BOUND(ID), 0 ms] 622.13/291.59 (12) CpxRelTRS 622.13/291.59 (13) RcToIrcProof [BOTH BOUNDS(ID, ID), 0 ms] 622.13/291.59 (14) CpxRelTRS 622.13/291.59 (15) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] 622.13/291.59 (16) CpxWeightedTrs 622.13/291.59 (17) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 622.13/291.59 (18) CpxTypedWeightedTrs 622.13/291.59 (19) CompletionProof [UPPER BOUND(ID), 0 ms] 622.13/291.59 (20) CpxTypedWeightedCompleteTrs 622.13/291.59 (21) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] 622.13/291.59 (22) CpxTypedWeightedCompleteTrs 622.13/291.59 (23) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] 622.13/291.59 (24) CpxRNTS 622.13/291.59 (25) InliningProof [UPPER BOUND(ID), 210 ms] 622.13/291.59 (26) CpxRNTS 622.13/291.59 (27) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms] 622.13/291.59 (28) CpxRNTS 622.13/291.59 (29) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms] 622.13/291.59 (30) CpxRNTS 622.13/291.59 (31) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 622.13/291.59 (32) CpxRNTS 622.13/291.59 (33) IntTrsBoundProof [UPPER BOUND(ID), 140 ms] 622.13/291.59 (34) CpxRNTS 622.13/291.59 (35) IntTrsBoundProof [UPPER BOUND(ID), 25 ms] 622.13/291.59 (36) CpxRNTS 622.13/291.59 (37) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 622.13/291.59 (38) CpxRNTS 622.13/291.59 (39) IntTrsBoundProof [UPPER BOUND(ID), 4554 ms] 622.13/291.59 (40) CpxRNTS 622.13/291.59 (41) IntTrsBoundProof [UPPER BOUND(ID), 1564 ms] 622.13/291.59 (42) CpxRNTS 622.13/291.59 (43) CompletionProof [UPPER BOUND(ID), 0 ms] 622.13/291.59 (44) CpxTypedWeightedCompleteTrs 622.13/291.59 (45) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] 622.13/291.59 (46) CpxRNTS 622.13/291.59 (47) CpxTrsToCdtProof [UPPER BOUND(ID), 0 ms] 622.13/291.59 (48) CdtProblem 622.13/291.59 (49) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms] 622.13/291.59 (50) CdtProblem 622.13/291.59 (51) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms] 622.13/291.59 (52) CdtProblem 622.13/291.59 (53) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 0 ms] 622.13/291.59 (54) CdtProblem 622.13/291.59 (55) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] 622.13/291.59 (56) CdtProblem 622.13/291.59 (57) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms] 622.13/291.59 (58) CdtProblem 622.13/291.59 (59) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] 622.13/291.59 (60) CdtProblem 622.13/291.59 (61) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms] 622.13/291.59 (62) CdtProblem 622.13/291.59 (63) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] 622.13/291.59 (64) CdtProblem 622.13/291.59 (65) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms] 622.13/291.59 (66) CdtProblem 622.13/291.59 (67) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] 622.13/291.59 (68) CdtProblem 622.13/291.59 (69) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms] 622.13/291.59 (70) CdtProblem 622.13/291.59 (71) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 0 ms] 622.13/291.59 (72) CdtProblem 622.13/291.59 (73) CdtInstantiationProof [BOTH BOUNDS(ID, ID), 0 ms] 622.13/291.59 (74) CdtProblem 622.13/291.59 (75) CdtInstantiationProof [BOTH BOUNDS(ID, ID), 0 ms] 622.13/291.59 (76) CdtProblem 622.13/291.59 (77) CdtInstantiationProof [BOTH BOUNDS(ID, ID), 0 ms] 622.13/291.59 (78) CdtProblem 622.13/291.59 (79) CdtInstantiationProof [BOTH BOUNDS(ID, ID), 0 ms] 622.13/291.59 (80) CdtProblem 622.13/291.59 622.13/291.59 622.13/291.59 ---------------------------------------- 622.13/291.59 622.13/291.59 (0) 622.13/291.59 Obligation: 622.13/291.59 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, INF). 622.13/291.59 622.13/291.59 622.13/291.59 The TRS R consists of the following rules: 622.13/291.59 622.13/291.59 f(x, x) -> f(i(x), g(g(x)))
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
