details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	5.48099017143 seconds
cpu usage	5.468498221
max memory	4.79412224E8

stage attributes

key	value
output-size	2412
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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Quasi decreasingness of the given CTRS could be proven: (0) CTRS (1) CTRSToQTRSProof [SOUND, 0 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 29 ms] (4) QTRS (5) RisEmptyProof [EQUIVALENT, 0 ms] (6) YES ---------------------------------------- (0) Obligation: Conditional term rewrite system: The TRS R consists of the following rules: even(0) -> true odd(0) -> false The conditional TRS C consists of the following conditional rules: even(s(x)) -> false <= odd(x) -> false even(s(x)) -> true <= odd(x) -> true odd(s(x)) -> false <= even(x) -> false odd(s(x)) -> true <= even(x) -> true ---------------------------------------- (1) CTRSToQTRSProof (SOUND) The conditional rules have been transormed into unconditional rules according to [CTRS,AAECCNOC]. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: even(s(x)) -> U1(odd(x)) U1(true) -> true U1(false) -> false odd(s(x)) -> U2(even(x)) U2(true) -> true U2(false) -> false even(0) -> true odd(0) -> false Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Knuth-Bendix order [KBO] with precedence:U2_1 > 0 > odd_1 > false > even_1 > true > s_1 > U1_1 and weight map: true=3 false=3 0=1 even_1=2 s_1=1 U1_1=1 odd_1=2 U2_1=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: even(s(x)) -> U1(odd(x)) U1(true) -> true U1(false) -> false odd(s(x)) -> U2(even(x)) U2(true) -> true U2(false) -> false even(0) -> true odd(0) -> false ---------------------------------------- (4) Obligation: Q restricted rewrite system: R is empty. Q is empty. popout

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

job log

popout

actions

all output return to TRS Conditional