details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	77.7199 seconds
cpu usage	303.266
user time	295.729
system time	7.53741
max virtual memory	4.0735408E7
max residence set size	9052744.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox/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, 110 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) QDP (7) QDPOrderProof [EQUIVALENT, 5810 ms] (8) QDP (9) QDPOrderProof [EQUIVALENT, 5641 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 0 ms] (12) QDP (13) QDPOrderProof [EQUIVALENT, 3140 ms] (14) QDP (15) QDPOrderProof [EQUIVALENT, 5189 ms] (16) QDP (17) QDPOrderProof [EQUIVALENT, 26 ms] (18) QDP (19) QDPOrderProof [EQUIVALENT, 25 ms] (20) QDP (21) PisEmptyProof [EQUIVALENT, 0 ms] (22) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 0(1(0(2(x1)))) -> 3(0(1(2(0(x1))))) 1(0(0(2(x1)))) -> 2(3(0(0(1(x1))))) 1(0(0(2(x1)))) -> 1(0(1(1(2(0(x1)))))) 1(0(0(2(x1)))) -> 1(3(3(0(2(0(x1)))))) 1(0(0(2(x1)))) -> 3(0(0(1(1(2(x1)))))) 1(0(2(2(x1)))) -> 2(1(2(3(0(x1))))) 1(0(2(2(x1)))) -> 1(1(1(2(2(0(x1)))))) 1(3(4(2(x1)))) -> 1(1(2(3(4(x1))))) 1(3(4(2(x1)))) -> 1(2(3(3(4(5(x1)))))) 1(3(4(2(x1)))) -> 1(2(3(4(4(4(x1)))))) 1(3(4(2(x1)))) -> 1(2(3(4(4(5(x1)))))) 1(3(4(2(x1)))) -> 1(2(3(5(4(5(x1)))))) 1(3(4(2(x1)))) -> 1(2(3(5(5(4(x1)))))) 1(3(5(2(x1)))) -> 2(3(1(0(5(x1))))) 1(3(5(2(x1)))) -> 4(5(1(2(3(x1))))) 3(1(0(2(x1)))) -> 3(0(1(2(0(x1))))) 3(4(0(2(x1)))) -> 3(0(0(2(4(x1))))) 3(4(0(2(x1)))) -> 3(0(1(2(4(x1))))) 3(4(0(2(x1)))) -> 3(0(5(2(4(x1))))) 3(4(0(2(x1)))) -> 3(1(0(2(4(x1))))) 3(4(0(2(x1)))) -> 4(1(2(3(0(x1))))) 3(4(0(2(x1)))) -> 2(0(4(3(3(0(x1)))))) 3(4(0(2(x1)))) -> 3(0(2(1(1(4(x1)))))) 3(4(0(2(x1)))) -> 3(3(0(5(2(4(x1)))))) 3(4(0(2(x1)))) -> 4(2(3(3(3(0(x1)))))) 3(5(0(2(x1)))) -> 3(0(3(2(5(x1))))) 3(5(0(2(x1)))) -> 2(5(3(0(0(0(x1)))))) 3(5(0(2(x1)))) -> 3(0(0(2(5(4(x1)))))) 3(5(0(2(x1)))) -> 5(5(2(3(0(3(x1)))))) 0(2(3(4(2(x1))))) -> 3(0(2(2(4(5(x1)))))) 0(3(4(0(2(x1))))) -> 0(3(1(0(4(2(x1)))))) 0(3(5(0(2(x1))))) -> 2(1(0(5(3(0(x1)))))) 1(0(0(4(2(x1))))) -> 0(4(5(1(0(2(x1)))))) 1(0(3(5(2(x1))))) -> 4(5(3(1(2(0(x1)))))) 1(1(0(2(2(x1))))) -> 1(1(2(0(1(2(x1)))))) 1(3(4(0(2(x1))))) -> 1(2(3(0(1(4(x1)))))) 1(3(5(0(2(x1))))) -> 1(0(2(5(2(3(x1)))))) 3(1(0(0(2(x1))))) -> 3(0(1(2(2(0(x1)))))) 3(1(3(5(2(x1))))) -> 3(0(3(5(1(2(x1)))))) 3(3(4(0(2(x1))))) -> 3(0(0(4(2(3(x1)))))) 3(4(0(0(2(x1))))) -> 3(0(0(4(4(2(x1)))))) 3(4(1(0(2(x1))))) -> 3(1(2(3(0(4(x1)))))) 3(4(1(5(2(x1))))) -> 2(3(0(1(4(5(x1)))))) 3(4(2(0(2(x1))))) -> 3(2(0(4(2(3(x1)))))) 3(4(2(0(2(x1))))) -> 4(2(2(3(0(3(x1)))))) 3(5(0(0(2(x1))))) -> 0(3(0(2(4(5(x1)))))) 3(5(0(4(2(x1))))) -> 2(0(4(4(5(3(x1)))))) 3(5(0(4(2(x1))))) -> 2(5(4(3(0(0(x1)))))) 3(5(3(4(2(x1))))) -> 0(5(4(2(3(3(x1)))))) Q is empty. ---------------------------------------- (1) QTRS Reverse (EQUIVALENT) We applied the QTRS Reverse Processor [REVERSE]. ---------------------------------------- (2) Obligation: Q restricted rewrite system: popout

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

job log

popout

actions

all output return to SRS Standard