details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	9.92011404037 seconds
cpu usage	33.927876929
max memory	3.944013824E9

stage attributes

key	value
output-size	11973
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) QTRS Reverse [EQUIVALENT, 0 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 25 ms] (4) QTRS (5) DependencyPairsProof [EQUIVALENT, 26 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) AND (9) QDP (10) UsableRulesProof [EQUIVALENT, 0 ms] (11) QDP (12) QDPOrderProof [EQUIVALENT, 22 ms] (13) QDP (14) QDPOrderProof [EQUIVALENT, 0 ms] (15) QDP (16) QDPOrderProof [EQUIVALENT, 504 ms] (17) QDP (18) PisEmptyProof [EQUIVALENT, 0 ms] (19) YES (20) QDP (21) UsableRulesProof [EQUIVALENT, 0 ms] (22) QDP (23) QDPSizeChangeProof [EQUIVALENT, 0 ms] (24) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: log(s(x1)) -> s(log(half(s(x1)))) half(0(x1)) -> 0(s(s(half(x1)))) half(s(0(x1))) -> 0(x1) half(s(s(x1))) -> s(half(p(s(s(x1))))) half(half(s(s(s(s(x1)))))) -> s(s(half(half(x1)))) p(s(s(s(x1)))) -> s(p(s(s(x1)))) s(s(p(s(x1)))) -> s(s(x1)) 0(x1) -> x1 Q is empty. ---------------------------------------- (1) QTRS Reverse (EQUIVALENT) We applied the QTRS Reverse Processor [REVERSE]. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: s(log(x1)) -> s(half(log(s(x1)))) 0(half(x1)) -> half(s(s(0(x1)))) 0(s(half(x1))) -> 0(x1) s(s(half(x1))) -> s(s(p(half(s(x1))))) s(s(s(s(half(half(x1)))))) -> half(half(s(s(x1)))) s(s(s(p(x1)))) -> s(s(p(s(x1)))) s(p(s(s(x1)))) -> s(s(x1)) 0(x1) -> x1 Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(0(x_1)) = 1 + x_1 POL(half(x_1)) = x_1 POL(log(x_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: 0(x1) -> x1 ---------------------------------------- popout

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

job log

popout

actions

all output return to SRS Stand 10685