details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	11.5827 seconds
cpu usage	29.6045
user time	28.4233
system time	1.18117
max virtual memory	2.0639812E7
max residence set size	3226872.0

stage attributes

key	value
starexec-result	YES

output

28.51/8.30 YES 29.42/11.54 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 29.42/11.54 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 29.42/11.54 29.42/11.54 29.42/11.54 Termination w.r.t. Q of the given QTRS could be proven: 29.42/11.54 29.42/11.54 (0) QTRS 29.42/11.54 (1) QTRS Reverse [EQUIVALENT, 0 ms] 29.42/11.54 (2) QTRS 29.42/11.54 (3) QTRSRRRProof [EQUIVALENT, 27 ms] 29.42/11.54 (4) QTRS 29.42/11.54 (5) Overlay + Local Confluence [EQUIVALENT, 1 ms] 29.42/11.54 (6) QTRS 29.42/11.54 (7) DependencyPairsProof [EQUIVALENT, 2 ms] 29.42/11.54 (8) QDP 29.42/11.54 (9) UsableRulesProof [EQUIVALENT, 1 ms] 29.42/11.54 (10) QDP 29.42/11.54 (11) QReductionProof [EQUIVALENT, 0 ms] 29.42/11.54 (12) QDP 29.42/11.54 (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] 29.42/11.54 (14) YES 29.42/11.54 29.42/11.54 29.42/11.54 ---------------------------------------- 29.42/11.54 29.42/11.54 (0) 29.42/11.54 Obligation: 29.42/11.54 Q restricted rewrite system: 29.42/11.54 The TRS R consists of the following rules: 29.42/11.54 29.42/11.54 b(c(x1)) -> a(x1) 29.42/11.54 b(b(x1)) -> a(c(x1)) 29.42/11.54 a(x1) -> c(b(x1)) 29.42/11.54 c(c(c(x1))) -> b(x1) 29.42/11.54 29.42/11.54 Q is empty. 29.42/11.54 29.42/11.54 ---------------------------------------- 29.42/11.54 29.42/11.54 (1) QTRS Reverse (EQUIVALENT) 29.42/11.54 We applied the QTRS Reverse Processor [REVERSE]. 29.42/11.54 ---------------------------------------- 29.42/11.54 29.42/11.54 (2) 29.42/11.54 Obligation: 29.42/11.54 Q restricted rewrite system: 29.42/11.54 The TRS R consists of the following rules: 29.42/11.54 29.42/11.54 c(b(x1)) -> a(x1) 29.42/11.54 b(b(x1)) -> c(a(x1)) 29.42/11.54 a(x1) -> b(c(x1)) 29.42/11.54 c(c(c(x1))) -> b(x1) 29.42/11.54 29.42/11.54 Q is empty. 29.42/11.54 29.42/11.54 ---------------------------------------- 29.42/11.54 29.42/11.54 (3) QTRSRRRProof (EQUIVALENT) 29.42/11.54 Used ordering: 29.42/11.54 Polynomial interpretation [POLO]: 29.42/11.54 29.42/11.54 POL(a(x_1)) = 7 + x_1 29.42/11.54 POL(b(x_1)) = 5 + x_1 29.42/11.54 POL(c(x_1)) = 2 + x_1 29.42/11.54 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: 29.42/11.54 29.42/11.54 b(b(x1)) -> c(a(x1)) 29.42/11.54 c(c(c(x1))) -> b(x1) 29.42/11.54 29.42/11.54 29.42/11.54 29.42/11.54 29.42/11.54 ---------------------------------------- 29.42/11.54 29.42/11.54 (4) 29.42/11.54 Obligation: 29.42/11.54 Q restricted rewrite system: 29.42/11.54 The TRS R consists of the following rules: 29.42/11.54 29.42/11.54 c(b(x1)) -> a(x1) 29.42/11.54 a(x1) -> b(c(x1)) 29.42/11.54 29.42/11.54 Q is empty. 29.42/11.54 29.42/11.54 ---------------------------------------- 29.42/11.54 29.42/11.54 (5) Overlay + Local Confluence (EQUIVALENT) 29.42/11.54 The TRS is overlay and locally confluent. By [NOC] we can switch to innermost. 29.42/11.54 ---------------------------------------- 29.42/11.54 29.42/11.54 (6) 29.42/11.54 Obligation: 29.42/11.54 Q restricted rewrite system: 29.42/11.54 The TRS R consists of the following rules: 29.42/11.54 29.42/11.54 c(b(x1)) -> a(x1) 29.42/11.54 a(x1) -> b(c(x1)) 29.42/11.54 29.42/11.54 The set Q consists of the following terms: 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