details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	15.1558449268 seconds
cpu usage	56.728502509
max memory	2.964692992E9

stage attributes

key	value
output-size	406974
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/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) QTRS Reverse [EQUIVALENT, 0 ms] (2) QTRS (3) FlatCCProof [EQUIVALENT, 0 ms] (4) QTRS (5) RootLabelingProof [EQUIVALENT, 18 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 2614 ms] (8) QTRS (9) QTRSRRRProof [EQUIVALENT, 58 ms] (10) QTRS (11) QTRSRRRProof [EQUIVALENT, 53 ms] (12) QTRS (13) QTRSRRRProof [EQUIVALENT, 18 ms] (14) QTRS (15) QTRSRRRProof [EQUIVALENT, 26 ms] (16) QTRS (17) QTRSRRRProof [EQUIVALENT, 2 ms] (18) QTRS (19) QTRSRRRProof [EQUIVALENT, 1 ms] (20) QTRS (21) RisEmptyProof [EQUIVALENT, 0 ms] (22) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 0(0(0(3(0(3(2(3(0(0(3(1(3(2(2(3(3(2(x1)))))))))))))))))) -> 0(1(0(3(0(2(2(0(0(3(3(3(3(2(3(0(2(3(x1)))))))))))))))))) 0(0(1(1(2(2(0(3(2(2(3(1(3(3(2(3(3(2(x1)))))))))))))))))) -> 3(0(2(1(3(2(1(3(3(3(3(2(2(2(0(1(0(2(x1)))))))))))))))))) 0(0(1(1(3(1(1(1(0(3(3(0(3(0(0(2(2(1(x1)))))))))))))))))) -> 1(3(0(2(1(0(2(0(3(0(3(3(0(1(1(1(0(1(x1)))))))))))))))))) 0(0(1(2(0(1(0(3(2(2(0(1(3(0(3(0(1(1(x1)))))))))))))))))) -> 1(0(0(1(3(1(3(0(2(1(3(0(2(0(1(0(0(2(x1)))))))))))))))))) 0(0(1(2(1(2(2(1(0(2(0(1(0(1(1(2(0(1(x1)))))))))))))))))) -> 0(1(2(1(1(0(2(2(1(0(1(0(1(0(0(2(2(1(x1)))))))))))))))))) 0(0(1(3(1(0(3(2(0(2(0(3(0(1(3(2(0(1(x1)))))))))))))))))) -> 0(0(2(0(1(0(2(3(1(0(0(3(3(1(0(2(3(1(x1)))))))))))))))))) 0(0(2(2(2(3(1(0(3(1(1(1(3(3(0(1(1(3(x1)))))))))))))))))) -> 1(3(3(1(1(3(0(2(2(0(2(1(0(3(1(1(0(3(x1)))))))))))))))))) 0(0(2(3(1(2(3(1(3(0(1(0(3(1(0(3(1(3(x1)))))))))))))))))) -> 0(3(1(0(2(0(2(1(3(0(3(1(1(0(3(1(3(3(x1)))))))))))))))))) 0(0(3(0(3(2(3(0(0(1(2(0(1(0(2(1(0(1(x1)))))))))))))))))) -> 0(3(3(1(0(0(2(0(0(2(1(1(1(0(3(0(0(2(x1)))))))))))))))))) 0(0(3(1(3(2(0(0(0(2(3(2(2(2(2(0(3(3(x1)))))))))))))))))) -> 1(2(3(0(2(3(3(0(2(2(0(0(0(2(2(0(3(3(x1)))))))))))))))))) 0(0(3(2(2(3(0(1(3(2(3(1(2(0(0(0(0(1(x1)))))))))))))))))) -> 0(1(0(1(0(3(1(3(0(2(0(0(2(2(3(2(3(0(x1)))))))))))))))))) 0(0(3(2(3(1(0(2(3(1(3(0(1(3(2(2(3(2(x1)))))))))))))))))) -> 0(1(2(3(0(2(3(3(3(0(3(2(1(0(2(1(3(2(x1)))))))))))))))))) 0(1(0(2(3(1(2(2(3(2(0(3(1(1(0(0(2(2(x1)))))))))))))))))) -> 0(2(1(1(3(0(2(1(3(2(0(2(3(0(0(2(1(2(x1)))))))))))))))))) 0(1(1(1(3(2(2(2(2(2(1(0(1(2(2(0(0(1(x1)))))))))))))))))) -> 1(1(2(0(2(0(2(1(0(2(1(2(2(0(1(3(2(1(x1)))))))))))))))))) 0(1(2(0(0(0(1(0(1(3(1(2(3(2(3(2(0(0(x1)))))))))))))))))) -> 3(2(1(0(2(0(0(1(1(1(0(3(2(2(3(0(0(0(x1)))))))))))))))))) 0(1(3(1(0(0(1(1(0(1(0(3(3(3(1(2(2(3(x1)))))))))))))))))) -> 0(2(1(0(3(3(1(0(2(1(1(1(0(0(3(1(3(3(x1)))))))))))))))))) 0(1(3(1(1(1(3(1(2(0(1(0(0(2(2(0(1(1(x1)))))))))))))))))) -> 1(0(0(1(1(0(2(0(0(3(1(2(3(2(1(1(1(1(x1)))))))))))))))))) 0(2(2(3(0(0(3(3(0(3(1(1(0(0(1(2(0(1(x1)))))))))))))))))) -> 3(3(3(0(2(0(1(0(2(2(0(3(1(1(1(0(0(0(x1)))))))))))))))))) 0(3(1(1(3(0(1(2(1(0(1(3(2(0(0(1(1(3(x1)))))))))))))))))) -> 1(0(0(3(0(2(1(1(1(0(2(3(3(1(3(1(0(1(x1)))))))))))))))))) 1(0(0(1(2(3(1(2(3(2(2(3(3(1(1(3(1(3(x1)))))))))))))))))) -> 3(3(3(3(1(3(1(0(0(2(2(2(1(1(2(1(3(1(x1)))))))))))))))))) 1(0(0(3(2(1(3(0(0(1(2(2(0(0(2(0(2(0(x1)))))))))))))))))) -> 0(2(1(0(0(0(3(0(3(0(2(2(1(1(2(0(2(0(x1)))))))))))))))))) 1(0(0(3(2(3(3(1(2(0(1(1(0(3(3(1(3(3(x1)))))))))))))))))) -> 1(1(0(2(3(3(0(1(3(2(3(3(3(1(0(1(0(3(x1)))))))))))))))))) 1(0(1(2(0(2(0(3(0(0(0(0(3(1(2(3(2(1(x1)))))))))))))))))) -> 0(3(0(2(2(1(2(1(0(2(0(0(3(0(0(3(1(1(x1)))))))))))))))))) 1(1(0(1(2(2(2(2(0(0(3(0(1(3(2(3(0(1(x1)))))))))))))))))) -> 1(3(0(2(3(0(2(1(2(0(1(1(1(2(0(0(3(2(x1)))))))))))))))))) 1(1(1(2(0(0(0(0(1(0(1(1(2(0(0(2(2(2(x1)))))))))))))))))) -> 1(2(1(0(2(1(0(2(0(1(0(0(0(1(1(2(0(2(x1)))))))))))))))))) 1(1(2(0(1(3(2(1(0(1(0(1(0(0(1(1(0(0(x1)))))))))))))))))) -> 1(1(1(0(1(0(1(3(0(2(0(0(2(1(0(1(1(0(x1)))))))))))))))))) 1(1(2(1(0(1(2(0(1(3(1(2(0(0(0(1(2(0(x1)))))))))))))))))) -> 0(1(3(0(2(1(1(1(0(1(0(0(2(2(1(1(2(0(x1)))))))))))))))))) 1(1(3(0(1(1(3(1(2(3(3(2(1(3(3(0(1(0(x1)))))))))))))))))) -> 1(3(3(2(1(1(0(3(1(3(2(0(3(3(1(1(1(0(x1)))))))))))))))))) 1(1(3(1(3(0(3(3(1(3(1(2(1(2(2(3(2(2(x1)))))))))))))))))) -> 1(3(3(0(3(2(1(1(1(1(2(2(3(3(1(3(2(2(x1)))))))))))))))))) 1(2(0(0(3(1(2(0(0(3(2(2(3(0(1(3(2(1(x1)))))))))))))))))) -> 0(2(1(0(1(2(1(2(0(2(0(0(2(1(3(3(3(3(x1)))))))))))))))))) 1(2(1(2(3(3(1(2(2(1(3(2(2(0(1(3(0(1(x1)))))))))))))))))) -> 1(3(3(0(2(2(1(2(1(1(2(0(2(1(3(3(1(2(x1)))))))))))))))))) 1(2(1(3(2(3(1(1(3(2(3(0(0(0(2(3(0(3(x1)))))))))))))))))) -> 1(2(3(1(2(0(1(0(0(3(2(1(0(3(3(2(3(3(x1)))))))))))))))))) 1(2(2(1(3(0(1(2(0(1(2(1(2(3(3(0(2(1(x1)))))))))))))))))) -> 1(3(3(1(2(1(0(2(1(2(0(1(0(2(2(3(2(1(x1)))))))))))))))))) 1(2(2(3(0(0(2(2(2(0(2(1(2(0(3(1(1(2(x1)))))))))))))))))) -> 0(0(2(1(1(1(2(1(2(2(2(3(3(0(2(0(2(2(x1)))))))))))))))))) 1(2(2(3(1(0(1(3(1(3(1(2(1(0(0(0(3(1(x1)))))))))))))))))) -> 3(3(2(0(1(2(1(1(1(0(3(3(2(1(0(0(1(1(x1)))))))))))))))))) 1(2(3(0(0(0(1(2(1(3(1(2(0(1(2(2(2(1(x1)))))))))))))))))) -> 1(0(2(2(1(1(3(1(1(2(1(2(0(3(2(0(0(2(x1)))))))))))))))))) 1(3(1(0(1(1(0(1(3(0(3(1(2(3(3(2(0(1(x1)))))))))))))))))) -> 1(1(1(1(0(2(0(3(1(3(3(2(3(0(0(3(1(1(x1)))))))))))))))))) 1(3(1(1(3(3(0(3(0(1(1(1(2(3(0(0(0(1(x1)))))))))))))))))) -> 1(3(0(0(2(0(0(3(1(1(1(0(3(3(1(3(1(1(x1)))))))))))))))))) 1(3(2(0(0(1(2(3(2(1(3(2(3(1(0(1(2(3(x1)))))))))))))))))) -> 0(2(3(2(0(1(3(2(1(3(1(1(1(0(2(2(3(3(x1)))))))))))))))))) 1(3(2(3(0(0(3(2(0(2(1(1(1(2(0(1(0(0(x1)))))))))))))))))) -> 0(2(0(0(2(0(2(1(1(1(0(3(3(1(2(1(3(0(x1)))))))))))))))))) 1(3(3(1(2(2(1(3(0(0(2(3(1(2(3(1(2(3(x1)))))))))))))))))) -> 0(2(0(3(3(3(1(1(2(1(2(1(1(2(3(2(3(3(x1)))))))))))))))))) 2(0(0(0(3(3(1(2(1(3(2(3(0(1(2(2(1(3(x1)))))))))))))))))) -> 2(0(1(0(1(2(3(0(2(1(3(3(1(3(2(2(0(3(x1)))))))))))))))))) 2(0(0(2(0(2(3(2(3(1(3(2(3(3(1(3(2(0(x1)))))))))))))))))) -> 2(1(3(2(1(3(3(3(3(0(3(0(2(2(0(2(2(0(x1)))))))))))))))))) 2(0(1(0(0(2(3(1(2(2(2(2(3(3(0(3(2(3(x1)))))))))))))))))) -> 2(3(3(3(0(2(2(0(0(1(2(3(1(2(2(0(2(3(x1)))))))))))))))))) 2(0(2(2(3(0(2(3(0(0(3(0(1(2(3(1(1(2(x1)))))))))))))))))) -> 2(0(0(2(1(0(2(3(3(0(2(0(3(3(1(1(2(2(x1)))))))))))))))))) 2(0(2(3(1(2(1(3(3(2(3(3(2(3(2(3(0(3(x1)))))))))))))))))) -> 2(1(2(2(2(3(3(3(3(3(2(1(3(0(2(3(0(3(x1)))))))))))))))))) 2(0(3(0(3(2(3(2(2(0(2(2(3(1(0(3(1(3(x1)))))))))))))))))) -> 2(0(3(3(3(2(1(0(2(2(3(3(3(1(0(2(2(0(x1)))))))))))))))))) 2(1(0(0(1(1(1(3(3(2(2(0(3(0(1(3(1(1(x1)))))))))))))))))) -> 2(1(1(1(1(1(1(0(2(2(1(0(3(3(0(3(3(0(x1)))))))))))))))))) 2(1(0(1(2(3(0(0(2(3(3(1(1(1(3(2(2(0(x1)))))))))))))))))) -> 2(1(0(0(2(3(0(2(3(2(1(2(1(3(3(1(1(0(x1)))))))))))))))))) 2(1(0(1(3(1(2(2(2(1(1(0(1(2(0(3(1(1(x1)))))))))))))))))) -> 2(1(0(1(1(2(0(2(2(0(3(1(1(3(1(1(2(1(x1)))))))))))))))))) 2(1(2(3(1(3(0(1(3(2(0(3(2(2(2(2(2(2(x1)))))))))))))))))) -> 2(1(3(1(3(2(2(0(2(2(2(1(2(2(3(3(0(2(x1)))))))))))))))))) 2(1(3(3(0(3(0(1(1(3(2(2(0(1(2(0(1(1(x1)))))))))))))))))) -> 2(1(3(1(3(1(2(1(3(1(0(2(0(3(2(0(0(1(x1)))))))))))))))))) 2(2(0(1(0(3(0(1(3(2(3(1(3(2(3(3(3(2(x1)))))))))))))))))) -> 2(3(3(3(2(0(3(3(1(3(3(0(1(2(2(1(0(2(x1)))))))))))))))))) 2(2(1(3(2(2(3(0(1(3(2(3(2(3(0(1(0(0(x1)))))))))))))))))) -> 2(3(3(0(3(2(3(2(2(1(0(2(2(3(1(1(0(0(x1)))))))))))))))))) 2(2(2(3(1(0(1(2(0(1(0(0(2(2(0(0(0(3(x1)))))))))))))))))) -> 2(2(2(0(0(1(0(0(0(0(2(2(1(1(2(3(0(3(x1)))))))))))))))))) popout

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

job log

popout

actions

all output return to SRS Standard