details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.59195113182 seconds
cpu usage	3.473313696
max memory	2.19168768E8

stage attributes

key	value
output-size	2220
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Quasi decreasingness of the given CTRS could be proven: (0) CTRS (1) CTRSToQTRSProof [SOUND, 0 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 38 ms] (4) QTRS (5) RisEmptyProof [EQUIVALENT, 0 ms] (6) YES ---------------------------------------- (0) Obligation: Conditional term rewrite system: The TRS R consists of the following rules: s(a) -> t s(b) -> t a -> c b -> c g(x, x) -> h(x, x) The conditional TRS C consists of the following conditional rules: f(x) -> A <= s(x) -> t f(x) -> B <= s(x) -> t ---------------------------------------- (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: f(x) -> U1(s(x)) U1(t) -> A U1(t) -> B s(a) -> t s(b) -> t a -> c b -> c g(x, x) -> h(x, x) Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Knuth-Bendix order [KBO] with precedence:f_1 > U1_1 > s_1 > g_2 > t > h_2 > b > a > c > B > A and weight map: t=2 A=3 B=3 a=1 b=1 c=1 f_1=2 U1_1=1 s_1=1 g_2=0 h_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: f(x) -> U1(s(x)) U1(t) -> A U1(t) -> B s(a) -> t s(b) -> t a -> c b -> c g(x, x) -> h(x, x) ---------------------------------------- (4) popout

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

job log

popout

actions

all output return to TRS Condi 20667