details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	15.4870200157 seconds
cpu usage	56.892962368
max memory	4.791156736E9

stage attributes

key	value
output-size	34065
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 w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRS Reverse [EQUIVALENT, 0 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 213 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) QDP (8) QDPOrderProof [EQUIVALENT, 170 ms] (9) QDP (10) QDPOrderProof [EQUIVALENT, 74 ms] (11) QDP (12) PisEmptyProof [EQUIVALENT, 0 ms] (13) YES (14) QDP (15) QDPOrderProof [EQUIVALENT, 145 ms] (16) QDP (17) QDPOrderProof [EQUIVALENT, 73 ms] (18) QDP (19) PisEmptyProof [EQUIVALENT, 0 ms] (20) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 0(1(2(2(x1)))) -> 0(1(0(2(2(x1))))) 0(1(2(2(x1)))) -> 0(1(2(3(2(x1))))) 0(1(2(2(x1)))) -> 0(2(2(1(3(x1))))) 0(1(2(2(x1)))) -> 1(0(3(2(2(x1))))) 0(1(2(2(x1)))) -> 1(2(0(3(2(x1))))) 0(1(2(2(x1)))) -> 1(3(0(2(2(x1))))) 0(1(2(2(x1)))) -> 1(3(2(0(2(x1))))) 0(1(2(2(x1)))) -> 0(1(0(4(2(2(x1)))))) 0(1(2(2(x1)))) -> 0(2(1(3(2(3(x1)))))) 0(1(2(2(x1)))) -> 1(2(1(0(4(2(x1)))))) 0(1(2(2(x1)))) -> 1(5(0(4(2(2(x1)))))) 0(1(2(2(x1)))) -> 2(0(3(1(3(2(x1)))))) 0(1(2(2(x1)))) -> 2(1(1(0(4(2(x1)))))) 0(1(2(2(x1)))) -> 2(1(3(0(2(0(x1)))))) 0(1(2(2(x1)))) -> 2(1(3(3(2(0(x1)))))) 0(1(2(2(x1)))) -> 2(1(5(3(0(2(x1)))))) 0(1(2(2(x1)))) -> 2(2(1(3(0(5(x1)))))) 0(1(2(2(x1)))) -> 2(4(1(3(2(0(x1)))))) 0(1(4(5(x1)))) -> 1(5(0(4(1(x1))))) 0(1(4(5(x1)))) -> 5(0(4(1(5(x1))))) 0(1(4(5(x1)))) -> 5(4(1(5(0(x1))))) 0(1(4(5(x1)))) -> 1(1(5(0(4(1(x1)))))) 0(1(4(5(x1)))) -> 5(4(1(5(5(0(x1)))))) 5(1(2(2(x1)))) -> 1(0(2(2(5(x1))))) 5(1(2(2(x1)))) -> 1(3(5(2(2(x1))))) 5(1(2(2(x1)))) -> 1(5(2(3(2(x1))))) 5(1(2(2(x1)))) -> 1(5(0(2(2(3(x1)))))) 5(1(2(2(x1)))) -> 2(1(0(3(2(5(x1)))))) 5(1(2(2(x1)))) -> 3(1(3(5(2(2(x1)))))) 5(1(2(2(x1)))) -> 4(1(3(2(2(5(x1)))))) 5(1(2(2(x1)))) -> 5(1(0(4(2(2(x1)))))) 5(1(2(2(x1)))) -> 5(1(2(0(4(2(x1)))))) 0(1(1(4(5(x1))))) -> 3(1(0(4(1(5(x1)))))) 0(1(2(2(2(x1))))) -> 1(0(2(2(5(2(x1)))))) 0(1(2(2(5(x1))))) -> 1(5(0(4(2(2(x1)))))) 0(1(2(4(5(x1))))) -> 2(5(1(0(4(5(x1)))))) 0(1(4(5(2(x1))))) -> 1(0(4(2(0(5(x1)))))) 0(1(4(5(5(x1))))) -> 5(0(4(0(1(5(x1)))))) 0(1(5(4(5(x1))))) -> 1(5(0(4(1(5(x1)))))) 0(5(1(2(2(x1))))) -> 0(1(3(2(5(2(x1)))))) 3(3(1(2(2(x1))))) -> 1(3(2(0(3(2(x1)))))) 3(4(4(0(5(x1))))) -> 3(5(4(5(0(4(x1)))))) 5(0(1(2(2(x1))))) -> 1(3(2(0(5(2(x1)))))) 5(1(2(2(5(x1))))) -> 1(5(2(3(2(5(x1)))))) 5(2(1(2(2(x1))))) -> 2(1(3(5(2(2(x1)))))) 5(2(4(0(5(x1))))) -> 0(4(2(5(5(5(x1)))))) 5(2(4(0(5(x1))))) -> 0(4(5(4(2(5(x1)))))) Q is empty. ---------------------------------------- (1) QTRS Reverse (EQUIVALENT) We applied the QTRS Reverse Processor [REVERSE]. ---------------------------------------- (2) popout

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

job log

popout

actions

all output return to SRS Standard