details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	112.278 seconds
cpu usage	406.206
user time	394.848
system time	11.3578
max virtual memory	6.289312E7
max residence set size	1.5002656E7

stage attributes

key	value
starexec-result	YES

output

403.94/111.63 YES 405.72/112.09 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 405.72/112.09 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 405.72/112.09 405.72/112.09 405.72/112.09 Termination w.r.t. Q of the given QTRS could be proven: 405.72/112.09 405.72/112.09 (0) QTRS 405.72/112.09 (1) QTRSRRRProof [EQUIVALENT, 220 ms] 405.72/112.09 (2) QTRS 405.72/112.09 (3) DependencyPairsProof [EQUIVALENT, 1276 ms] 405.72/112.09 (4) QDP 405.72/112.09 (5) QDPOrderProof [EQUIVALENT, 1842 ms] 405.72/112.09 (6) QDP 405.72/112.09 (7) DependencyGraphProof [EQUIVALENT, 0 ms] 405.72/112.09 (8) AND 405.72/112.09 (9) QDP 405.72/112.09 (10) QDPOrderProof [EQUIVALENT, 0 ms] 405.72/112.09 (11) QDP 405.72/112.09 (12) DependencyGraphProof [EQUIVALENT, 0 ms] 405.72/112.09 (13) QDP 405.72/112.09 (14) QDPOrderProof [EQUIVALENT, 51 ms] 405.72/112.09 (15) QDP 405.72/112.09 (16) QDPOrderProof [EQUIVALENT, 6193 ms] 405.72/112.09 (17) QDP 405.72/112.09 (18) PisEmptyProof [EQUIVALENT, 0 ms] 405.72/112.09 (19) YES 405.72/112.09 (20) QDP 405.72/112.09 (21) QDPOrderProof [EQUIVALENT, 0 ms] 405.72/112.09 (22) QDP 405.72/112.09 (23) QDPOrderProof [EQUIVALENT, 52 ms] 405.72/112.09 (24) QDP 405.72/112.09 (25) PisEmptyProof [EQUIVALENT, 0 ms] 405.72/112.09 (26) YES 405.72/112.09 (27) QDP 405.72/112.09 (28) QDPOrderProof [EQUIVALENT, 0 ms] 405.72/112.09 (29) QDP 405.72/112.09 (30) QDPOrderProof [EQUIVALENT, 34 ms] 405.72/112.09 (31) QDP 405.72/112.09 (32) QDPOrderProof [EQUIVALENT, 44 ms] 405.72/112.09 (33) QDP 405.72/112.09 (34) PisEmptyProof [EQUIVALENT, 0 ms] 405.72/112.09 (35) YES 405.72/112.09 (36) QDP 405.72/112.09 (37) QDPOrderProof [EQUIVALENT, 0 ms] 405.72/112.09 (38) QDP 405.72/112.09 (39) QDPOrderProof [EQUIVALENT, 41 ms] 405.72/112.09 (40) QDP 405.72/112.09 (41) QDPOrderProof [EQUIVALENT, 0 ms] 405.72/112.09 (42) QDP 405.72/112.09 (43) PisEmptyProof [EQUIVALENT, 0 ms] 405.72/112.09 (44) YES 405.72/112.09 (45) QDP 405.72/112.09 (46) QDPOrderProof [EQUIVALENT, 0 ms] 405.72/112.09 (47) QDP 405.72/112.09 (48) QDPOrderProof [EQUIVALENT, 50 ms] 405.72/112.09 (49) QDP 405.72/112.09 (50) QDPOrderProof [EQUIVALENT, 0 ms] 405.72/112.09 (51) QDP 405.72/112.09 (52) QDPOrderProof [EQUIVALENT, 1839 ms] 405.72/112.09 (53) QDP 405.72/112.09 (54) PisEmptyProof [EQUIVALENT, 0 ms] 405.72/112.09 (55) YES 405.72/112.09 405.72/112.09 405.72/112.09 ---------------------------------------- 405.72/112.09 405.72/112.09 (0) 405.72/112.09 Obligation: 405.72/112.09 Q restricted rewrite system: 405.72/112.09 The TRS R consists of the following rules: 405.72/112.09 405.72/112.09 0(0(1(2(x1)))) -> 0(3(4(2(x1)))) 405.72/112.09 2(0(1(0(5(3(x1)))))) -> 2(0(3(1(3(3(x1)))))) 405.72/112.09 4(1(1(5(0(4(x1)))))) -> 4(4(2(2(0(4(x1)))))) 405.72/112.09 2(3(2(5(5(0(0(0(x1)))))))) -> 0(2(1(4(2(5(3(2(x1)))))))) 405.72/112.09 5(0(0(5(3(3(4(3(x1)))))))) -> 5(3(1(3(0(3(0(3(x1)))))))) 405.72/112.09 1(0(0(1(5(5(4(2(4(x1))))))))) -> 4(3(1(0(4(1(0(3(3(x1))))))))) 405.72/112.09 3(0(0(1(0(4(5(4(2(x1))))))))) -> 4(4(5(3(1(2(3(4(2(x1))))))))) 405.72/112.09 3(2(3(1(2(2(2(4(3(5(x1)))))))))) -> 5(3(4(4(4(4(0(4(0(x1))))))))) 405.72/112.09 0(0(1(2(5(1(4(4(5(5(4(x1))))))))))) -> 0(0(0(4(1(1(3(5(3(4(2(x1))))))))))) 405.72/112.09 1(5(2(2(5(1(1(2(4(4(5(4(x1)))))))))))) -> 1(2(2(3(3(3(3(0(1(1(3(4(x1)))))))))))) 405.72/112.09 4(1(5(3(3(5(0(4(5(1(4(4(1(x1))))))))))))) -> 5(4(3(2(2(3(3(2(1(2(5(0(5(x1))))))))))))) 405.72/112.09 1(0(3(0(0(0(0(2(3(1(4(0(2(0(4(x1))))))))))))))) -> 1(4(4(0(4(1(4(0(3(2(4(1(0(2(4(x1))))))))))))))) 405.72/112.09 2(5(0(5(1(5(2(3(5(3(1(3(5(4(5(x1))))))))))))))) -> 2(2(5(4(2(0(1(5(1(1(4(1(0(3(4(x1))))))))))))))) 405.72/112.09 5(2(5(1(1(5(0(0(3(0(5(5(3(3(2(x1))))))))))))))) -> 5(5(3(3(1(5(0(3(1(0(4(3(1(3(2(x1))))))))))))))) 405.72/112.09 2(1(1(5(2(5(5(0(1(3(4(1(4(4(5(3(x1)))))))))))))))) -> 2(5(2(3(3(5(4(3(5(4(5(5(0(0(3(1(x1)))))))))))))))) 405.72/112.10 0(4(4(5(0(4(5(0(5(2(3(0(0(2(4(4(2(x1))))))))))))))))) -> 0(4(4(3(0(2(5(0(5(4(1(3(5(4(4(1(0(x1))))))))))))))))) 405.72/112.10 1(1(0(0(3(1(3(0(2(1(2(5(2(5(0(2(0(x1))))))))))))))))) -> 2(2(4(3(2(1(3(2(2(1(4(3(0(2(2(5(5(x1))))))))))))))))) 405.72/112.10 2(5(4(4(4(2(3(5(4(0(4(0(0(5(4(5(5(x1))))))))))))))))) -> 5(3(1(4(4(5(0(5(0(3(1(2(1(1(2(4(3(x1))))))))))))))))) 405.72/112.10 5(0(0(1(3(3(2(5(3(4(0(3(4(3(5(4(4(2(x1)))))))))))))))))) -> 5(5(0(0(1(1(1(0(2(2(2(1(3(2(1(2(2(2(x1)))))))))))))))))) 405.72/112.10 4(4(0(2(2(1(1(4(1(1(1(0(0(0(2(3(4(4(4(x1))))))))))))))))))) -> 3(1(0(3(4(2(2(1(0(1(5(2(0(5(4(4(2(1(4(x1))))))))))))))))))) 405.72/112.10 0(3(2(2(1(4(5(3(3(5(5(1(5(1(0(5(1(5(5(1(x1)))))))))))))))))))) -> 0(3(1(4(0(2(0(0(2(4(5(0(2(3(0(5(2(1(5(1(x1)))))))))))))))))))) 405.72/112.10 4(2(3(1(4(3(0(3(1(1(5(0(4(1(3(4(3(1(4(4(x1)))))))))))))))))))) -> 4(1(4(4(2(5(5(1(5(4(5(5(2(0(5(0(2(0(5(x1))))))))))))))))))) 405.72/112.10 1(4(1(4(2(5(4(5(5(0(5(0(4(0(4(5(0(0(5(4(2(x1))))))))))))))))))))) -> 1(5(5(1(1(3(0(3(5(5(3(2(4(2(0(3(5(1(0(3(2(x1))))))))))))))))))))) 405.72/112.10 2(2(4(0(0(1(4(3(1(4(4(3(1(2(1(1(5(0(4(5(0(x1))))))))))))))))))))) -> 4(3(0(2(4(0(4(3(0(4(2(0(5(1(4(2(3(2(3(0(0(x1))))))))))))))))))))) 405.72/112.10 4(2(4(2(5(5(2(0(2(0(2(0(3(1(5(3(0(1(4(4(2(x1))))))))))))))))))))) -> 4(2(4(5(1(3(5(2(4(4(2(0(5(0(1(2(5(2(4(5(0(x1))))))))))))))))))))) 405.72/112.10 405.72/112.10 Q is empty. 405.72/112.10 popout

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

job log

popout

actions

all output return to SRS_Standard 2019-03-29 03.29