details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.88528490067 seconds
cpu usage	15.760427063
max memory	2.44256768E9

stage attributes

key	value
output-size	5174
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/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, 39 ms] (2) QTRS (3) Overlay + Local Confluence [EQUIVALENT, 1 ms] (4) QTRS (5) DependencyPairsProof [EQUIVALENT, 13 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) QDP (9) UsableRulesProof [EQUIVALENT, 0 ms] (10) QDP (11) QReductionProof [EQUIVALENT, 0 ms] (12) QDP (13) MRRProof [EQUIVALENT, 6 ms] (14) QDP (15) DependencyGraphProof [EQUIVALENT, 0 ms] (16) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(s(x1)) -> s(s(f(p(s(x1))))) f(0(x1)) -> 0(x1) p(s(x1)) -> x1 Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(0(x_1)) = x_1 POL(f(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: f(0(x1)) -> 0(x1) ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(s(x1)) -> s(s(f(p(s(x1))))) p(s(x1)) -> x1 Q is empty. ---------------------------------------- (3) Overlay + Local Confluence (EQUIVALENT) The TRS is overlay and locally confluent. By [NOC] we can switch to innermost. ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(s(x1)) -> s(s(f(p(s(x1))))) p(s(x1)) -> x1 The set Q consists of the following terms: f(s(x0)) p(s(x0)) ---------------------------------------- (5) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- popout

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

job log

popout

actions

all output return to SRS Stand 10685