details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.59827899933 seconds
cpu usage	3.49534133
max memory	2.27774464E8

stage attributes

key	value
output-size	2413
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 Quasi decreasingness of the given CTRS could be proven: (0) CTRS (1) CTRSToQTRSProof [SOUND, 0 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 42 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 0 ms] (6) QTRS (7) RisEmptyProof [EQUIVALENT, 0 ms] (8) YES ---------------------------------------- (0) Obligation: Conditional term rewrite system: The TRS R is empty. The conditional TRS C consists of the following conditional rules: f(x) -> b <= g(x, x) -> a ---------------------------------------- (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(g(x, x)) U1(a) -> b Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(U1(x_1)) = 1 + x_1 POL(a) = 2 POL(b) = 2 POL(f(x_1)) = 1 + 2*x_1 POL(g(x_1, x_2)) = x_1 + x_2 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: U1(a) -> b ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(x) -> U1(g(x, x)) Q is empty. ---------------------------------------- (5) QTRSRRRProof (EQUIVALENT) Used ordering: f/1(YES) U1/1)YES( g/2(YES,YES) Quasi precedence: f_1 > g_2 Status: f_1: multiset status g_2: multiset status With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: f(x) -> U1(g(x, x)) popout

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

job log

popout

actions

all output return to TRS Condi 20667