details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	25.5666 seconds
cpu usage	91.2247
user time	87.6244
system time	3.60031
max virtual memory	3.7251276E7
max residence set size	5948216.0

stage attributes

key	value
starexec-result	YES

output

90.51/25.36 YES 90.64/25.39 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 90.64/25.39 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 90.64/25.39 90.64/25.39 90.64/25.39 Termination w.r.t. Q of the given QTRS could be proven: 90.64/25.39 90.64/25.39 (0) QTRS 90.64/25.39 (1) DependencyPairsProof [EQUIVALENT, 60 ms] 90.64/25.39 (2) QDP 90.64/25.39 (3) DependencyGraphProof [EQUIVALENT, 0 ms] 90.64/25.39 (4) QDP 90.64/25.39 (5) QDPOrderProof [EQUIVALENT, 292 ms] 90.64/25.39 (6) QDP 90.64/25.39 (7) QDPOrderProof [EQUIVALENT, 280 ms] 90.64/25.39 (8) QDP 90.64/25.39 (9) DependencyGraphProof [EQUIVALENT, 0 ms] 90.64/25.39 (10) QDP 90.64/25.39 (11) QDPOrderProof [EQUIVALENT, 224 ms] 90.64/25.39 (12) QDP 90.64/25.39 (13) DependencyGraphProof [EQUIVALENT, 0 ms] 90.64/25.39 (14) QDP 90.64/25.39 (15) QDPOrderProof [EQUIVALENT, 175 ms] 90.64/25.39 (16) QDP 90.64/25.39 (17) QDPOrderProof [EQUIVALENT, 214 ms] 90.64/25.39 (18) QDP 90.64/25.39 (19) DependencyGraphProof [EQUIVALENT, 0 ms] 90.64/25.39 (20) QDP 90.64/25.39 (21) QDPOrderProof [EQUIVALENT, 207 ms] 90.64/25.39 (22) QDP 90.64/25.39 (23) QDPOrderProof [EQUIVALENT, 188 ms] 90.64/25.39 (24) QDP 90.64/25.39 (25) DependencyGraphProof [EQUIVALENT, 0 ms] 90.64/25.39 (26) QDP 90.64/25.39 (27) QDPOrderProof [EQUIVALENT, 153 ms] 90.64/25.39 (28) QDP 90.64/25.39 (29) DependencyGraphProof [EQUIVALENT, 0 ms] 90.64/25.39 (30) QDP 90.64/25.39 (31) QDPOrderProof [EQUIVALENT, 151 ms] 90.64/25.39 (32) QDP 90.64/25.39 (33) QDPOrderProof [EQUIVALENT, 220 ms] 90.64/25.39 (34) QDP 90.64/25.39 (35) QDPOrderProof [EQUIVALENT, 156 ms] 90.64/25.39 (36) QDP 90.64/25.39 (37) QDPOrderProof [EQUIVALENT, 129 ms] 90.64/25.39 (38) QDP 90.64/25.39 (39) DependencyGraphProof [EQUIVALENT, 0 ms] 90.64/25.39 (40) QDP 90.64/25.39 (41) QDPSizeChangeProof [EQUIVALENT, 0 ms] 90.64/25.39 (42) YES 90.64/25.39 90.64/25.39 90.64/25.39 ---------------------------------------- 90.64/25.39 90.64/25.39 (0) 90.64/25.39 Obligation: 90.64/25.39 Q restricted rewrite system: 90.64/25.39 The TRS R consists of the following rules: 90.64/25.39 90.64/25.39 a__primes -> a__sieve(a__from(s(s(0)))) 90.64/25.39 a__from(X) -> cons(mark(X), from(s(X))) 90.64/25.39 a__head(cons(X, Y)) -> mark(X) 90.64/25.39 a__tail(cons(X, Y)) -> mark(Y) 90.64/25.39 a__if(true, X, Y) -> mark(X) 90.64/25.39 a__if(false, X, Y) -> mark(Y) 90.64/25.39 a__filter(s(s(X)), cons(Y, Z)) -> a__if(divides(s(s(mark(X))), mark(Y)), filter(s(s(X)), Z), cons(Y, filter(X, sieve(Y)))) 90.64/25.39 a__sieve(cons(X, Y)) -> cons(mark(X), filter(X, sieve(Y))) 90.64/25.39 mark(primes) -> a__primes 90.64/25.39 mark(sieve(X)) -> a__sieve(mark(X)) 90.64/25.39 mark(from(X)) -> a__from(mark(X)) 90.64/25.39 mark(head(X)) -> a__head(mark(X)) 90.64/25.39 mark(tail(X)) -> a__tail(mark(X)) 90.64/25.39 mark(if(X1, X2, X3)) -> a__if(mark(X1), X2, X3) 90.64/25.39 mark(filter(X1, X2)) -> a__filter(mark(X1), mark(X2)) 90.64/25.39 mark(s(X)) -> s(mark(X)) 90.64/25.39 mark(0) -> 0 90.64/25.39 mark(cons(X1, X2)) -> cons(mark(X1), X2) 90.64/25.39 mark(true) -> true 90.64/25.39 mark(false) -> false 90.64/25.39 mark(divides(X1, X2)) -> divides(mark(X1), mark(X2)) 90.64/25.39 a__primes -> primes 90.64/25.39 a__sieve(X) -> sieve(X) 90.64/25.39 a__from(X) -> from(X) 90.64/25.39 a__head(X) -> head(X) 90.64/25.39 a__tail(X) -> tail(X) 90.64/25.39 a__if(X1, X2, X3) -> if(X1, X2, X3) 90.64/25.39 a__filter(X1, X2) -> filter(X1, X2) 90.64/25.39 90.64/25.39 The set Q consists of the following terms: 90.64/25.39 90.64/25.39 a__primes 90.64/25.39 a__from(x0) 90.64/25.39 mark(primes) 90.64/25.39 mark(sieve(x0)) 90.64/25.39 mark(from(x0)) 90.64/25.39 mark(head(x0)) 90.64/25.39 mark(tail(x0)) 90.64/25.39 mark(if(x0, x1, x2)) 90.64/25.39 mark(filter(x0, x1)) 90.64/25.39 mark(s(x0)) popout

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

job log

popout

actions

all output return to TRS_Innermost 2019-03-28 22.12