Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904965
details
property
value
status
complete
benchmark
2.44.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n041.star.cs.uiowa.edu
space
SK90
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
4.38798618317 seconds
cpu usage
14.543543406
max memory
2.904031232E9
stage attributes
key
value
output-size
12912
starexec-result
WORST_CASE(Omega(n^1), O(n^1))
output
/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), O(n^1)) proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). (0) CpxTRS (1) CpxTrsToCdtProof [UPPER BOUND(ID), 0 ms] (2) CdtProblem (3) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms] (4) CdtProblem (5) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CdtProblem (7) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 0 ms] (8) CdtProblem (9) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 69 ms] (10) CdtProblem (11) CdtKnowledgeProof [FINISHED, 0 ms] (12) BOUNDS(1, 1) (13) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (14) CpxTRS (15) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (16) typed CpxTrs (17) OrderProof [LOWER BOUND(ID), 0 ms] (18) typed CpxTrs (19) RewriteLemmaProof [LOWER BOUND(ID), 414 ms] (20) proven lower bound (21) LowerBoundPropagationProof [FINISHED, 0 ms] (22) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: del(.(x, .(y, z))) -> f(=(x, y), x, y, z) f(true, x, y, z) -> del(.(y, z)) f(false, x, y, z) -> .(x, del(.(y, z))) =(nil, nil) -> true =(.(x, y), nil) -> false =(nil, .(y, z)) -> false =(.(x, y), .(u, v)) -> and(=(x, u), =(y, v)) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (1) CpxTrsToCdtProof (UPPER BOUND(ID)) Converted Cpx (relative) TRS to CDT ---------------------------------------- (2) Obligation: Complexity Dependency Tuples Problem Rules: del(.(z0, .(z1, z2))) -> f(=(z0, z1), z0, z1, z2) f(true, z0, z1, z2) -> del(.(z1, z2)) f(false, z0, z1, z2) -> .(z0, del(.(z1, z2))) =(nil, nil) -> true =(.(z0, z1), nil) -> false =(nil, .(z0, z1)) -> false =(.(z0, z1), .(u, v)) -> and(=(z0, u), =(z1, v)) Tuples: DEL(.(z0, .(z1, z2))) -> c(F(=(z0, z1), z0, z1, z2), ='(z0, z1)) F(true, z0, z1, z2) -> c1(DEL(.(z1, z2))) F(false, z0, z1, z2) -> c2(DEL(.(z1, z2))) ='(nil, nil) -> c3 ='(.(z0, z1), nil) -> c4 ='(nil, .(z0, z1)) -> c5 ='(.(z0, z1), .(u, v)) -> c6(='(z0, u), ='(z1, v)) S tuples: DEL(.(z0, .(z1, z2))) -> c(F(=(z0, z1), z0, z1, z2), ='(z0, z1)) F(true, z0, z1, z2) -> c1(DEL(.(z1, z2))) F(false, z0, z1, z2) -> c2(DEL(.(z1, z2))) ='(nil, nil) -> c3 ='(.(z0, z1), nil) -> c4 ='(nil, .(z0, z1)) -> c5 ='(.(z0, z1), .(u, v)) -> c6(='(z0, u), ='(z1, v)) K tuples:none Defined Rule Symbols: del_1, f_4, =_2 Defined Pair Symbols: DEL_1, F_4, ='_2 Compound Symbols: c_2, c1_1, c2_1, c3, c4, c5, c6_2 ----------------------------------------
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807