details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	10.3323 seconds
cpu usage	36.1623
user time	34.6705
system time	1.4918
max virtual memory	4.1974656E7
max residence set size	4312964.0

stage attributes

key	value
starexec-result	YES

output

35.42/9.97 YES 35.79/10.08 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 35.79/10.08 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 35.79/10.08 35.79/10.08 35.79/10.08 Termination w.r.t. Q of the given QTRS could be proven: 35.79/10.08 35.79/10.08 (0) QTRS 35.79/10.08 (1) QTRS Reverse [EQUIVALENT, 0 ms] 35.79/10.08 (2) QTRS 35.79/10.08 (3) QTRSRRRProof [EQUIVALENT, 31 ms] 35.79/10.08 (4) QTRS 35.79/10.08 (5) DependencyPairsProof [EQUIVALENT, 13 ms] 35.79/10.08 (6) QDP 35.79/10.08 (7) DependencyGraphProof [EQUIVALENT, 0 ms] 35.79/10.08 (8) AND 35.79/10.08 (9) QDP 35.79/10.08 (10) UsableRulesProof [EQUIVALENT, 0 ms] 35.79/10.08 (11) QDP 35.79/10.08 (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] 35.79/10.08 (13) YES 35.79/10.08 (14) QDP 35.79/10.08 (15) UsableRulesProof [EQUIVALENT, 0 ms] 35.79/10.08 (16) QDP 35.79/10.08 (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] 35.79/10.08 (18) YES 35.79/10.08 (19) QDP 35.79/10.08 (20) UsableRulesProof [EQUIVALENT, 0 ms] 35.79/10.08 (21) QDP 35.79/10.08 (22) QDPOrderProof [EQUIVALENT, 90 ms] 35.79/10.08 (23) QDP 35.79/10.08 (24) UsableRulesProof [EQUIVALENT, 0 ms] 35.79/10.08 (25) QDP 35.79/10.08 (26) QDPSizeChangeProof [EQUIVALENT, 0 ms] 35.79/10.08 (27) YES 35.79/10.08 35.79/10.08 35.79/10.08 ---------------------------------------- 35.79/10.08 35.79/10.08 (0) 35.79/10.08 Obligation: 35.79/10.08 Q restricted rewrite system: 35.79/10.08 The TRS R consists of the following rules: 35.79/10.08 35.79/10.08 g(h(x1)) -> g(f(s(x1))) 35.79/10.08 f(s(s(s(x1)))) -> h(f(s(h(x1)))) 35.79/10.08 f(h(x1)) -> h(f(s(h(x1)))) 35.79/10.08 h(x1) -> x1 35.79/10.08 f(f(s(s(x1)))) -> s(s(s(f(f(x1))))) 35.79/10.08 b(a(x1)) -> a(b(x1)) 35.79/10.08 a(a(a(x1))) -> b(a(a(b(x1)))) 35.79/10.08 b(b(b(b(x1)))) -> a(x1) 35.79/10.08 35.79/10.08 Q is empty. 35.79/10.08 35.79/10.08 ---------------------------------------- 35.79/10.08 35.79/10.08 (1) QTRS Reverse (EQUIVALENT) 35.79/10.08 We applied the QTRS Reverse Processor [REVERSE]. 35.79/10.08 ---------------------------------------- 35.79/10.08 35.79/10.08 (2) 35.79/10.08 Obligation: 35.79/10.08 Q restricted rewrite system: 35.79/10.08 The TRS R consists of the following rules: 35.79/10.08 35.79/10.08 h(g(x1)) -> s(f(g(x1))) 35.79/10.08 s(s(s(f(x1)))) -> h(s(f(h(x1)))) 35.79/10.08 h(f(x1)) -> h(s(f(h(x1)))) 35.79/10.08 h(x1) -> x1 35.79/10.08 s(s(f(f(x1)))) -> f(f(s(s(s(x1))))) 35.79/10.08 a(b(x1)) -> b(a(x1)) 35.79/10.08 a(a(a(x1))) -> b(a(a(b(x1)))) 35.79/10.08 b(b(b(b(x1)))) -> a(x1) 35.79/10.08 35.79/10.08 Q is empty. 35.79/10.08 35.79/10.08 ---------------------------------------- 35.79/10.08 35.79/10.08 (3) QTRSRRRProof (EQUIVALENT) 35.79/10.08 Used ordering: 35.79/10.08 Polynomial interpretation [POLO]: 35.79/10.08 35.79/10.08 POL(a(x_1)) = 3 + x_1 35.79/10.08 POL(b(x_1)) = 1 + x_1 35.79/10.08 POL(f(x_1)) = x_1 35.79/10.08 POL(g(x_1)) = x_1 35.79/10.08 POL(h(x_1)) = x_1 35.79/10.08 POL(s(x_1)) = x_1 35.79/10.08 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: 35.79/10.08 35.79/10.08 a(a(a(x1))) -> b(a(a(b(x1)))) 35.79/10.08 b(b(b(b(x1)))) -> a(x1) 35.79/10.08 35.79/10.08 35.79/10.08 35.79/10.08 35.79/10.08 ---------------------------------------- 35.79/10.08 35.79/10.08 (4) 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