details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	14.4323 seconds
cpu usage	51.9912
user time	49.7483
system time	2.24285
max virtual memory	2.0004212E7
max residence set size	4621028.0

stage attributes

key	value
starexec-result	YES

output

51.30/14.22 YES 51.70/14.27 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 51.70/14.27 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 51.70/14.27 51.70/14.27 51.70/14.27 Termination w.r.t. Q of the given QTRS could be proven: 51.70/14.27 51.70/14.27 (0) QTRS 51.70/14.27 (1) FlatCCProof [EQUIVALENT, 0 ms] 51.70/14.27 (2) QTRS 51.70/14.27 (3) RootLabelingProof [EQUIVALENT, 22 ms] 51.70/14.27 (4) QTRS 51.70/14.27 (5) QTRSRRRProof [EQUIVALENT, 2432 ms] 51.70/14.27 (6) QTRS 51.70/14.27 (7) QTRSRRRProof [EQUIVALENT, 29 ms] 51.70/14.27 (8) QTRS 51.70/14.27 (9) QTRSRRRProof [EQUIVALENT, 4 ms] 51.70/14.27 (10) QTRS 51.70/14.27 (11) QTRSRRRProof [EQUIVALENT, 6 ms] 51.70/14.27 (12) QTRS 51.70/14.27 (13) QTRSRRRProof [EQUIVALENT, 6 ms] 51.70/14.27 (14) QTRS 51.70/14.27 (15) RisEmptyProof [EQUIVALENT, 0 ms] 51.70/14.27 (16) YES 51.70/14.27 51.70/14.27 51.70/14.27 ---------------------------------------- 51.70/14.27 51.70/14.27 (0) 51.70/14.27 Obligation: 51.70/14.27 Q restricted rewrite system: 51.70/14.27 The TRS R consists of the following rules: 51.70/14.27 51.70/14.27 2(5(3(0(x1)))) -> 1(0(0(1(3(0(4(5(1(2(x1)))))))))) 51.70/14.27 1(3(5(4(3(x1))))) -> 2(1(4(1(4(0(3(0(1(1(x1)))))))))) 51.70/14.27 5(1(3(5(0(x1))))) -> 5(1(4(3(0(4(4(5(2(1(x1)))))))))) 51.70/14.27 5(4(4(2(5(x1))))) -> 4(3(1(1(1(1(5(3(3(5(x1)))))))))) 51.70/14.27 2(2(5(0(5(4(x1)))))) -> 2(1(4(1(3(3(2(2(5(4(x1)))))))))) 51.70/14.27 3(0(5(5(4(3(x1)))))) -> 3(3(0(3(2(3(5(5(1(0(x1)))))))))) 51.70/14.27 3(5(4(3(5(2(x1)))))) -> 2(0(5(2(0(5(2(2(3(2(x1)))))))))) 51.70/14.27 4(4(2(5(5(0(x1)))))) -> 4(4(0(0(3(3(3(2(2(3(x1)))))))))) 51.70/14.27 4(5(3(5(5(0(x1)))))) -> 4(2(2(3(0(2(4(1(1(5(x1)))))))))) 51.70/14.27 5(4(5(1(1(2(x1)))))) -> 5(4(0(3(3(3(3(2(5(5(x1)))))))))) 51.70/14.27 5(5(5(5(5(3(x1)))))) -> 5(5(0(1(4(0(0(5(0(1(x1)))))))))) 51.70/14.27 3(5(0(0(5(4(3(x1))))))) -> 0(1(2(1(1(5(5(2(1(0(x1)))))))))) 51.70/14.27 3(5(4(2(5(2(3(x1))))))) -> 4(0(4(0(0(2(2(3(4(4(x1)))))))))) 51.70/14.27 3(5(4(5(1(4(0(x1))))))) -> 1(1(1(0(0(3(3(1(2(5(x1)))))))))) 51.70/14.27 51.70/14.27 Q is empty. 51.70/14.27 51.70/14.27 ---------------------------------------- 51.70/14.27 51.70/14.27 (1) FlatCCProof (EQUIVALENT) 51.70/14.27 We used flat context closure [ROOTLAB] 51.70/14.27 As Q is empty the flat context closure was sound AND complete. 51.70/14.27 51.70/14.27 ---------------------------------------- 51.70/14.27 51.70/14.27 (2) 51.70/14.27 Obligation: 51.70/14.27 Q restricted rewrite system: 51.70/14.27 The TRS R consists of the following rules: 51.70/14.27 51.70/14.27 5(1(3(5(0(x1))))) -> 5(1(4(3(0(4(4(5(2(1(x1)))))))))) 51.70/14.27 2(2(5(0(5(4(x1)))))) -> 2(1(4(1(3(3(2(2(5(4(x1)))))))))) 51.70/14.27 3(0(5(5(4(3(x1)))))) -> 3(3(0(3(2(3(5(5(1(0(x1)))))))))) 51.70/14.27 4(4(2(5(5(0(x1)))))) -> 4(4(0(0(3(3(3(2(2(3(x1)))))))))) 51.70/14.27 4(5(3(5(5(0(x1)))))) -> 4(2(2(3(0(2(4(1(1(5(x1)))))))))) 51.70/14.27 5(4(5(1(1(2(x1)))))) -> 5(4(0(3(3(3(3(2(5(5(x1)))))))))) 51.70/14.27 5(5(5(5(5(3(x1)))))) -> 5(5(0(1(4(0(0(5(0(1(x1)))))))))) 51.70/14.27 2(2(5(3(0(x1))))) -> 2(1(0(0(1(3(0(4(5(1(2(x1))))))))))) 51.70/14.27 5(2(5(3(0(x1))))) -> 5(1(0(0(1(3(0(4(5(1(2(x1))))))))))) 51.70/14.27 3(2(5(3(0(x1))))) -> 3(1(0(0(1(3(0(4(5(1(2(x1))))))))))) 51.70/14.27 0(2(5(3(0(x1))))) -> 0(1(0(0(1(3(0(4(5(1(2(x1))))))))))) 51.70/14.27 1(2(5(3(0(x1))))) -> 1(1(0(0(1(3(0(4(5(1(2(x1))))))))))) 51.70/14.27 4(2(5(3(0(x1))))) -> 4(1(0(0(1(3(0(4(5(1(2(x1))))))))))) 51.70/14.27 2(1(3(5(4(3(x1)))))) -> 2(2(1(4(1(4(0(3(0(1(1(x1))))))))))) 51.70/14.27 5(1(3(5(4(3(x1)))))) -> 5(2(1(4(1(4(0(3(0(1(1(x1))))))))))) 51.70/14.27 3(1(3(5(4(3(x1)))))) -> 3(2(1(4(1(4(0(3(0(1(1(x1))))))))))) 51.70/14.27 0(1(3(5(4(3(x1)))))) -> 0(2(1(4(1(4(0(3(0(1(1(x1))))))))))) 51.70/14.27 1(1(3(5(4(3(x1)))))) -> 1(2(1(4(1(4(0(3(0(1(1(x1))))))))))) 51.70/14.27 4(1(3(5(4(3(x1)))))) -> 4(2(1(4(1(4(0(3(0(1(1(x1))))))))))) 51.70/14.27 2(5(4(4(2(5(x1)))))) -> 2(4(3(1(1(1(1(5(3(3(5(x1))))))))))) 51.70/14.27 5(5(4(4(2(5(x1)))))) -> 5(4(3(1(1(1(1(5(3(3(5(x1))))))))))) 51.70/14.27 3(5(4(4(2(5(x1)))))) -> 3(4(3(1(1(1(1(5(3(3(5(x1))))))))))) 51.70/14.27 0(5(4(4(2(5(x1)))))) -> 0(4(3(1(1(1(1(5(3(3(5(x1))))))))))) 51.70/14.27 1(5(4(4(2(5(x1)))))) -> 1(4(3(1(1(1(1(5(3(3(5(x1))))))))))) 51.70/14.27 4(5(4(4(2(5(x1)))))) -> 4(4(3(1(1(1(1(5(3(3(5(x1))))))))))) 51.70/14.27 2(3(5(4(3(5(2(x1))))))) -> 2(2(0(5(2(0(5(2(2(3(2(x1))))))))))) 51.70/14.27 5(3(5(4(3(5(2(x1))))))) -> 5(2(0(5(2(0(5(2(2(3(2(x1))))))))))) 51.70/14.27 3(3(5(4(3(5(2(x1))))))) -> 3(2(0(5(2(0(5(2(2(3(2(x1))))))))))) 51.70/14.27 0(3(5(4(3(5(2(x1))))))) -> 0(2(0(5(2(0(5(2(2(3(2(x1))))))))))) 51.70/14.27 1(3(5(4(3(5(2(x1))))))) -> 1(2(0(5(2(0(5(2(2(3(2(x1))))))))))) 51.70/14.27 4(3(5(4(3(5(2(x1))))))) -> 4(2(0(5(2(0(5(2(2(3(2(x1))))))))))) 51.70/14.27 2(3(5(0(0(5(4(3(x1)))))))) -> 2(0(1(2(1(1(5(5(2(1(0(x1))))))))))) 51.70/14.27 5(3(5(0(0(5(4(3(x1)))))))) -> 5(0(1(2(1(1(5(5(2(1(0(x1))))))))))) 51.70/14.27 3(3(5(0(0(5(4(3(x1)))))))) -> 3(0(1(2(1(1(5(5(2(1(0(x1))))))))))) 51.70/14.27 0(3(5(0(0(5(4(3(x1)))))))) -> 0(0(1(2(1(1(5(5(2(1(0(x1))))))))))) 51.70/14.27 1(3(5(0(0(5(4(3(x1)))))))) -> 1(0(1(2(1(1(5(5(2(1(0(x1))))))))))) 51.70/14.27 4(3(5(0(0(5(4(3(x1)))))))) -> 4(0(1(2(1(1(5(5(2(1(0(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