details

property	value
status	complete
benchmark	211915.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)	9.08639 seconds
cpu usage	32.6869
user time	31.3254
system time	1.36146
max virtual memory	4.1641932E7
max residence set size	3721072.0

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) DependencyPairsProof [EQUIVALENT, 201 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 0 ms] (4) AND (5) QDP (6) UsableRulesProof [EQUIVALENT, 0 ms] (7) QDP (8) MRRProof [EQUIVALENT, 184 ms] (9) QDP (10) QDPOrderProof [EQUIVALENT, 10 ms] (11) QDP (12) PisEmptyProof [EQUIVALENT, 0 ms] (13) YES (14) QDP (15) QDPOrderProof [EQUIVALENT, 180 ms] (16) QDP (17) QDPOrderProof [EQUIVALENT, 79 ms] (18) QDP (19) QDPOrderProof [EQUIVALENT, 66 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(2(x1))) -> 1(3(0(2(x1)))) 0(1(2(x1))) -> 3(1(2(0(x1)))) 0(1(2(x1))) -> 2(0(4(1(3(x1))))) 0(1(2(x1))) -> 3(0(2(1(3(x1))))) 0(1(2(x1))) -> 3(3(0(2(1(x1))))) 0(1(2(x1))) -> 1(3(3(0(2(3(x1)))))) 0(1(2(x1))) -> 2(0(4(3(1(3(x1)))))) 0(1(2(x1))) -> 3(0(1(3(1(2(x1)))))) 0(1(2(x1))) -> 3(0(5(3(1(2(x1)))))) 0(5(2(x1))) -> 1(5(0(2(x1)))) 0(5(2(x1))) -> 3(5(0(2(x1)))) 0(5(2(x1))) -> 3(0(5(1(2(x1))))) 0(5(2(x1))) -> 3(5(3(0(2(x1))))) 0(5(2(x1))) -> 1(5(5(3(0(2(x1)))))) 0(5(2(x1))) -> 5(0(4(3(1(2(x1)))))) 1(5(2(x1))) -> 5(3(1(2(x1)))) 1(5(2(x1))) -> 1(5(3(1(2(x1))))) 0(0(5(4(x1)))) -> 5(3(0(4(0(0(x1)))))) 0(1(0(1(x1)))) -> 1(1(3(0(3(0(x1)))))) 0(1(1(2(x1)))) -> 2(1(1(3(0(2(x1)))))) 0(1(2(5(x1)))) -> 3(0(5(1(2(x1))))) 0(1(2(5(x1)))) -> 3(5(3(1(2(0(x1)))))) 0(1(3(2(x1)))) -> 3(0(2(1(3(5(x1)))))) 0(1(4(2(x1)))) -> 3(0(0(4(1(2(x1)))))) 0(1(4(2(x1)))) -> 4(0(1(3(1(2(x1)))))) 0(5(2(4(x1)))) -> 5(5(3(0(2(4(x1)))))) 0(5(2(5(x1)))) -> 0(2(3(5(5(x1))))) 0(5(3(2(x1)))) -> 3(0(2(1(5(x1))))) 0(5(3(2(x1)))) -> 5(3(1(4(0(2(x1)))))) 1(0(3(4(x1)))) -> 1(0(4(1(3(x1))))) 1(5(3(2(x1)))) -> 3(1(3(5(2(x1))))) 5(0(1(2(x1)))) -> 1(5(0(4(1(2(x1)))))) 5(1(0(2(x1)))) -> 3(1(5(0(2(x1))))) 5(1(1(2(x1)))) -> 1(3(5(2(1(3(x1)))))) 5(1(5(2(x1)))) -> 1(3(5(5(2(x1))))) 0(0(1(3(2(x1))))) -> 0(3(1(2(0(3(x1)))))) 0(0(5(3(2(x1))))) -> 0(3(0(3(2(5(x1)))))) 0(1(0(3(4(x1))))) -> 4(0(1(3(0(3(x1)))))) 0(1(0(5(4(x1))))) -> 3(0(4(0(1(5(x1)))))) 0(1(2(4(4(x1))))) -> 0(4(1(2(1(4(x1)))))) 0(1(5(3(2(x1))))) -> 1(2(3(0(4(5(x1)))))) 0(5(4(2(4(x1))))) -> 4(5(3(0(4(2(x1)))))) 0(5(4(4(2(x1))))) -> 0(4(4(3(5(2(x1)))))) 1(0(1(3(4(x1))))) -> 4(1(1(3(0(3(x1)))))) 1(0(3(4(5(x1))))) -> 2(1(3(0(4(5(x1)))))) 1(1(3(4(2(x1))))) -> 2(5(1(3(1(4(x1)))))) 1(5(3(2(2(x1))))) -> 2(3(5(3(1(2(x1)))))) 5(0(5(2(4(x1))))) -> 5(1(5(0(4(2(x1)))))) 5(1(0(5(2(x1))))) -> 1(5(0(2(3(5(x1)))))) 5(1(1(2(1(x1))))) -> 3(1(2(5(1(1(x1)))))) Q is empty. ---------------------------------------- (1) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (2) Obligation: popout

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

job log

popout

actions

all output return to SRS Standard