details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	10.4373 seconds
cpu usage	36.9139
user time	34.9537
system time	1.96029
max virtual memory	6.0650732E7
max residence set size	4391216.0

stage attributes

key	value
starexec-result	YES

output

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) FlatCCProof [EQUIVALENT, 0 ms] (2) RelTRS (3) RootLabelingProof [EQUIVALENT, 14 ms] (4) RelTRS (5) RelTRSRRRProof [EQUIVALENT, 151 ms] (6) RelTRS (7) RelTRSRRRProof [EQUIVALENT, 64 ms] (8) RelTRS (9) RelTRSRRRProof [EQUIVALENT, 60 ms] (10) RelTRS (11) RelTRSRRRProof [EQUIVALENT, 20 ms] (12) RelTRS (13) RelTRSRRRProof [EQUIVALENT, 14 ms] (14) RelTRS (15) RelTRSRRRProof [EQUIVALENT, 10 ms] (16) RelTRS (17) RelTRSRRRProof [EQUIVALENT, 11 ms] (18) RelTRS (19) RIsEmptyProof [EQUIVALENT, 0 ms] (20) YES ---------------------------------------- (0) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: b(p(b(x1))) -> b(q(b(x1))) The relative TRS consists of the following S rules: 1(p(0(1(0(x1))))) -> p(x1) q(x1) -> 0(q(0(x1))) q(x1) -> 1(q(1(x1))) q(x1) -> 0(p(0(x1))) q(x1) -> 1(p(1(x1))) ---------------------------------------- (1) FlatCCProof (EQUIVALENT) We used flat context closure [ROOTLAB] ---------------------------------------- (2) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: b(p(b(x1))) -> b(q(b(x1))) The relative TRS consists of the following S rules: b(1(p(0(1(0(x1)))))) -> b(p(x1)) p(1(p(0(1(0(x1)))))) -> p(p(x1)) q(1(p(0(1(0(x1)))))) -> q(p(x1)) 1(1(p(0(1(0(x1)))))) -> 1(p(x1)) 0(1(p(0(1(0(x1)))))) -> 0(p(x1)) b(q(x1)) -> b(0(q(0(x1)))) p(q(x1)) -> p(0(q(0(x1)))) q(q(x1)) -> q(0(q(0(x1)))) 1(q(x1)) -> 1(0(q(0(x1)))) 0(q(x1)) -> 0(0(q(0(x1)))) b(q(x1)) -> b(1(q(1(x1)))) p(q(x1)) -> p(1(q(1(x1)))) q(q(x1)) -> q(1(q(1(x1)))) 1(q(x1)) -> 1(1(q(1(x1)))) 0(q(x1)) -> 0(1(q(1(x1)))) b(q(x1)) -> b(0(p(0(x1)))) p(q(x1)) -> p(0(p(0(x1)))) q(q(x1)) -> q(0(p(0(x1)))) 1(q(x1)) -> 1(0(p(0(x1)))) 0(q(x1)) -> 0(0(p(0(x1)))) b(q(x1)) -> b(1(p(1(x1)))) p(q(x1)) -> p(1(p(1(x1)))) q(q(x1)) -> q(1(p(1(x1)))) 1(q(x1)) -> 1(1(p(1(x1)))) 0(q(x1)) -> 0(1(p(1(x1)))) ---------------------------------------- (3) RootLabelingProof (EQUIVALENT) We used plain root labeling [ROOTLAB] with the following heuristic: LabelAll: All function symbols get labeled ---------------------------------------- popout

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

job log

popout

actions

all output return to SRS Relative