details

property	value
status	complete
benchmark	rt3-4.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n022.star.cs.uiowa.edu
space	Relative_05

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	7.47174406052 seconds
cpu usage	23.378601542
max memory	2.702667776E9

stage attributes

key	value
output-size	124856
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) RelTRSRRRProof [EQUIVALENT, 932 ms] (6) RelTRS (7) RelTRSRRRProof [EQUIVALENT, 219 ms] (8) RelTRS (9) RelTRSRRRProof [EQUIVALENT, 154 ms] (10) RelTRS (11) RelTRSRRRProof [EQUIVALENT, 97 ms] (12) RelTRS (13) RelTRSRRRProof [EQUIVALENT, 69 ms] (14) RelTRS (15) RelTRSRRRProof [EQUIVALENT, 0 ms] (16) RelTRS (17) RelTRSRRRProof [EQUIVALENT, 9 ms] (18) RelTRS (19) RelTRSRRRProof [EQUIVALENT, 17 ms] (20) RelTRS (21) RelTRSRRRProof [EQUIVALENT, 0 ms] (22) RelTRS (23) RelTRSRRRProof [EQUIVALENT, 9 ms] (24) RelTRS (25) RelTRSRRRProof [EQUIVALENT, 0 ms] (26) RelTRS (27) RelTRSRRRProof [EQUIVALENT, 4 ms] (28) RelTRS (29) RelTRSRRRProof [EQUIVALENT, 6 ms] (30) RelTRS (31) RelTRSRRRProof [EQUIVALENT, 8 ms] (32) RelTRS (33) RelTRSRRRProof [EQUIVALENT, 0 ms] (34) RelTRS (35) RIsEmptyProof [EQUIVALENT, 0 ms] (36) YES ---------------------------------------- (0) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: f(a, g(y), z) -> f(b, g(y), g(y)) f(b, g(y), z) -> f(a, y, z) a -> b The relative TRS consists of the following S rules: f(x, y, z) -> f(x, y, g(z)) ---------------------------------------- (1) FlatCCProof (EQUIVALENT) We used flat context closure [ROOTLAB] ---------------------------------------- (2) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: f(a, g(y), z) -> f(b, g(y), g(y)) f(b, g(y), z) -> f(a, y, z) f(a, z1, z2) -> f(b, z1, z2) f(z0, a, z2) -> f(z0, b, z2) f(z0, z1, a) -> f(z0, z1, b) g(a) -> g(b) The relative TRS consists of the following S rules: f(x, y, z) -> f(x, y, g(z)) ---------------------------------------- (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 TRS Relative