details

property	value
status	complete
benchmark	#3.24_rand.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	INVY_15

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.40528488159 seconds
cpu usage	6.644256211
max memory	8.029184E8

stage attributes

key	value
output-size	5309
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) RelTRS Reverse [SOUND, 0 ms] (2) RelTRS (3) RelTRSRRRProof [EQUIVALENT, 7 ms] (4) RelTRS (5) RelTRSRRRProof [EQUIVALENT, 52 ms] (6) RelTRS (7) RelTRSRRRProof [EQUIVALENT, 18 ms] (8) RelTRS (9) RelTRSRRRProof [EQUIVALENT, 4 ms] (10) RelTRS (11) RIsEmptyProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: f(0) -> s(0) f(s(0)) -> s(0) f(s(s(x))) -> f(f(s(x))) The relative TRS consists of the following S rules: rand(x) -> x rand(x) -> rand(s(x)) ---------------------------------------- (1) RelTRS Reverse (SOUND) We have reversed the following relative TRS [REVERSE]: The set of rules R is f(0) -> s(0) f(s(0)) -> s(0) f(s(s(x))) -> f(f(s(x))) The set of rules S is rand(x) -> x rand(x) -> rand(s(x)) We have obtained the following relative TRS: The set of rules R is 0'(f(x)) -> 0'(s(x)) 0'(s(f(x))) -> 0'(s(x)) s(s(f(x))) -> s(f(f(x))) The set of rules S is rand(x) -> x rand(x) -> s(rand(x)) ---------------------------------------- (2) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: 0'(f(x)) -> 0'(s(x)) 0'(s(f(x))) -> 0'(s(x)) s(s(f(x))) -> s(f(f(x))) The relative TRS consists of the following S rules: rand(x) -> x rand(x) -> s(rand(x)) ---------------------------------------- (3) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Polynomial interpretation [POLO]: POL(0'(x_1)) = x_1 POL(f(x_1)) = x_1 POL(rand(x_1)) = 1 + x_1 POL(s(x_1)) = x_1 With this ordering the following rules can be removed [MATRO] because they are oriented strictly: Rules from R: none Rules from S: popout

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

job log

popout

actions

all output return to TRS Relat 75837