details

property	value
status	complete
benchmark	random-75.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n013.star.cs.uiowa.edu
space	Waldmann_19

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.32549 seconds
cpu usage	17.4771
user time	16.5693
system time	0.907844
max virtual memory	5.685782E7
max residence set size	1996380.0

stage attributes

key	value
starexec-result	YES

output

16.88/5.16 YES 17.22/5.22 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 17.22/5.22 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 17.22/5.22 17.22/5.22 17.22/5.22 Termination of the given RelTRS could be proven: 17.22/5.22 17.22/5.22 (0) RelTRS 17.22/5.22 (1) RelTRSRRRProof [EQUIVALENT, 872 ms] 17.22/5.22 (2) RelTRS 17.22/5.22 (3) RelTRSRRRProof [EQUIVALENT, 8 ms] 17.22/5.22 (4) RelTRS 17.22/5.22 (5) RIsEmptyProof [EQUIVALENT, 0 ms] 17.22/5.22 (6) YES 17.22/5.22 17.22/5.22 17.22/5.22 ---------------------------------------- 17.22/5.22 17.22/5.22 (0) 17.22/5.22 Obligation: 17.22/5.22 Relative term rewrite system: 17.22/5.22 The relative TRS consists of the following R rules: 17.22/5.22 17.22/5.22 c(b(a(x1))) -> a(b(b(x1))) 17.22/5.22 b(a(c(x1))) -> b(b(b(x1))) 17.22/5.22 a(c(c(x1))) -> a(b(b(x1))) 17.22/5.22 17.22/5.22 The relative TRS consists of the following S rules: 17.22/5.22 17.22/5.22 c(c(a(x1))) -> c(a(c(x1))) 17.22/5.22 a(a(a(x1))) -> a(a(b(x1))) 17.22/5.22 a(b(a(x1))) -> b(b(a(x1))) 17.22/5.22 b(b(b(x1))) -> a(b(c(x1))) 17.22/5.22 17.22/5.22 17.22/5.22 ---------------------------------------- 17.22/5.22 17.22/5.22 (1) RelTRSRRRProof (EQUIVALENT) 17.22/5.22 We used the following monotonic ordering for rule removal: 17.22/5.22 Matrix interpretation [MATRO] to (N^2, +, *, >=, >) : 17.22/5.22 17.22/5.22 <<< 17.22/5.22 POL(c(x_1)) = [[0], [2]] + [[2, 0], [0, 2]] * x_1 17.22/5.22 >>> 17.22/5.22 17.22/5.22 <<< 17.22/5.22 POL(b(x_1)) = [[1], [0]] + [[2, 0], [0, 0]] * x_1 17.22/5.22 >>> 17.22/5.22 17.22/5.22 <<< 17.22/5.22 POL(a(x_1)) = [[2], [0]] + [[2, 1], [0, 0]] * x_1 17.22/5.22 >>> 17.22/5.22 17.22/5.22 With this ordering the following rules can be removed [MATRO] because they are oriented strictly: 17.22/5.22 Rules from R: 17.22/5.22 17.22/5.22 c(b(a(x1))) -> a(b(b(x1))) 17.22/5.22 b(a(c(x1))) -> b(b(b(x1))) 17.22/5.22 Rules from S: 17.22/5.22 17.22/5.22 a(a(a(x1))) -> a(a(b(x1))) 17.22/5.22 a(b(a(x1))) -> b(b(a(x1))) 17.22/5.22 b(b(b(x1))) -> a(b(c(x1))) 17.22/5.22 17.22/5.22 17.22/5.22 17.22/5.22 17.22/5.22 ---------------------------------------- 17.22/5.22 17.22/5.22 (2) 17.22/5.22 Obligation: 17.22/5.22 Relative term rewrite system: 17.22/5.22 The relative TRS consists of the following R rules: 17.22/5.22 17.22/5.22 a(c(c(x1))) -> a(b(b(x1))) 17.22/5.22 17.22/5.22 The relative TRS consists of the following S rules: 17.22/5.22 17.22/5.22 c(c(a(x1))) -> c(a(c(x1))) 17.22/5.22 17.22/5.22 17.22/5.22 ---------------------------------------- 17.22/5.22 17.22/5.22 (3) RelTRSRRRProof (EQUIVALENT) 17.22/5.22 We used the following monotonic ordering for rule removal: 17.22/5.22 Polynomial interpretation [POLO]: 17.22/5.22 17.22/5.22 POL(a(x_1)) = x_1 17.22/5.22 POL(b(x_1)) = x_1 17.22/5.22 POL(c(x_1)) = 1 + x_1 17.22/5.22 With this ordering the following rules can be removed [MATRO] because they are oriented strictly: 17.22/5.22 Rules from R: 17.22/5.22 17.22/5.22 a(c(c(x1))) -> a(b(b(x1))) 17.22/5.22 Rules from S: 17.22/5.22 none 17.22/5.22 17.22/5.22 17.22/5.22 17.22/5.22 popout

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

job log

popout

actions

all output return to SRS_Relative 2019-03-29 08.12