details

property	value
status	complete
benchmark	rt2-7.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n054.star.cs.uiowa.edu
space	Relative_05

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.29969000816 seconds
cpu usage	6.22222362
max memory	5.8253312E8

stage attributes

key	value
output-size	3652
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination of the given RelTRS could be proven: (0) RelTRS (1) RootLabelingProof [EQUIVALENT, 0 ms] (2) RelTRS (3) RelTRSRRRProof [EQUIVALENT, 87 ms] (4) RelTRS (5) RelTRSRRRProof [EQUIVALENT, 4 ms] (6) RelTRS (7) RIsEmptyProof [EQUIVALENT, 0 ms] (8) YES ---------------------------------------- (0) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: f(g(f(x))) -> f(g(g(g(f(x))))) The relative TRS consists of the following S rules: g(x) -> g(g(x)) ---------------------------------------- (1) RootLabelingProof (EQUIVALENT) We used plain root labeling [ROOTLAB] with the following heuristic: LabelAll: All function symbols get labeled ---------------------------------------- (2) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: f_{g_1}(g_{f_1}(f_{f_1}(x))) -> f_{g_1}(g_{g_1}(g_{g_1}(g_{f_1}(f_{f_1}(x))))) f_{g_1}(g_{f_1}(f_{g_1}(x))) -> f_{g_1}(g_{g_1}(g_{g_1}(g_{f_1}(f_{g_1}(x))))) The relative TRS consists of the following S rules: g_{f_1}(x) -> g_{g_1}(g_{f_1}(x)) g_{g_1}(x) -> g_{g_1}(g_{g_1}(x)) ---------------------------------------- (3) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Matrix interpretation [MATRO] to (N^2, +, *, >=, >) : <<< POL(f_{g_1}(x_1)) = [[0], [0]] + [[2, 2], [2, 2]] * x_1 >>> <<< POL(g_{f_1}(x_1)) = [[0], [0]] + [[2, 2], [2, 2]] * x_1 >>> <<< POL(f_{f_1}(x_1)) = [[2], [2]] + [[1, 0], [0, 0]] * x_1 >>> <<< POL(g_{g_1}(x_1)) = [[0], [0]] + [[1, 0], [0, 0]] * x_1 >>> With this ordering the following rules can be removed [MATRO] because they are oriented strictly: Rules from R: f_{g_1}(g_{f_1}(f_{f_1}(x))) -> f_{g_1}(g_{g_1}(g_{g_1}(g_{f_1}(f_{f_1}(x))))) Rules from S: none ---------------------------------------- (4) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: popout

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

job log

popout

actions

all output return to TRS Relat 75837