details

property	value
status	complete
benchmark	#3.35_rand.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n023.star.cs.uiowa.edu
space	INVY_15

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.58468103409 seconds
cpu usage	6.538495003
max memory	6.86006272E8

stage attributes

key	value
output-size	3416
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given RelTRS could be proven: (0) RelTRS (1) RelTRSRRRProof [EQUIVALENT, 34 ms] (2) RelTRS (3) RelTRSRRRProof [EQUIVALENT, 5 ms] (4) RelTRS (5) RelTRSRRRProof [EQUIVALENT, 12 ms] (6) RelTRS (7) RIsEmptyProof [EQUIVALENT, 0 ms] (8) YES ---------------------------------------- (0) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: g(s(x)) -> f(x) f(0) -> s(0) f(s(x)) -> s(s(g(x))) g(0) -> 0 The relative TRS consists of the following S rules: rand(x) -> x rand(x) -> rand(s(x)) ---------------------------------------- (1) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Polynomial interpretation [POLO]: POL(0) = 0 POL(f(x_1)) = x_1 POL(g(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: rand(x) -> x ---------------------------------------- (2) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: g(s(x)) -> f(x) f(0) -> s(0) f(s(x)) -> s(s(g(x))) g(0) -> 0 The relative TRS consists of the following S rules: rand(x) -> rand(s(x)) ---------------------------------------- (3) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Polynomial interpretation [POLO]: POL(0) = 0 POL(f(x_1)) = 1 + x_1 POL(g(x_1)) = 1 + x_1 POL(rand(x_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: f(0) -> s(0) g(0) -> 0 Rules from S: none popout

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

job log

popout

actions

all output return to TRS Relative