details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	261.536 seconds
cpu usage	1023.06
user time	1004.33
system time	18.7343
max virtual memory	6.1453756E7
max residence set size	1.50087E7

stage attributes

key	value
starexec-result	YES

output

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, 246 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 7 ms] (6) QDP (7) QDPOrderProof [EQUIVALENT, 5662 ms] (8) QDP (9) QDPOrderProof [EQUIVALENT, 4775 ms] (10) QDP (11) QDPOrderProof [EQUIVALENT, 3114 ms] (12) QDP (13) QDPOrderProof [EQUIVALENT, 4204 ms] (14) QDP (15) QDPOrderProof [EQUIVALENT, 4002 ms] (16) QDP (17) QDPOrderProof [EQUIVALENT, 4690 ms] (18) QDP (19) QDPOrderProof [EQUIVALENT, 3047 ms] (20) QDP (21) DependencyGraphProof [EQUIVALENT, 0 ms] (22) QDP (23) QDPOrderProof [EQUIVALENT, 5124 ms] (24) QDP (25) QDPOrderProof [EQUIVALENT, 4830 ms] (26) QDP (27) QDPOrderProof [EQUIVALENT, 5414 ms] (28) QDP (29) QDPOrderProof [EQUIVALENT, 6839 ms] (30) QDP (31) QDPOrderProof [EQUIVALENT, 4652 ms] (32) QDP (33) QDPOrderProof [EQUIVALENT, 5741 ms] (34) QDP (35) DependencyGraphProof [EQUIVALENT, 0 ms] (36) AND (37) QDP (38) QDPOrderProof [EQUIVALENT, 5515 ms] (39) QDP (40) PisEmptyProof [EQUIVALENT, 0 ms] (41) YES (42) QDP (43) QDPOrderProof [EQUIVALENT, 1379 ms] (44) QDP (45) QDPOrderProof [EQUIVALENT, 1186 ms] (46) QDP (47) QDPOrderProof [EQUIVALENT, 21 ms] (48) QDP (49) PisEmptyProof [EQUIVALENT, 0 ms] (50) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 0(1(0(x1))) -> 2(0(0(1(x1)))) 0(1(0(x1))) -> 0(1(2(2(0(x1))))) 0(1(0(x1))) -> 2(0(0(3(1(x1))))) 0(1(0(x1))) -> 0(1(2(4(0(3(x1)))))) 0(1(0(x1))) -> 1(2(2(0(0(4(x1)))))) 0(1(0(x1))) -> 1(2(3(4(0(0(x1)))))) 0(1(0(x1))) -> 1(3(2(0(0(0(x1)))))) 0(1(0(x1))) -> 1(3(4(0(2(0(x1)))))) 0(1(0(x1))) -> 1(3(4(4(0(0(x1)))))) 0(1(0(x1))) -> 2(0(0(1(2(2(x1)))))) 0(1(0(x1))) -> 2(0(0(2(0(1(x1)))))) 0(1(0(x1))) -> 2(0(0(3(0(1(x1)))))) 0(1(0(x1))) -> 2(0(2(0(4(1(x1)))))) 0(1(0(x1))) -> 2(1(2(2(0(0(x1)))))) 0(1(0(x1))) -> 2(4(0(4(0(1(x1)))))) 0(1(0(x1))) -> 4(1(2(2(0(0(x1)))))) 0(1(1(0(x1)))) -> 2(2(0(0(1(1(x1)))))) 0(1(5(0(x1)))) -> 0(3(5(1(0(x1))))) 0(1(5(0(x1)))) -> 0(3(3(5(1(0(x1)))))) 0(5(5(0(x1)))) -> 2(2(0(0(5(5(x1)))))) 1(0(1(0(x1)))) -> 1(1(3(5(0(0(x1)))))) 1(3(0(1(x1)))) -> 1(1(0(3(4(1(x1)))))) 1(3(0(1(x1)))) -> 5(1(1(3(4(0(x1)))))) 3(0(1(0(x1)))) -> 0(1(3(2(0(4(x1)))))) 3(0(1(0(x1)))) -> 2(0(4(3(0(1(x1)))))) 3(0(1(0(x1)))) -> 2(2(3(0(0(1(x1)))))) 3(0(1(0(x1)))) -> 3(0(2(2(0(1(x1)))))) 3(1(0(0(x1)))) -> 1(0(3(4(0(x1))))) 3(1(0(0(x1)))) -> 2(0(3(1(0(x1))))) 3(1(0(0(x1)))) -> 3(0(0(5(1(x1))))) 3(1(0(0(x1)))) -> 1(2(0(3(0(2(x1)))))) 3(1(0(0(x1)))) -> 3(1(3(0(2(0(x1)))))) 3(1(5(0(x1)))) -> 1(1(3(5(0(x1))))) popout

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

job log

popout

actions

all output return to SRS Standard