Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381902378
details
property
value
status
complete
benchmark
23.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n035.star.cs.uiowa.edu
space
Various_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
9.81064605713 seconds
cpu usage
22.878793791
max memory
3.636359168E9
stage attributes
key
value
output-size
8611
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 (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). (0) CpxTRS (1) RcToIrcProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxTRS (3) CpxTrsToCdtProof [UPPER BOUND(ID), 5 ms] (4) CdtProblem (5) CdtLeafRemovalProof [ComplexityIfPolyImplication, 0 ms] (6) CdtProblem (7) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 0 ms] (8) CdtProblem (9) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 35 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), 817 ms] (20) proven lower bound (21) LowerBoundPropagationProof [FINISHED, 0 ms] (22) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: g(0, f(x, x)) -> x g(x, s(y)) -> g(f(x, y), 0) g(s(x), y) -> g(f(x, y), 0) g(f(x, y), 0) -> f(g(x, 0), g(y, 0)) S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) RcToIrcProof (BOTH BOUNDS(ID, ID)) Converted rc-obligation to irc-obligation. As the TRS does not nest defined symbols, we have rc = irc. ---------------------------------------- (2) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, n^1). The TRS R consists of the following rules: g(0, f(x, x)) -> x g(x, s(y)) -> g(f(x, y), 0) g(s(x), y) -> g(f(x, y), 0) g(f(x, y), 0) -> f(g(x, 0), g(y, 0)) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (3) CpxTrsToCdtProof (UPPER BOUND(ID)) Converted Cpx (relative) TRS to CDT ---------------------------------------- (4) Obligation: Complexity Dependency Tuples Problem Rules: g(0, f(z0, z0)) -> z0 g(z0, s(z1)) -> g(f(z0, z1), 0) g(s(z0), z1) -> g(f(z0, z1), 0) g(f(z0, z1), 0) -> f(g(z0, 0), g(z1, 0)) Tuples: G(0, f(z0, z0)) -> c G(z0, s(z1)) -> c1(G(f(z0, z1), 0)) G(s(z0), z1) -> c2(G(f(z0, z1), 0)) G(f(z0, z1), 0) -> c3(G(z0, 0), G(z1, 0)) S tuples: G(0, f(z0, z0)) -> c G(z0, s(z1)) -> c1(G(f(z0, z1), 0)) G(s(z0), z1) -> c2(G(f(z0, z1), 0))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127