details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	48.5109770298 seconds
cpu usage	189.527098597
max memory	6.05906944E9

stage attributes

key	value
output-size	126328
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) QTRS Reverse [EQUIVALENT, 0 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 1365 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 13 ms] (6) QDP (7) QDPOrderProof [EQUIVALENT, 799 ms] (8) QDP (9) DependencyGraphProof [EQUIVALENT, 0 ms] (10) QDP (11) QDPOrderProof [EQUIVALENT, 1978 ms] (12) QDP (13) QDPOrderProof [EQUIVALENT, 2426 ms] (14) QDP (15) DependencyGraphProof [EQUIVALENT, 0 ms] (16) QDP (17) UsableRulesProof [EQUIVALENT, 0 ms] (18) QDP (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] (20) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 0(0(0(0(x1)))) -> 0(0(0(1(0(2(x1)))))) 0(0(0(0(x1)))) -> 0(0(0(2(2(0(x1)))))) 0(0(0(0(x1)))) -> 0(1(0(2(0(0(x1)))))) 0(0(3(0(x1)))) -> 0(0(2(0(3(x1))))) 0(0(3(0(x1)))) -> 0(0(1(3(4(0(x1)))))) 0(0(3(0(x1)))) -> 0(2(0(3(2(0(x1)))))) 0(0(3(0(x1)))) -> 0(3(0(4(0(4(x1)))))) 0(0(3(0(x1)))) -> 0(4(3(0(2(0(x1)))))) 0(0(3(0(x1)))) -> 0(4(3(0(4(0(x1)))))) 0(0(3(0(x1)))) -> 1(0(2(0(0(3(x1)))))) 0(0(3(0(x1)))) -> 2(0(0(2(0(3(x1)))))) 0(0(3(0(x1)))) -> 3(0(0(2(2(0(x1)))))) 0(5(0(0(x1)))) -> 0(2(0(0(5(x1))))) 0(5(0(0(x1)))) -> 0(0(3(5(1(0(x1)))))) 0(5(0(0(x1)))) -> 0(0(5(1(0(4(x1)))))) 0(5(0(0(x1)))) -> 0(2(0(4(5(0(x1)))))) 0(5(0(0(x1)))) -> 0(2(5(0(4(0(x1)))))) 0(5(0(0(x1)))) -> 0(4(0(0(5(2(x1)))))) 0(5(0(0(x1)))) -> 0(4(0(1(5(0(x1)))))) 0(5(0(0(x1)))) -> 0(5(1(0(1(0(x1)))))) 0(5(0(0(x1)))) -> 2(0(0(2(0(5(x1)))))) 0(5(0(0(x1)))) -> 2(0(5(0(2(0(x1)))))) 0(5(0(0(x1)))) -> 5(0(1(0(2(0(x1)))))) 0(5(0(0(x1)))) -> 5(0(1(0(4(0(x1)))))) 0(5(3(0(x1)))) -> 0(0(3(2(5(x1))))) 0(5(3(0(x1)))) -> 0(0(3(5(1(x1))))) 0(5(3(0(x1)))) -> 0(0(3(5(2(x1))))) 0(5(3(0(x1)))) -> 0(0(5(2(3(x1))))) 0(5(3(0(x1)))) -> 0(2(0(3(5(x1))))) 0(5(3(0(x1)))) -> 0(3(4(0(5(x1))))) 0(5(3(0(x1)))) -> 5(3(0(1(0(x1))))) 0(5(3(0(x1)))) -> 0(0(1(3(5(4(x1)))))) 0(5(3(0(x1)))) -> 0(0(5(2(2(3(x1)))))) 0(5(3(0(x1)))) -> 0(0(5(2(4(3(x1)))))) 0(5(3(0(x1)))) -> 0(1(5(3(4(0(x1)))))) 0(5(3(0(x1)))) -> 0(2(0(3(1(5(x1)))))) 0(5(3(0(x1)))) -> 0(3(5(2(0(4(x1)))))) 0(5(3(0(x1)))) -> 0(5(2(0(4(3(x1)))))) 0(5(3(0(x1)))) -> 0(5(2(2(0(3(x1)))))) 0(5(3(0(x1)))) -> 0(5(3(4(4(0(x1)))))) 0(5(3(0(x1)))) -> 0(5(3(5(2(0(x1)))))) 0(5(3(0(x1)))) -> 1(0(3(5(4(0(x1)))))) 0(5(3(0(x1)))) -> 1(3(5(4(0(0(x1)))))) 0(5(3(0(x1)))) -> 2(3(0(5(1(0(x1)))))) 0(5(3(0(x1)))) -> 2(5(1(0(0(3(x1)))))) 0(5(3(0(x1)))) -> 3(0(0(2(5(2(x1)))))) 0(5(3(0(x1)))) -> 3(0(3(5(1(0(x1)))))) 0(5(3(0(x1)))) -> 3(0(4(0(5(1(x1)))))) 0(5(3(0(x1)))) -> 3(0(4(0(5(2(x1)))))) 0(5(3(0(x1)))) -> 3(0(5(1(0(1(x1)))))) 0(5(3(0(x1)))) -> 3(0(5(1(2(0(x1)))))) 0(5(3(0(x1)))) -> 3(2(0(1(5(0(x1)))))) 0(5(3(0(x1)))) -> 3(4(0(5(2(0(x1)))))) 0(5(3(0(x1)))) -> 3(4(5(0(0(2(x1)))))) 0(5(3(0(x1)))) -> 3(5(1(0(0(2(x1)))))) 0(5(3(0(x1)))) -> 5(0(1(3(2(0(x1)))))) 0(5(3(0(x1)))) -> 5(2(2(3(0(0(x1)))))) popout

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

job log

popout

actions

all output return to SRS Standard