details

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

run statistics

property	value
solver	AProVE23
configuration	standard
runtime (wallclock)	1.77225589752 seconds
cpu usage	4.478443023
max memory	2.67264E8

stage attributes

key	value
output-size	2454
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: 363435ff5b19173ec8a83b45cfdec073678dabcc jan-christoph 20230815 unpublished Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 76 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 0 ms] (4) QTRS (5) RisEmptyProof [EQUIVALENT, 0 ms] (6) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: +(x, 0) -> x +(x, s(y)) -> s(+(x, y)) +(0, y) -> y +(s(x), y) -> s(+(x, y)) +(x, +(y, z)) -> +(+(x, y), z) f(g(f(x))) -> f(h(s(0), x)) f(g(h(x, y))) -> f(h(s(x), y)) f(h(x, h(y, z))) -> f(h(+(x, y), z)) Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(+(x_1, x_2)) = 1 + x_1 + 2*x_2 POL(0) = 0 POL(f(x_1)) = 2 + x_1 POL(g(x_1)) = 1 + 2*x_1 POL(h(x_1, x_2)) = 2 + x_1 + 2*x_2 POL(s(x_1)) = x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: +(x, 0) -> x +(0, y) -> y +(x, +(y, z)) -> +(+(x, y), z) f(g(f(x))) -> f(h(s(0), x)) f(g(h(x, y))) -> f(h(s(x), y)) f(h(x, h(y, z))) -> f(h(+(x, y), z)) ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: +(x, s(y)) -> s(+(x, y)) +(s(x), y) -> s(+(x, y)) Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Knuth-Bendix order [KBO] with precedence:+_2 > s_1 and weight map: s_1=1 +_2=0 The variable weight is 1With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: +(x, s(y)) -> s(+(x, y)) +(s(x), y) -> s(+(x, y)) ---------------------------------------- (4) Obligation: Q restricted rewrite system: popout

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

job log

popout

actions

all output return to TRS Standard