Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381902273
details
property
value
status
complete
benchmark
ack_prolog.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n038.star.cs.uiowa.edu
space
CiME_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
293.17016983 seconds
cpu usage
1083.80028288
max memory
1.535059968E10
stage attributes
key
value
output-size
6104
starexec-result
WORST_CASE(Omega(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), ?) 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, INF). (0) CpxTRS (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxTRS (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (4) typed CpxTrs (5) OrderProof [LOWER BOUND(ID), 0 ms] (6) typed CpxTrs (7) RewriteLemmaProof [LOWER BOUND(ID), 713 ms] (8) BEST (9) proven lower bound (10) LowerBoundPropagationProof [FINISHED, 0 ms] (11) BOUNDS(n^1, INF) (12) typed CpxTrs ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: ack_in(0, n) -> ack_out(s(n)) ack_in(s(m), 0) -> u11(ack_in(m, s(0))) u11(ack_out(n)) -> ack_out(n) ack_in(s(m), s(n)) -> u21(ack_in(s(m), n), m) u21(ack_out(n), m) -> u22(ack_in(m, n)) u22(ack_out(n)) -> ack_out(n) S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) RenamingProof (BOTH BOUNDS(ID, ID)) Renamed function symbols to avoid clashes with predefined symbol. ---------------------------------------- (2) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: ack_in(0', n) -> ack_out(s(n)) ack_in(s(m), 0') -> u11(ack_in(m, s(0'))) u11(ack_out(n)) -> ack_out(n) ack_in(s(m), s(n)) -> u21(ack_in(s(m), n), m) u21(ack_out(n), m) -> u22(ack_in(m, n)) u22(ack_out(n)) -> ack_out(n) S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation: TRS: Rules: ack_in(0', n) -> ack_out(s(n)) ack_in(s(m), 0') -> u11(ack_in(m, s(0'))) u11(ack_out(n)) -> ack_out(n) ack_in(s(m), s(n)) -> u21(ack_in(s(m), n), m) u21(ack_out(n), m) -> u22(ack_in(m, n)) u22(ack_out(n)) -> ack_out(n) Types: ack_in :: 0':s -> 0':s -> ack_out 0' :: 0':s ack_out :: 0':s -> ack_out s :: 0':s -> 0':s u11 :: ack_out -> ack_out u21 :: ack_out -> 0':s -> ack_out u22 :: ack_out -> ack_out hole_ack_out1_0 :: ack_out hole_0':s2_0 :: 0':s gen_0':s3_0 :: Nat -> 0':s ---------------------------------------- (5) OrderProof (LOWER BOUND(ID))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127