Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433308433
details
property
value
status
complete
benchmark
4.22.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n089.star.cs.uiowa.edu
space
SK90
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
292.086 seconds
cpu usage
378.271
user time
367.979
system time
10.2914
max virtual memory
1.8279388E7
max residence set size
1.4106068E7
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), ?)
output
376.15/291.51 WORST_CASE(Omega(n^1), ?) 378.16/292.03 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 378.16/292.03 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 378.16/292.03 378.16/292.03 378.16/292.03 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 378.16/292.03 378.16/292.03 (0) CpxTRS 378.16/292.03 (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 378.16/292.03 (2) CpxTRS 378.16/292.03 (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 378.16/292.03 (4) typed CpxTrs 378.16/292.03 (5) OrderProof [LOWER BOUND(ID), 0 ms] 378.16/292.03 (6) typed CpxTrs 378.16/292.03 (7) RewriteLemmaProof [LOWER BOUND(ID), 641 ms] 378.16/292.03 (8) BEST 378.16/292.03 (9) proven lower bound 378.16/292.03 (10) LowerBoundPropagationProof [FINISHED, 0 ms] 378.16/292.03 (11) BOUNDS(n^1, INF) 378.16/292.03 (12) typed CpxTrs 378.16/292.03 (13) RewriteLemmaProof [LOWER BOUND(ID), 286 ms] 378.16/292.03 (14) BOUNDS(1, INF) 378.16/292.03 378.16/292.03 378.16/292.03 ---------------------------------------- 378.16/292.03 378.16/292.03 (0) 378.16/292.03 Obligation: 378.16/292.03 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 378.16/292.03 378.16/292.03 378.16/292.03 The TRS R consists of the following rules: 378.16/292.03 378.16/292.03 not(and(x, y)) -> or(not(x), not(y)) 378.16/292.03 not(or(x, y)) -> and(not(x), not(y)) 378.16/292.03 and(x, or(y, z)) -> or(and(x, y), and(x, z)) 378.16/292.03 378.16/292.03 S is empty. 378.16/292.03 Rewrite Strategy: FULL 378.16/292.03 ---------------------------------------- 378.16/292.03 378.16/292.03 (1) RenamingProof (BOTH BOUNDS(ID, ID)) 378.16/292.03 Renamed function symbols to avoid clashes with predefined symbol. 378.16/292.03 ---------------------------------------- 378.16/292.03 378.16/292.03 (2) 378.16/292.03 Obligation: 378.16/292.03 The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). 378.16/292.03 378.16/292.03 378.16/292.03 The TRS R consists of the following rules: 378.16/292.03 378.16/292.03 not(and(x, y)) -> or(not(x), not(y)) 378.16/292.03 not(or(x, y)) -> and(not(x), not(y)) 378.16/292.03 and(x, or(y, z)) -> or(and(x, y), and(x, z)) 378.16/292.03 378.16/292.03 S is empty. 378.16/292.03 Rewrite Strategy: FULL 378.16/292.03 ---------------------------------------- 378.16/292.03 378.16/292.03 (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) 378.16/292.03 Infered types. 378.16/292.03 ---------------------------------------- 378.16/292.03 378.16/292.03 (4) 378.16/292.03 Obligation: 378.16/292.03 TRS: 378.16/292.03 Rules: 378.16/292.03 not(and(x, y)) -> or(not(x), not(y)) 378.16/292.03 not(or(x, y)) -> and(not(x), not(y)) 378.16/292.03 and(x, or(y, z)) -> or(and(x, y), and(x, z)) 378.16/292.03 378.16/292.03 Types: 378.16/292.03 not :: or -> or 378.16/292.03 and :: or -> or -> or 378.16/292.03 or :: or -> or -> or 378.16/292.03 hole_or1_0 :: or 378.16/292.03 gen_or2_0 :: Nat -> or 378.16/292.03 378.16/292.03 ---------------------------------------- 378.16/292.03 378.16/292.03 (5) OrderProof (LOWER BOUND(ID)) 378.16/292.03 Heuristically decided to analyse the following defined symbols: 378.16/292.03 not, and 378.16/292.03 378.16/292.03 They will be analysed ascendingly in the following order: 378.16/292.03 and < not 378.16/292.03 378.16/292.03 ---------------------------------------- 378.16/292.03 378.16/292.03 (6) 378.16/292.03 Obligation: 378.16/292.03 TRS: 378.16/292.03 Rules: 378.16/292.03 not(and(x, y)) -> or(not(x), not(y)) 378.16/292.03 not(or(x, y)) -> and(not(x), not(y)) 378.16/292.03 and(x, or(y, z)) -> or(and(x, y), and(x, z)) 378.16/292.03 378.16/292.03 Types: 378.16/292.03 not :: or -> or
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