details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.25346589088 seconds
cpu usage	9.125307816
max memory	9.9794944E8

stage attributes

key	value
output-size	8547
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 65 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 24 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) QDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) QDP (10) QDPSizeChangeProof [EQUIVALENT, 3 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, 29 ms] (20) QDP (21) PisEmptyProof [EQUIVALENT, 0 ms] (22) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: q(0(x1)) -> p(p(s(s(0(s(s(s(s(x1))))))))) q(s(x1)) -> p(p(s(s(s(s(s(s(r(p(p(s(s(x1))))))))))))) r(0(x1)) -> p(s(p(s(0(p(p(p(s(s(s(x1))))))))))) r(s(x1)) -> p(s(p(s(s(q(p(s(p(s(x1)))))))))) p(p(s(x1))) -> p(x1) p(s(x1)) -> x1 p(0(x1)) -> 0(s(s(s(x1)))) Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(0(x_1)) = x_1 POL(p(x_1)) = x_1 POL(q(x_1)) = 1 + x_1 POL(r(x_1)) = 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: q(0(x1)) -> p(p(s(s(0(s(s(s(s(x1))))))))) r(0(x1)) -> p(s(p(s(0(p(p(p(s(s(s(x1))))))))))) ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: q(s(x1)) -> p(p(s(s(s(s(s(s(r(p(p(s(s(x1))))))))))))) r(s(x1)) -> p(s(p(s(s(q(p(s(p(s(x1)))))))))) p(p(s(x1))) -> p(x1) p(s(x1)) -> x1 p(0(x1)) -> 0(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: popout

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

job log

popout

actions

all output return to SRS Stand 10685