details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.27808213234 seconds
cpu usage	6.389338197
max memory	4.9094656E8

stage attributes

key	value
output-size	16087
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 Outermost Termination of the given OTRS could be proven: (0) OTRS (1) Raffelsieper-Zantema-Transformation [SOUND, 0 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 25 ms] (4) QTRS (5) AAECC Innermost [EQUIVALENT, 0 ms] (6) QTRS (7) DependencyPairsProof [EQUIVALENT, 0 ms] (8) QDP (9) DependencyGraphProof [EQUIVALENT, 0 ms] (10) AND (11) QDP (12) UsableRulesProof [EQUIVALENT, 0 ms] (13) QDP (14) QReductionProof [EQUIVALENT, 0 ms] (15) QDP (16) QDPSizeChangeProof [EQUIVALENT, 0 ms] (17) YES (18) QDP (19) UsableRulesProof [EQUIVALENT, 0 ms] (20) QDP (21) QReductionProof [EQUIVALENT, 0 ms] (22) QDP (23) QDPSizeChangeProof [EQUIVALENT, 0 ms] (24) YES (25) QDP (26) UsableRulesProof [EQUIVALENT, 0 ms] (27) QDP (28) QReductionProof [EQUIVALENT, 0 ms] (29) QDP (30) QDPOrderProof [EQUIVALENT, 38 ms] (31) QDP (32) PisEmptyProof [EQUIVALENT, 0 ms] (33) YES ---------------------------------------- (0) Obligation: Term rewrite system R: The TRS R consists of the following rules: f(h(x)) -> f(i(x)) f(i(x)) -> a i(x) -> h(x) Outermost Strategy. ---------------------------------------- (1) Raffelsieper-Zantema-Transformation (SOUND) We applied the Raffelsieper-Zantema transformation to transform the outermost TRS to a standard TRS. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: down(f(h(x))) -> up(f(i(x))) down(f(i(x))) -> up(a) down(i(x)) -> up(h(x)) top(up(x)) -> top(down(x)) down(h(y1)) -> h_flat(down(y1)) down(f(f(y4))) -> f_flat(down(f(y4))) down(f(a)) -> f_flat(down(a)) down(f(fresh_constant)) -> f_flat(down(fresh_constant)) f_flat(up(x_1)) -> up(f(x_1)) h_flat(up(x_1)) -> up(h(x_1)) i_flat(up(x_1)) -> up(i(x_1)) Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(a) = 0 POL(down(x_1)) = 2 + 2*x_1 POL(f(x_1)) = 2 + 2*x_1 POL(f_flat(x_1)) = 2 + 2*x_1 POL(fresh_constant) = 1 popout

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

job log

popout

actions

all output return to TRS Outer 67415