details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	16.7029 seconds
cpu usage	62.2691
user time	59.9804
system time	2.28872
max virtual memory	4.0213644E7
max residence set size	4555160.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) QTRS Reverse [EQUIVALENT, 0 ms] (2) QTRS (3) FlatCCProof [EQUIVALENT, 0 ms] (4) QTRS (5) RootLabelingProof [EQUIVALENT, 40 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 3255 ms] (8) QTRS (9) DependencyPairsProof [EQUIVALENT, 0 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 0 ms] (12) AND (13) QDP (14) UsableRulesProof [EQUIVALENT, 0 ms] (15) QDP (16) MNOCProof [EQUIVALENT, 0 ms] (17) QDP (18) QDPOrderProof [EQUIVALENT, 5 ms] (19) QDP (20) PisEmptyProof [EQUIVALENT, 0 ms] (21) YES (22) QDP (23) UsableRulesProof [EQUIVALENT, 0 ms] (24) QDP (25) QDPOrderProof [EQUIVALENT, 6 ms] (26) QDP (27) PisEmptyProof [EQUIVALENT, 0 ms] (28) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 0(0(x1)) -> 0(1(2(0(1(1(x1)))))) 0(0(x1)) -> 1(0(1(0(1(1(x1)))))) 3(0(x1)) -> 1(0(1(1(1(3(x1)))))) 0(0(0(x1))) -> 0(0(1(1(0(x1))))) 0(0(3(x1))) -> 0(3(1(0(1(1(x1)))))) 2(3(0(x1))) -> 2(1(0(1(1(3(x1)))))) 3(0(0(x1))) -> 3(0(1(0(1(1(x1)))))) 3(0(4(x1))) -> 3(1(0(1(1(4(x1)))))) 5(0(3(x1))) -> 3(0(1(1(5(x1))))) 5(0(3(x1))) -> 3(5(0(1(1(x1))))) 0(0(0(4(x1)))) -> 2(0(2(0(0(4(x1)))))) 0(0(1(3(x1)))) -> 0(3(1(0(1(1(x1)))))) 0(0(2(4(x1)))) -> 0(2(2(0(4(x1))))) 0(2(1(3(x1)))) -> 0(1(2(3(4(x1))))) 0(2(1(3(x1)))) -> 2(0(1(3(4(x1))))) 0(2(1(4(x1)))) -> 2(0(1(1(4(x1))))) 0(2(3(0(x1)))) -> 2(3(4(0(0(x1))))) 0(2(3(0(x1)))) -> 2(0(1(2(3(0(x1)))))) 0(2(5(4(x1)))) -> 2(2(4(5(0(x1))))) 0(2(5(4(x1)))) -> 4(5(1(2(0(x1))))) 0(4(1(0(x1)))) -> 0(0(1(1(4(x1))))) 0(5(5(4(x1)))) -> 2(4(5(5(1(0(x1)))))) 2(3(0(0(x1)))) -> 0(1(1(2(3(0(x1)))))) 2(3(0(0(x1)))) -> 0(1(2(1(3(0(x1)))))) 3(0(0(3(x1)))) -> 3(0(3(0(1(1(x1)))))) 3(0(2(0(x1)))) -> 0(3(0(1(2(1(x1)))))) 3(0(4(0(x1)))) -> 3(0(0(1(1(4(x1)))))) 3(0(5(0(x1)))) -> 5(0(3(0(1(1(x1)))))) 3(1(0(0(x1)))) -> 1(1(1(3(0(0(x1)))))) 3(1(0(4(x1)))) -> 1(1(1(3(4(0(x1)))))) 3(2(1(4(x1)))) -> 1(1(2(2(4(3(x1)))))) 3(2(1(4(x1)))) -> 1(2(1(3(1(4(x1)))))) 4(1(0(0(x1)))) -> 0(0(1(1(4(1(x1)))))) 4(1(0(4(x1)))) -> 4(0(1(1(4(x1))))) 5(1(0(3(x1)))) -> 5(3(0(1(1(1(x1)))))) 5(5(0(4(x1)))) -> 5(5(1(0(4(x1))))) 5(5(0(4(x1)))) -> 0(1(1(5(5(4(x1)))))) 5(5(4(3(x1)))) -> 3(4(5(5(1(x1))))) 0(1(4(3(3(x1))))) -> 0(1(1(4(3(3(x1)))))) 0(2(1(5(3(x1))))) -> 0(5(2(1(1(3(x1)))))) 0(2(5(2(3(x1))))) -> 0(3(5(2(1(2(x1)))))) 0(2(5(3(0(x1))))) -> 0(1(2(5(3(0(x1)))))) 2(5(1(0(4(x1))))) -> 5(0(1(1(4(2(x1)))))) 3(5(1(0(4(x1))))) -> 3(5(0(1(1(4(x1)))))) 4(0(1(0(3(x1))))) -> 4(0(3(0(1(1(x1)))))) 4(1(4(4(0(x1))))) -> 4(0(4(1(1(4(x1)))))) 4(2(3(5(4(x1))))) -> 2(2(4(4(5(3(x1)))))) 4(2(5(0(4(x1))))) -> 4(4(1(0(5(2(x1)))))) 4(4(5(0(0(x1))))) -> 4(4(0(1(5(0(x1)))))) Q is empty. ---------------------------------------- (1) QTRS Reverse (EQUIVALENT) popout

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

job log

popout

actions

all output return to SRS Standard