details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	9.42776 seconds
cpu usage	16.6265
user time	15.9422
system time	0.684319
max virtual memory	3.777168E7
max residence set size	2169476.0

stage attributes

key	value
starexec-result	YES

output

14.34/4.91 YES 16.31/5.44 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 16.31/5.44 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 16.31/5.44 16.31/5.44 16.31/5.44 Termination w.r.t. Q of the given QTRS could be proven: 16.31/5.44 16.31/5.44 (0) QTRS 16.31/5.44 (1) DependencyPairsProof [EQUIVALENT, 309 ms] 16.31/5.44 (2) QDP 16.31/5.44 (3) DependencyGraphProof [EQUIVALENT, 0 ms] 16.31/5.44 (4) AND 16.31/5.44 (5) QDP 16.31/5.44 (6) UsableRulesProof [EQUIVALENT, 0 ms] 16.31/5.44 (7) QDP 16.31/5.44 (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] 16.31/5.44 (9) YES 16.31/5.44 (10) QDP 16.31/5.44 (11) UsableRulesProof [EQUIVALENT, 0 ms] 16.31/5.44 (12) QDP 16.31/5.44 (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] 16.31/5.44 (14) YES 16.31/5.44 16.31/5.44 16.31/5.44 ---------------------------------------- 16.31/5.44 16.31/5.44 (0) 16.31/5.44 Obligation: 16.31/5.44 Q restricted rewrite system: 16.31/5.44 The TRS R consists of the following rules: 16.31/5.44 16.31/5.44 0(1(2(x1))) -> 0(2(1(1(x1)))) 16.31/5.44 2(3(1(x1))) -> 3(4(2(1(x1)))) 16.31/5.44 0(1(2(0(x1)))) -> 0(0(2(1(1(x1))))) 16.31/5.44 0(1(2(0(x1)))) -> 0(2(1(1(0(x1))))) 16.31/5.44 0(1(2(1(x1)))) -> 0(2(1(1(1(x1))))) 16.31/5.44 0(1(2(4(x1)))) -> 4(0(2(1(1(x1))))) 16.31/5.44 0(1(2(5(x1)))) -> 0(2(5(1(1(x1))))) 16.31/5.44 0(1(2(5(x1)))) -> 0(4(2(1(5(x1))))) 16.31/5.46 0(1(3(1(x1)))) -> 0(0(3(1(1(x1))))) 16.31/5.46 0(1(3(1(x1)))) -> 3(0(2(1(1(1(x1)))))) 16.31/5.46 0(1(4(1(x1)))) -> 4(0(1(1(1(x1))))) 16.31/5.46 0(1(4(5(x1)))) -> 0(4(1(1(5(x1))))) 16.31/5.46 0(2(0(1(x1)))) -> 0(0(2(4(1(x1))))) 16.31/5.46 0(5(3(1(x1)))) -> 5(0(3(1(1(1(x1)))))) 16.31/5.46 0(5(3(2(x1)))) -> 0(3(4(2(5(x1))))) 16.31/5.46 2(3(2(0(x1)))) -> 2(2(1(3(0(x1))))) 16.31/5.46 2(4(5(2(x1)))) -> 2(1(4(2(5(x1))))) 16.31/5.46 3(0(1(2(x1)))) -> 3(4(0(2(1(x1))))) 16.31/5.46 4(4(3(2(x1)))) -> 4(3(4(2(1(x1))))) 16.31/5.46 4(5(3(1(x1)))) -> 3(5(4(4(1(x1))))) 16.31/5.46 4(5(3(1(x1)))) -> 4(3(1(5(1(x1))))) 16.31/5.46 4(5(3(2(x1)))) -> 3(4(2(5(4(x1))))) 16.31/5.46 4(5(3(2(x1)))) -> 3(5(4(2(1(x1))))) 16.31/5.46 0(1(0(2(2(x1))))) -> 0(0(2(1(4(2(x1)))))) 16.31/5.46 0(1(0(3(1(x1))))) -> 0(3(4(0(1(1(x1)))))) 16.31/5.46 0(1(4(5(1(x1))))) -> 4(0(2(5(1(1(x1)))))) 16.31/5.46 0(1(5(0(1(x1))))) -> 0(0(1(5(5(1(x1)))))) 16.31/5.46 0(2(3(1(3(x1))))) -> 0(3(4(2(1(3(x1)))))) 16.31/5.46 0(4(1(5(2(x1))))) -> 0(4(2(5(1(1(x1)))))) 16.31/5.46 0(5(1(3(2(x1))))) -> 3(0(2(1(1(5(x1)))))) 16.31/5.46 0(5(2(0(4(x1))))) -> 0(4(2(5(0(4(x1)))))) 16.31/5.46 0(5(3(1(5(x1))))) -> 5(0(3(4(1(5(x1)))))) 16.31/5.46 0(5(3(2(5(x1))))) -> 0(4(3(5(2(5(x1)))))) 16.31/5.46 2(0(1(3(1(x1))))) -> 1(1(4(3(0(2(x1)))))) 16.31/5.46 2(0(1(3(5(x1))))) -> 2(5(1(1(0(3(x1)))))) 16.31/5.46 2(0(1(5(3(x1))))) -> 2(1(1(3(0(5(x1)))))) 16.31/5.46 2(3(1(0(1(x1))))) -> 0(3(2(1(1(5(x1)))))) 16.31/5.46 2(3(1(4(1(x1))))) -> 3(4(2(5(1(1(x1)))))) 16.31/5.46 2(3(5(1(2(x1))))) -> 2(3(2(1(5(1(x1)))))) 16.31/5.46 3(0(1(2(0(x1))))) -> 3(4(0(2(1(0(x1)))))) 16.31/5.46 3(2(0(1(0(x1))))) -> 3(2(1(5(0(0(x1)))))) 16.31/5.46 3(2(3(5(1(x1))))) -> 3(3(4(2(1(5(x1)))))) 16.31/5.46 3(5(3(1(3(x1))))) -> 3(5(4(3(1(3(x1)))))) 16.31/5.46 4(0(3(3(1(x1))))) -> 0(3(4(3(1(1(x1)))))) 16.31/5.46 4(4(3(2(5(x1))))) -> 3(4(2(4(1(5(x1)))))) 16.31/5.46 4(5(0(5(2(x1))))) -> 0(4(2(1(5(5(x1)))))) 16.31/5.46 4(5(2(3(1(x1))))) -> 5(3(4(3(2(1(x1)))))) 16.31/5.46 4(5(2(5(2(x1))))) -> 4(2(5(5(2(1(x1)))))) 16.31/5.46 4(5(3(5(1(x1))))) -> 4(5(5(4(3(1(x1)))))) 16.31/5.46 16.31/5.46 Q is empty. 16.31/5.46 16.31/5.46 ---------------------------------------- 16.31/5.46 16.31/5.46 (1) DependencyPairsProof (EQUIVALENT) 16.31/5.46 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 16.31/5.46 ---------------------------------------- 16.31/5.46 16.31/5.46 (2) 16.31/5.46 Obligation: 16.31/5.46 Q DP problem: 16.31/5.46 The TRS P consists of the following rules: 16.31/5.46 16.31/5.46 0^1(1(2(x1))) -> 0^1(2(1(1(x1)))) 16.31/5.46 0^1(1(2(x1))) -> 2^1(1(1(x1))) 16.31/5.46 2^1(3(1(x1))) -> 3^1(4(2(1(x1)))) 16.31/5.46 2^1(3(1(x1))) -> 4^1(2(1(x1))) 16.31/5.46 2^1(3(1(x1))) -> 2^1(1(x1)) 16.31/5.46 0^1(1(2(0(x1)))) -> 0^1(0(2(1(1(x1))))) 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