details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	269.711956024 seconds
cpu usage	1074.74184284
max memory	1.5824384E10

stage attributes

key	value
output-size	228907
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/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, 0 ms] (4) RelTRS (5) FlatCCProof [EQUIVALENT, 0 ms] (6) RelTRS (7) RootLabelingProof [EQUIVALENT, 14 ms] (8) RelTRS (9) RelTRSRRRProof [EQUIVALENT, 118 ms] (10) RelTRS (11) RelTRSRRRProof [EQUIVALENT, 55 ms] (12) RelTRS (13) RelTRSRRRProof [EQUIVALENT, 19.7 s] (14) RelTRS (15) RelTRSRRRProof [EQUIVALENT, 13 ms] (16) RelTRS (17) RelTRSRRRProof [EQUIVALENT, 15 ms] (18) RelTRS (19) RelTRSSemanticLabellingPOLOProof [EQUIVALENT, 745 ms] (20) RelTRS (21) RelTRSSemanticLabellingPOLOProof [EQUIVALENT, 741 ms] (22) RelTRS (23) RelTRSRRRProof [EQUIVALENT, 1953 ms] (24) RelTRS (25) RelTRSRRRProof [EQUIVALENT, 9 ms] (26) RelTRS (27) RelTRSSemanticLabellingPOLOProof [EQUIVALENT, 626 ms] (28) RelTRS (29) RelTRSRRRProof [EQUIVALENT, 6 ms] (30) RelTRS (31) RelTRSRRRProof [EQUIVALENT, 5162 ms] (32) RelTRS (33) RelTRSRRRProof [EQUIVALENT, 1950 ms] (34) RelTRS (35) RelTRSRRRProof [EQUIVALENT, 1576 ms] (36) RelTRS (37) RelTRSRRRProof [EQUIVALENT, 998 ms] (38) RelTRS (39) RIsEmptyProof [EQUIVALENT, 0 ms] (40) YES ---------------------------------------- (0) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: a(b(a(b(a(x1))))) -> x1 The relative TRS consists of the following S rules: a(b(x1)) -> b(b(a(a(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: a(a(b(a(b(a(x1)))))) -> a(x1) b(a(b(a(b(a(x1)))))) -> b(x1) The relative TRS consists of the following S rules: a(a(b(x1))) -> a(b(b(a(a(x1))))) b(a(b(x1))) -> b(b(b(a(a(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