Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433308322
details
property
value
status
complete
benchmark
ExIntrod_GM99_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n081.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.597 seconds
cpu usage
311.292
user time
309.09
system time
2.20152
max virtual memory
1.8279552E7
max residence set size
5571188.0
stage attributes
key
value
starexec-result
MAYBE
output
311.15/291.54 KILLED 311.15/291.55 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 311.15/291.55 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 311.15/291.55 311.15/291.55 311.15/291.55 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, INF). 311.15/291.55 311.15/291.55 (0) CpxTRS 311.15/291.55 (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 311.15/291.55 (2) CpxTRS 311.15/291.55 (3) SlicingProof [LOWER BOUND(ID), 0 ms] 311.15/291.55 (4) CpxTRS 311.15/291.55 (5) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 311.15/291.55 (6) typed CpxTrs 311.15/291.55 (7) OrderProof [LOWER BOUND(ID), 0 ms] 311.15/291.55 (8) typed CpxTrs 311.15/291.55 (9) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] 311.15/291.55 (10) TRS for Loop Detection 311.15/291.55 (11) DependencyGraphProof [UPPER BOUND(ID), 36 ms] 311.15/291.55 (12) CpxTRS 311.15/291.55 (13) NestedDefinedSymbolProof [UPPER BOUND(ID), 0 ms] 311.15/291.55 (14) CpxTRS 311.15/291.55 (15) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms] 311.15/291.55 (16) CpxTRS 311.15/291.55 (17) NonCtorToCtorProof [UPPER BOUND(ID), 0 ms] 311.15/291.55 (18) CpxRelTRS 311.15/291.55 (19) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] 311.15/291.55 (20) CpxWeightedTrs 311.15/291.55 (21) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 311.15/291.55 (22) CpxTypedWeightedTrs 311.15/291.55 (23) CompletionProof [UPPER BOUND(ID), 0 ms] 311.15/291.55 (24) CpxTypedWeightedCompleteTrs 311.15/291.55 (25) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] 311.15/291.55 (26) CpxTypedWeightedCompleteTrs 311.15/291.55 (27) CompletionProof [UPPER BOUND(ID), 0 ms] 311.15/291.55 (28) CpxTypedWeightedCompleteTrs 311.15/291.55 311.15/291.55 311.15/291.55 ---------------------------------------- 311.15/291.55 311.15/291.55 (0) 311.15/291.55 Obligation: 311.15/291.55 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, INF). 311.15/291.55 311.15/291.55 311.15/291.55 The TRS R consists of the following rules: 311.15/291.55 311.15/291.55 primes -> sieve(from(s(s(0)))) 311.15/291.55 from(X) -> cons(X, n__from(s(X))) 311.15/291.55 head(cons(X, Y)) -> X 311.15/291.55 tail(cons(X, Y)) -> activate(Y) 311.15/291.55 if(true, X, Y) -> activate(X) 311.15/291.55 if(false, X, Y) -> activate(Y) 311.15/291.55 filter(s(s(X)), cons(Y, Z)) -> if(divides(s(s(X)), Y), n__filter(s(s(X)), activate(Z)), n__cons(Y, n__filter(X, sieve(Y)))) 311.15/291.55 sieve(cons(X, Y)) -> cons(X, n__filter(X, sieve(activate(Y)))) 311.15/291.55 from(X) -> n__from(X) 311.15/291.55 filter(X1, X2) -> n__filter(X1, X2) 311.15/291.55 cons(X1, X2) -> n__cons(X1, X2) 311.15/291.55 activate(n__from(X)) -> from(X) 311.15/291.55 activate(n__filter(X1, X2)) -> filter(X1, X2) 311.15/291.55 activate(n__cons(X1, X2)) -> cons(X1, X2) 311.15/291.55 activate(X) -> X 311.15/291.55 311.15/291.55 S is empty. 311.15/291.55 Rewrite Strategy: FULL 311.15/291.55 ---------------------------------------- 311.15/291.55 311.15/291.55 (1) RenamingProof (BOTH BOUNDS(ID, ID)) 311.15/291.55 Renamed function symbols to avoid clashes with predefined symbol. 311.15/291.55 ---------------------------------------- 311.15/291.55 311.15/291.55 (2) 311.15/291.55 Obligation: 311.15/291.55 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, INF). 311.15/291.55 311.15/291.55 311.15/291.55 The TRS R consists of the following rules: 311.15/291.55 311.15/291.55 primes -> sieve(from(s(s(0')))) 311.15/291.55 from(X) -> cons(X, n__from(s(X))) 311.15/291.55 head(cons(X, Y)) -> X 311.15/291.55 tail(cons(X, Y)) -> activate(Y) 311.15/291.55 if(true, X, Y) -> activate(X) 311.15/291.55 if(false, X, Y) -> activate(Y) 311.15/291.55 filter(s(s(X)), cons(Y, Z)) -> if(divides(s(s(X)), Y), n__filter(s(s(X)), activate(Z)), n__cons(Y, n__filter(X, sieve(Y)))) 311.15/291.55 sieve(cons(X, Y)) -> cons(X, n__filter(X, sieve(activate(Y)))) 311.15/291.55 from(X) -> n__from(X) 311.15/291.55 filter(X1, X2) -> n__filter(X1, X2) 311.15/291.55 cons(X1, X2) -> n__cons(X1, X2) 311.15/291.55 activate(n__from(X)) -> from(X) 311.15/291.55 activate(n__filter(X1, X2)) -> filter(X1, X2) 311.15/291.55 activate(n__cons(X1, X2)) -> cons(X1, X2) 311.15/291.55 activate(X) -> X 311.15/291.55 311.15/291.55 S is empty. 311.15/291.55 Rewrite Strategy: FULL 311.15/291.55 ---------------------------------------- 311.15/291.55 311.15/291.55 (3) SlicingProof (LOWER BOUND(ID)) 311.15/291.55 Sliced the following arguments:
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
