details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.1552 seconds
cpu usage	16.5681
user time	15.5503
system time	1.01773
max virtual memory	3.923382E7
max residence set size	2318684.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) QTRSRRRProof [EQUIVALENT, 73 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 8 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) QDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) QDP (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] (11) YES (12) QDP (13) MNOCProof [EQUIVALENT, 0 ms] (14) QDP (15) UsableRulesProof [EQUIVALENT, 0 ms] (16) QDP (17) QReductionProof [EQUIVALENT, 0 ms] (18) QDP (19) QDPOrderProof [EQUIVALENT, 48 ms] (20) QDP (21) DependencyGraphProof [EQUIVALENT, 0 ms] (22) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: i(0(x1)) -> p(s(p(s(0(p(s(p(s(x1))))))))) i(s(x1)) -> p(s(p(s(s(j(p(s(p(s(p(p(p(p(s(s(s(s(x1)))))))))))))))))) j(0(x1)) -> p(s(p(p(s(s(0(p(s(p(s(x1))))))))))) j(s(x1)) -> s(s(s(s(p(p(s(s(i(p(s(p(s(x1))))))))))))) p(p(s(x1))) -> p(x1) p(s(x1)) -> x1 p(0(x1)) -> 0(s(s(s(s(s(s(s(s(x1))))))))) Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(0(x_1)) = x_1 POL(i(x_1)) = 1 + x_1 POL(j(x_1)) = 1 + x_1 POL(p(x_1)) = x_1 POL(s(x_1)) = x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: i(0(x1)) -> p(s(p(s(0(p(s(p(s(x1))))))))) j(0(x1)) -> p(s(p(p(s(s(0(p(s(p(s(x1))))))))))) ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: i(s(x1)) -> p(s(p(s(s(j(p(s(p(s(p(p(p(p(s(s(s(s(x1)))))))))))))))))) j(s(x1)) -> s(s(s(s(p(p(s(s(i(p(s(p(s(x1))))))))))))) p(p(s(x1))) -> p(x1) p(s(x1)) -> x1 p(0(x1)) -> 0(s(s(s(s(s(s(s(s(x1))))))))) Q is empty. ---------------------------------------- (3) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (4) Obligation: Q DP problem: The TRS P consists of the following rules: I(s(x1)) -> P(s(p(s(s(j(p(s(p(s(p(p(p(p(s(s(s(s(x1)))))))))))))))))) I(s(x1)) -> P(s(s(j(p(s(p(s(p(p(p(p(s(s(s(s(x1)))))))))))))))) I(s(x1)) -> J(p(s(p(s(p(p(p(p(s(s(s(s(x1))))))))))))) I(s(x1)) -> P(s(p(s(p(p(p(p(s(s(s(s(x1)))))))))))) I(s(x1)) -> P(s(p(p(p(p(s(s(s(s(x1)))))))))) I(s(x1)) -> P(p(p(p(s(s(s(s(x1)))))))) popout

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

job log

popout

actions

all output return to SRS Standard