details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.07418 seconds
cpu usage	5.01573
user time	4.81526
system time	0.200475
max virtual memory	5.6403628E7
max residence set size	422780.0

stage attributes

key	value
starexec-result	YES

output

4.64/2.01 YES 4.64/2.04 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 4.64/2.04 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 4.64/2.04 4.64/2.04 4.64/2.04 Termination of the given RelTRS could be proven: 4.64/2.04 4.64/2.04 (0) RelTRS 4.64/2.04 (1) RelTRS Reverse [EQUIVALENT, 0 ms] 4.64/2.04 (2) RelTRS 4.64/2.04 (3) FlatCCProof [EQUIVALENT, 0 ms] 4.64/2.04 (4) RelTRS 4.64/2.04 (5) RootLabelingProof [EQUIVALENT, 0 ms] 4.64/2.04 (6) RelTRS 4.64/2.04 (7) RelTRSRRRProof [EQUIVALENT, 37 ms] 4.64/2.04 (8) RelTRS 4.64/2.04 (9) RIsEmptyProof [EQUIVALENT, 2 ms] 4.64/2.04 (10) YES 4.64/2.04 4.64/2.04 4.64/2.04 ---------------------------------------- 4.64/2.04 4.64/2.04 (0) 4.64/2.04 Obligation: 4.64/2.04 Relative term rewrite system: 4.64/2.04 The relative TRS consists of the following R rules: 4.64/2.04 4.64/2.04 b(b(b(x1))) -> x1 4.64/2.04 c(c(c(x1))) -> a(a(x1)) 4.64/2.04 4.64/2.04 The relative TRS consists of the following S rules: 4.64/2.04 4.64/2.04 a(x1) -> a(c(b(x1))) 4.64/2.04 4.64/2.04 4.64/2.04 ---------------------------------------- 4.64/2.04 4.64/2.04 (1) RelTRS Reverse (EQUIVALENT) 4.64/2.04 We have reversed the following relative TRS [REVERSE]: 4.64/2.04 The set of rules R is 4.64/2.04 b(b(b(x1))) -> x1 4.64/2.04 c(c(c(x1))) -> a(a(x1)) 4.64/2.04 4.64/2.04 The set of rules S is 4.64/2.04 a(x1) -> a(c(b(x1))) 4.64/2.04 4.64/2.04 We have obtained the following relative TRS: 4.64/2.04 The set of rules R is 4.64/2.04 b(b(b(x1))) -> x1 4.64/2.04 c(c(c(x1))) -> a(a(x1)) 4.64/2.04 4.64/2.04 The set of rules S is 4.64/2.04 a(x1) -> b(c(a(x1))) 4.64/2.04 4.64/2.04 4.64/2.04 ---------------------------------------- 4.64/2.04 4.64/2.04 (2) 4.64/2.04 Obligation: 4.64/2.04 Relative term rewrite system: 4.64/2.04 The relative TRS consists of the following R rules: 4.64/2.04 4.64/2.04 b(b(b(x1))) -> x1 4.64/2.04 c(c(c(x1))) -> a(a(x1)) 4.64/2.04 4.64/2.04 The relative TRS consists of the following S rules: 4.64/2.04 4.64/2.04 a(x1) -> b(c(a(x1))) 4.64/2.04 4.64/2.04 4.64/2.04 ---------------------------------------- 4.64/2.04 4.64/2.04 (3) FlatCCProof (EQUIVALENT) 4.64/2.04 We used flat context closure [ROOTLAB] 4.64/2.04 4.64/2.04 ---------------------------------------- 4.64/2.04 4.64/2.04 (4) 4.64/2.04 Obligation: 4.64/2.04 Relative term rewrite system: 4.64/2.04 The relative TRS consists of the following R rules: 4.64/2.04 4.64/2.04 b(b(b(b(x1)))) -> b(x1) 4.64/2.04 c(b(b(b(x1)))) -> c(x1) 4.64/2.04 a(b(b(b(x1)))) -> a(x1) 4.64/2.04 b(c(c(c(x1)))) -> b(a(a(x1))) 4.64/2.04 c(c(c(c(x1)))) -> c(a(a(x1))) 4.64/2.04 a(c(c(c(x1)))) -> a(a(a(x1))) 4.64/2.04 4.64/2.04 The relative TRS consists of the following S rules: 4.64/2.04 4.64/2.04 b(a(x1)) -> b(b(c(a(x1)))) 4.64/2.04 c(a(x1)) -> c(b(c(a(x1)))) 4.64/2.04 a(a(x1)) -> a(b(c(a(x1)))) 4.64/2.04 4.64/2.04 4.64/2.04 ---------------------------------------- 4.64/2.04 4.64/2.04 (5) RootLabelingProof (EQUIVALENT) 4.64/2.04 We used plain root labeling [ROOTLAB] with the following heuristic: 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