details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	8.3138 seconds
cpu usage	28.8954
user time	27.5489
system time	1.34652
max virtual memory	2.0155412E7
max residence set size	3740616.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, 11 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 1475 ms] (8) QTRS (9) QTRSRRRProof [EQUIVALENT, 14 ms] (10) QTRS (11) QTRSRRRProof [EQUIVALENT, 2 ms] (12) QTRS (13) QTRSRRRProof [EQUIVALENT, 0 ms] (14) QTRS (15) RisEmptyProof [EQUIVALENT, 0 ms] (16) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 1(4(x1)) -> 3(1(1(2(2(4(x1)))))) 5(4(x1)) -> 4(2(3(1(1(1(x1)))))) 0(3(0(x1))) -> 2(1(1(0(2(0(x1)))))) 0(5(5(x1))) -> 1(0(1(3(4(2(x1)))))) 1(5(4(x1))) -> 0(2(5(2(0(4(x1)))))) 3(5(4(x1))) -> 4(1(3(4(2(3(x1)))))) 4(1(4(x1))) -> 3(3(2(2(3(1(x1)))))) 5(4(0(x1))) -> 2(4(0(4(4(0(x1)))))) 5(4(0(x1))) -> 5(1(5(2(1(0(x1)))))) 5(4(4(x1))) -> 4(1(1(3(2(4(x1)))))) 5(5(4(x1))) -> 3(4(4(1(2(2(x1)))))) 0(5(5(0(x1)))) -> 0(2(0(0(3(0(x1)))))) 0(5(5(4(x1)))) -> 0(1(3(4(3(4(x1)))))) 1(4(5(4(x1)))) -> 0(4(5(0(2(1(x1)))))) 1(4(5(5(x1)))) -> 0(0(1(3(4(1(x1)))))) 2(5(4(0(x1)))) -> 0(4(1(2(4(0(x1)))))) 4(3(0(5(x1)))) -> 3(3(2(3(5(5(x1)))))) 5(4(0(0(x1)))) -> 1(0(4(0(2(2(x1)))))) 5(4(0(2(x1)))) -> 3(0(4(5(0(2(x1)))))) Q is empty. ---------------------------------------- (1) QTRS Reverse (EQUIVALENT) We applied the QTRS Reverse Processor [REVERSE]. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 4(1(x1)) -> 4(2(2(1(1(3(x1)))))) 4(5(x1)) -> 1(1(1(3(2(4(x1)))))) 0(3(0(x1))) -> 0(2(0(1(1(2(x1)))))) 5(5(0(x1))) -> 2(4(3(1(0(1(x1)))))) 4(5(1(x1))) -> 4(0(2(5(2(0(x1)))))) 4(5(3(x1))) -> 3(2(4(3(1(4(x1)))))) 4(1(4(x1))) -> 1(3(2(2(3(3(x1)))))) 0(4(5(x1))) -> 0(4(4(0(4(2(x1)))))) 0(4(5(x1))) -> 0(1(2(5(1(5(x1)))))) 4(4(5(x1))) -> 4(2(3(1(1(4(x1)))))) 4(5(5(x1))) -> 2(2(1(4(4(3(x1)))))) 0(5(5(0(x1)))) -> 0(3(0(0(2(0(x1)))))) 4(5(5(0(x1)))) -> 4(3(4(3(1(0(x1)))))) 4(5(4(1(x1)))) -> 1(2(0(5(4(0(x1)))))) 5(5(4(1(x1)))) -> 1(4(3(1(0(0(x1)))))) 0(4(5(2(x1)))) -> 0(4(2(1(4(0(x1)))))) 5(0(3(4(x1)))) -> 5(5(3(2(3(3(x1)))))) 0(0(4(5(x1)))) -> 2(2(0(4(0(1(x1)))))) 2(0(4(5(x1)))) -> 2(0(5(4(0(3(x1)))))) Q is empty. ---------------------------------------- (3) FlatCCProof (EQUIVALENT) We used flat context closure [ROOTLAB] As Q is empty the flat context closure was sound AND complete. ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: popout

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

job log

popout

actions

all output return to SRS Standard