details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.58337903023 seconds
cpu usage	18.941068643
max memory	2.500943872E9

stage attributes

key	value
output-size	14947
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 79 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 45 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) UsableRulesProof [EQUIVALENT, 0 ms] (14) QDP (15) MNOCProof [EQUIVALENT, 0 ms] (16) QDP (17) UsableRulesProof [EQUIVALENT, 0 ms] (18) QDP (19) QDPOrderProof [EQUIVALENT, 22 ms] (20) QDP (21) PisEmptyProof [EQUIVALENT, 0 ms] (22) YES (23) QDP (24) UsableRulesProof [EQUIVALENT, 0 ms] (25) QDP (26) MNOCProof [EQUIVALENT, 0 ms] (27) QDP (28) UsableRulesProof [EQUIVALENT, 0 ms] (29) QDP (30) QDPOrderProof [EQUIVALENT, 36 ms] (31) QDP (32) PisEmptyProof [EQUIVALENT, 0 ms] (33) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: thrice(0(x1)) -> p(s(p(p(p(s(s(s(0(p(s(p(s(x1))))))))))))) thrice(s(x1)) -> p(p(s(s(half(p(p(s(s(p(s(sixtimes(p(s(p(p(s(s(x1)))))))))))))))))) half(0(x1)) -> p(p(s(s(p(s(0(p(s(s(s(s(x1)))))))))))) half(s(x1)) -> p(s(p(p(s(s(p(p(s(s(half(p(p(s(s(p(s(x1))))))))))))))))) half(s(s(x1))) -> p(s(p(s(s(p(p(s(s(half(p(p(s(s(p(s(x1)))))))))))))))) sixtimes(0(x1)) -> p(s(p(s(0(s(s(s(s(s(p(s(p(s(x1)))))))))))))) sixtimes(s(x1)) -> p(p(s(s(s(s(s(s(s(p(p(s(p(s(s(s(sixtimes(p(s(p(p(p(s(s(s(x1))))))))))))))))))))))))) p(p(s(x1))) -> p(x1) p(s(x1)) -> x1 p(0(x1)) -> 0(s(s(s(s(x1))))) 0(x1) -> x1 Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(0(x_1)) = 1 + x_1 POL(half(x_1)) = 1 + x_1 POL(p(x_1)) = x_1 POL(s(x_1)) = x_1 POL(sixtimes(x_1)) = 1 + x_1 POL(thrice(x_1)) = 3 + x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: thrice(0(x1)) -> p(s(p(p(p(s(s(s(0(p(s(p(s(x1))))))))))))) thrice(s(x1)) -> p(p(s(s(half(p(p(s(s(p(s(sixtimes(p(s(p(p(s(s(x1)))))))))))))))))) half(0(x1)) -> p(p(s(s(p(s(0(p(s(s(s(s(x1)))))))))))) sixtimes(0(x1)) -> p(s(p(s(0(s(s(s(s(s(p(s(p(s(x1)))))))))))))) 0(x1) -> x1 ---------------------------------------- (2) Obligation: Q restricted rewrite system: 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