details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.65105605125 seconds
cpu usage	4.35449598
max memory	3.37608704E8

stage attributes

key	value
output-size	20653
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 Outermost Termination of the given OTRS could be proven: (0) OTRS (1) Raffelsieper-Zantema-Transformation [SOUND, 0 ms] (2) QTRS (3) AAECC Innermost [EQUIVALENT, 2 ms] (4) QTRS (5) DependencyPairsProof [EQUIVALENT, 0 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) RFCMatchBoundsDPProof [EQUIVALENT, 23 ms] (14) YES ---------------------------------------- (0) Obligation: Term rewrite system R: The TRS R consists of the following rules: a -> f(a) f(f(f(f(f(x))))) -> b 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(a) -> up(f(a)) down(f(f(f(f(f(x)))))) -> up(b) top(up(x)) -> top(down(x)) down(f(a)) -> f_flat(down(a)) down(f(b)) -> f_flat(down(b)) down(f(fresh_constant)) -> f_flat(down(fresh_constant)) down(f(f(a))) -> f_flat(down(f(a))) down(f(f(b))) -> f_flat(down(f(b))) down(f(f(fresh_constant))) -> f_flat(down(f(fresh_constant))) down(f(f(f(a)))) -> f_flat(down(f(f(a)))) down(f(f(f(b)))) -> f_flat(down(f(f(b)))) down(f(f(f(fresh_constant)))) -> f_flat(down(f(f(fresh_constant)))) down(f(f(f(f(a))))) -> f_flat(down(f(f(f(a))))) down(f(f(f(f(b))))) -> f_flat(down(f(f(f(b))))) down(f(f(f(f(fresh_constant))))) -> f_flat(down(f(f(f(fresh_constant))))) f_flat(up(x_1)) -> up(f(x_1)) Q is empty. ---------------------------------------- (3) AAECC Innermost (EQUIVALENT) We have applied [NOC,AAECCNOC] to switch to innermost. The TRS R 1 is down(f(a)) -> f_flat(down(a)) down(f(b)) -> f_flat(down(b)) down(f(fresh_constant)) -> f_flat(down(fresh_constant)) down(f(f(a))) -> f_flat(down(f(a))) down(f(f(b))) -> f_flat(down(f(b))) down(f(f(fresh_constant))) -> f_flat(down(f(fresh_constant))) down(f(f(f(a)))) -> f_flat(down(f(f(a)))) down(f(f(f(b)))) -> f_flat(down(f(f(b)))) down(f(f(f(fresh_constant)))) -> f_flat(down(f(f(fresh_constant)))) down(f(f(f(f(a))))) -> f_flat(down(f(f(f(a))))) down(f(f(f(f(b))))) -> f_flat(down(f(f(f(b))))) down(f(f(f(f(fresh_constant))))) -> f_flat(down(f(f(f(fresh_constant))))) f_flat(up(x_1)) -> up(f(x_1)) down(a) -> up(f(a)) down(f(f(f(f(f(x)))))) -> up(b) The TRS R 2 is top(up(x)) -> top(down(x)) The signature Sigma is {top_1} ---------------------------------------- popout

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

job log

popout

actions

all output return to TRS Outer 67415