details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	19.1588859558 seconds
cpu usage	72.552240896
max memory	2.697207808E9

stage attributes

key	value
output-size	250836
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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) FlatCCProof [EQUIVALENT, 0 ms] (2) QTRS (3) RootLabelingProof [EQUIVALENT, 7 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 1081 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 307 ms] (8) QTRS (9) QTRSRRRProof [EQUIVALENT, 145 ms] (10) QTRS (11) QTRSRRRProof [EQUIVALENT, 167 ms] (12) QTRS (13) QTRSRRRProof [EQUIVALENT, 119 ms] (14) QTRS (15) QTRSRRRProof [EQUIVALENT, 102 ms] (16) QTRS (17) QTRSRRRProof [EQUIVALENT, 85 ms] (18) QTRS (19) QTRSRRRProof [EQUIVALENT, 68 ms] (20) QTRS (21) QTRSRRRProof [EQUIVALENT, 34 ms] (22) QTRS (23) QTRSRRRProof [EQUIVALENT, 25 ms] (24) QTRS (25) QTRSRRRProof [EQUIVALENT, 19 ms] (26) QTRS (27) QTRSRRRProof [EQUIVALENT, 2 ms] (28) QTRS (29) QTRSRRRProof [EQUIVALENT, 13 ms] (30) QTRS (31) QTRSRRRProof [EQUIVALENT, 2 ms] (32) QTRS (33) QTRSRRRProof [EQUIVALENT, 2 ms] (34) QTRS (35) RisEmptyProof [EQUIVALENT, 0 ms] (36) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 0(4(x1)) -> 0(1(4(2(3(3(x1)))))) 0(4(x1)) -> 0(2(1(4(3(4(x1)))))) 0(0(4(x1))) -> 1(1(5(2(3(4(x1)))))) 0(1(1(x1))) -> 0(2(2(1(1(1(x1)))))) 0(1(3(x1))) -> 0(2(4(3(4(4(x1)))))) 0(2(4(x1))) -> 1(5(4(3(4(4(x1)))))) 0(4(0(x1))) -> 0(1(2(1(0(3(x1)))))) 1(2(3(x1))) -> 5(1(4(1(4(4(x1)))))) 1(3(3(x1))) -> 0(2(1(1(0(5(x1)))))) 1(3(3(x1))) -> 5(4(0(3(2(3(x1)))))) 1(3(5(x1))) -> 1(1(4(3(3(2(x1)))))) 2(0(0(x1))) -> 2(4(3(4(4(4(x1)))))) 2(0(1(x1))) -> 2(1(5(1(0(1(x1)))))) 2(0(1(x1))) -> 2(4(3(5(2(3(x1)))))) 2(0(4(x1))) -> 2(0(2(1(4(3(x1)))))) 2(0(4(x1))) -> 2(4(1(4(3(1(x1)))))) 3(0(1(x1))) -> 3(1(4(3(4(1(x1)))))) 3(0(5(x1))) -> 3(1(0(2(3(2(x1)))))) 4(0(0(x1))) -> 2(5(2(1(1(1(x1)))))) 4(0(5(x1))) -> 4(1(4(5(1(4(x1)))))) 4(0(5(x1))) -> 4(2(1(4(3(5(x1)))))) 5(0(2(x1))) -> 1(5(2(1(0(2(x1)))))) 5(0(4(x1))) -> 1(0(3(2(4(4(x1)))))) 5(0(4(x1))) -> 1(5(1(0(3(4(x1)))))) Q is empty. ---------------------------------------- (1) FlatCCProof (EQUIVALENT) We used flat context closure [ROOTLAB] As Q is empty the flat context closure was sound AND complete. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 0(4(x1)) -> 0(1(4(2(3(3(x1)))))) popout

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

job log

popout

actions

all output return to SRS Standard