details

property	value
status	complete
benchmark	ex5.6.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n137.star.cs.uiowa.edu
space	Transformed_outermost_08

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.2401330471 seconds
cpu usage	3.550604888
max memory	2.20614656E8

stage attributes

key	value
output-size	6171
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given CSR could be proven: (0) CSR (1) CSRRRRProof [EQUIVALENT, 54 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 0 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 0 ms] (6) CSR (7) CSRRRRProof [EQUIVALENT, 0 ms] (8) CSR (9) CSDependencyPairsProof [EQUIVALENT, 0 ms] (10) QCSDP (11) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (12) TRUE ---------------------------------------- (0) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: f_1(x, x) -> f_1(i_0(x), g_1(g_1(x))) f_1(x, i_0(g_1(x))) -> a_0 f_1(x, y) -> x f_1(x, i_0(x)) -> f_1(x, x) g_1(x) -> i_0(x) The replacement map contains the following entries: f_1: empty set i_0: {1} g_1: empty set a_0: empty set ---------------------------------------- (1) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: f_1(x, x) -> f_1(i_0(x), g_1(g_1(x))) f_1(x, i_0(g_1(x))) -> a_0 f_1(x, y) -> x f_1(x, i_0(x)) -> f_1(x, x) g_1(x) -> i_0(x) The replacement map contains the following entries: f_1: empty set i_0: {1} g_1: empty set a_0: empty set Used ordering: Polynomial interpretation [POLO]: POL(a_0) = 1 POL(f_1(x_1, x_2)) = 1 + x_1 + x_2 POL(g_1(x_1)) = x_1 POL(i_0(x_1)) = x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: f_1(x, y) -> x ---------------------------------------- (2) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: f_1(x, x) -> f_1(i_0(x), g_1(g_1(x))) f_1(x, i_0(g_1(x))) -> a_0 f_1(x, i_0(x)) -> f_1(x, x) g_1(x) -> i_0(x) The replacement map contains the following entries: f_1: empty set i_0: {1} g_1: empty set a_0: empty set ---------------------------------------- popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Context Sensitive