details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	12.7096190453 seconds
cpu usage	45.405954768
max memory	1.916747776E9

stage attributes

key	value
output-size	27151
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, 190 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 3 ms] (6) AND (7) QDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) QDP (10) DependencyGraphProof [EQUIVALENT, 0 ms] (11) QDP (12) QDPOrderProof [EQUIVALENT, 494 ms] (13) QDP (14) QDPOrderProof [EQUIVALENT, 29 ms] (15) QDP (16) PisEmptyProof [EQUIVALENT, 0 ms] (17) YES (18) QDP (19) UsableRulesProof [EQUIVALENT, 0 ms] (20) QDP (21) QDPSizeChangeProof [EQUIVALENT, 0 ms] (22) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 0(1(1(x1))) -> 0(1(2(3(4(1(x1)))))) 0(1(1(x1))) -> 1(3(1(3(4(0(x1)))))) 0(1(1(x1))) -> 5(1(3(0(3(1(x1)))))) 0(1(4(x1))) -> 0(1(3(4(x1)))) 0(1(4(x1))) -> 1(3(4(2(0(x1))))) 0(1(4(x1))) -> 1(5(3(4(0(x1))))) 0(1(4(x1))) -> 3(1(3(4(0(x1))))) 0(1(4(x1))) -> 1(1(5(3(4(0(x1)))))) 0(1(4(x1))) -> 1(2(3(4(3(0(x1)))))) 0(1(4(x1))) -> 1(3(3(4(4(0(x1)))))) 0(1(4(x1))) -> 1(3(4(5(0(5(x1)))))) 0(1(4(x1))) -> 3(4(5(5(0(1(x1)))))) 1(2(4(x1))) -> 1(2(3(4(1(x1))))) 1(2(4(x1))) -> 5(3(4(1(2(x1))))) 1(2(4(x1))) -> 1(5(2(3(4(3(x1)))))) 1(2(4(x1))) -> 2(3(3(4(5(1(x1)))))) 5(2(1(x1))) -> 1(2(2(3(5(4(x1)))))) 5(2(1(x1))) -> 1(3(2(5(3(4(x1)))))) 5(2(4(x1))) -> 0(5(2(3(4(x1))))) 5(2(4(x1))) -> 5(5(3(4(2(x1))))) 5(2(4(x1))) -> 0(3(4(4(5(2(x1)))))) 5(2(4(x1))) -> 2(2(5(3(4(4(x1)))))) 5(2(4(x1))) -> 2(3(3(4(5(5(x1)))))) 5(2(4(x1))) -> 2(3(4(3(5(3(x1)))))) 5(2(4(x1))) -> 2(5(3(4(0(5(x1)))))) 5(2(4(x1))) -> 3(1(2(5(3(4(x1)))))) 5(2(4(x1))) -> 5(2(3(4(0(3(x1)))))) 0(0(2(4(x1)))) -> 0(4(3(0(2(x1))))) 0(1(1(5(x1)))) -> 0(1(3(5(1(2(x1)))))) 0(1(2(4(x1)))) -> 0(1(2(3(3(4(x1)))))) 0(1(4(5(x1)))) -> 3(4(0(5(1(x1))))) 0(1(4(5(x1)))) -> 3(4(5(3(0(1(x1)))))) 0(4(2(1(x1)))) -> 0(4(1(2(3(4(x1)))))) 0(5(1(4(x1)))) -> 0(0(3(5(4(1(x1)))))) 1(0(1(4(x1)))) -> 3(4(0(1(2(1(x1)))))) 1(1(2(4(x1)))) -> 1(3(4(1(2(x1))))) 1(2(2(4(x1)))) -> 2(2(2(3(4(1(x1)))))) 1(2(4(2(x1)))) -> 1(2(3(4(2(3(x1)))))) 1(5(2(1(x1)))) -> 1(0(3(5(1(2(x1)))))) 1(5(2(4(x1)))) -> 3(2(3(5(1(4(x1)))))) 1(5(2(4(x1)))) -> 5(2(3(3(1(4(x1)))))) 5(0(1(4(x1)))) -> 3(4(0(5(3(1(x1)))))) 5(2(5(1(x1)))) -> 3(5(1(5(2(x1))))) 0(1(1(5(4(x1))))) -> 0(0(5(4(1(1(x1)))))) 1(0(0(2(4(x1))))) -> 0(2(0(4(4(1(x1)))))) 1(0(4(2(1(x1))))) -> 1(2(3(4(1(0(x1)))))) 1(2(5(0(1(x1))))) -> 2(3(5(1(0(1(x1)))))) 1(5(3(0(4(x1))))) -> 5(1(3(4(0(4(x1)))))) 5(0(5(2(4(x1))))) -> 4(0(0(5(5(2(x1)))))) 5(3(2(4(2(x1))))) -> 2(1(5(3(4(2(x1)))))) Q is empty. ---------------------------------------- popout

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

job log

popout

actions

all output return to SRS Standard