details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	8.09737 seconds
cpu usage	28.2781
user time	26.8929
system time	1.38518
max virtual memory	6.2796452E7
max residence set size	3867180.0

stage attributes

key	value
starexec-result	YES

output

27.32/7.95 YES 27.96/7.99 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 27.96/7.99 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 27.96/7.99 27.96/7.99 27.96/7.99 Termination w.r.t. Q of the given QTRS could be proven: 27.96/7.99 27.96/7.99 (0) QTRS 27.96/7.99 (1) QTRS Reverse [EQUIVALENT, 0 ms] 27.96/7.99 (2) QTRS 27.96/7.99 (3) Overlay + Local Confluence [EQUIVALENT, 11 ms] 27.96/7.99 (4) QTRS 27.96/7.99 (5) DependencyPairsProof [EQUIVALENT, 23 ms] 27.96/7.99 (6) QDP 27.96/7.99 (7) DependencyGraphProof [EQUIVALENT, 3 ms] 27.96/7.99 (8) AND 27.96/7.99 (9) QDP 27.96/7.99 (10) UsableRulesProof [EQUIVALENT, 0 ms] 27.96/7.99 (11) QDP 27.96/7.99 (12) QReductionProof [EQUIVALENT, 0 ms] 27.96/7.99 (13) QDP 27.96/7.99 (14) QDPOrderProof [EQUIVALENT, 59 ms] 27.96/7.99 (15) QDP 27.96/7.99 (16) QDPOrderProof [EQUIVALENT, 33 ms] 27.96/7.99 (17) QDP 27.96/7.99 (18) DependencyGraphProof [EQUIVALENT, 0 ms] 27.96/7.99 (19) QDP 27.96/7.99 (20) UsableRulesProof [EQUIVALENT, 0 ms] 27.96/7.99 (21) QDP 27.96/7.99 (22) QReductionProof [EQUIVALENT, 0 ms] 27.96/7.99 (23) QDP 27.96/7.99 (24) QDPOrderProof [EQUIVALENT, 0 ms] 27.96/7.99 (25) QDP 27.96/7.99 (26) DependencyGraphProof [EQUIVALENT, 0 ms] 27.96/7.99 (27) TRUE 27.96/7.99 (28) QDP 27.96/7.99 (29) UsableRulesProof [EQUIVALENT, 0 ms] 27.96/7.99 (30) QDP 27.96/7.99 (31) QReductionProof [EQUIVALENT, 0 ms] 27.96/7.99 (32) QDP 27.96/7.99 (33) QDPOrderProof [EQUIVALENT, 76 ms] 27.96/7.99 (34) QDP 27.96/7.99 (35) UsableRulesProof [EQUIVALENT, 0 ms] 27.96/7.99 (36) QDP 27.96/7.99 (37) QReductionProof [EQUIVALENT, 0 ms] 27.96/7.99 (38) QDP 27.96/7.99 (39) QDPSizeChangeProof [EQUIVALENT, 0 ms] 27.96/7.99 (40) YES 27.96/7.99 27.96/7.99 27.96/7.99 ---------------------------------------- 27.96/7.99 27.96/7.99 (0) 27.96/7.99 Obligation: 27.96/7.99 Q restricted rewrite system: 27.96/7.99 The TRS R consists of the following rules: 27.96/7.99 27.96/7.99 p(0(x1)) -> s(s(0(s(s(p(x1)))))) 27.96/7.99 p(s(0(x1))) -> 0(x1) 27.96/7.99 p(s(s(x1))) -> s(p(s(x1))) 27.96/7.99 f(s(x1)) -> g(q(i(x1))) 27.96/7.99 g(x1) -> f(p(p(x1))) 27.96/7.99 q(i(x1)) -> q(s(x1)) 27.96/7.99 q(s(x1)) -> s(s(x1)) 27.96/7.99 i(x1) -> s(x1) 27.96/7.99 27.96/7.99 Q is empty. 27.96/7.99 27.96/7.99 ---------------------------------------- 27.96/7.99 27.96/7.99 (1) QTRS Reverse (EQUIVALENT) 27.96/7.99 We applied the QTRS Reverse Processor [REVERSE]. 27.96/7.99 ---------------------------------------- 27.96/7.99 27.96/7.99 (2) 27.96/7.99 Obligation: 27.96/7.99 Q restricted rewrite system: 27.96/7.99 The TRS R consists of the following rules: 27.96/7.99 27.96/7.99 0(p(x1)) -> p(s(s(0(s(s(x1)))))) 27.96/7.99 0(s(p(x1))) -> 0(x1) 27.96/7.99 s(s(p(x1))) -> s(p(s(x1))) 27.96/7.99 s(f(x1)) -> i(q(g(x1))) 27.96/7.99 g(x1) -> p(p(f(x1))) 27.96/7.99 i(q(x1)) -> s(q(x1)) 27.96/7.99 s(q(x1)) -> s(s(x1)) 27.96/7.99 i(x1) -> s(x1) 27.96/7.99 27.96/7.99 Q is empty. 27.96/7.99 27.96/7.99 ---------------------------------------- 27.96/7.99 27.96/7.99 (3) Overlay + Local Confluence (EQUIVALENT) 27.96/7.99 The TRS is overlay and locally confluent. By [NOC] we can switch to innermost. 27.96/7.99 ---------------------------------------- 27.96/7.99 27.96/7.99 (4) 27.96/7.99 Obligation: 27.96/7.99 Q restricted rewrite system: 27.96/7.99 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 2019-03-29 03.29