details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.42628 seconds
cpu usage	6.19449
user time	5.96081
system time	0.233678
max virtual memory	3.6569888E7
max residence set size	592916.0

stage attributes

key	value
starexec-result	YES

output

5.82/2.23 YES 5.82/2.24 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 5.82/2.24 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 5.82/2.24 5.82/2.24 5.82/2.24 Outermost Termination of the given OTRS could be proven: 5.82/2.24 5.82/2.24 (0) OTRS 5.82/2.24 (1) Thiemann-SpecialC-Transformation [EQUIVALENT, 0 ms] 5.82/2.24 (2) QTRS 5.82/2.24 (3) DependencyPairsProof [EQUIVALENT, 0 ms] 5.82/2.24 (4) QDP 5.82/2.24 (5) DependencyGraphProof [EQUIVALENT, 0 ms] 5.82/2.24 (6) QDP 5.82/2.24 (7) UsableRulesProof [EQUIVALENT, 0 ms] 5.82/2.24 (8) QDP 5.82/2.24 (9) QReductionProof [EQUIVALENT, 0 ms] 5.82/2.24 (10) QDP 5.82/2.24 (11) RFCMatchBoundsDPProof [EQUIVALENT, 16 ms] 5.82/2.24 (12) YES 5.82/2.24 5.82/2.24 5.82/2.24 ---------------------------------------- 5.82/2.24 5.82/2.24 (0) 5.82/2.24 Obligation: 5.82/2.24 Term rewrite system R: 5.82/2.24 The TRS R consists of the following rules: 5.82/2.24 5.82/2.24 f(g(x)) -> g(g(x)) 5.82/2.24 g(x) -> f(f(x)) 5.82/2.24 f(f(x)) -> x 5.82/2.24 5.82/2.24 5.82/2.24 5.82/2.24 Outermost Strategy. 5.82/2.24 5.82/2.24 ---------------------------------------- 5.82/2.24 5.82/2.24 (1) Thiemann-SpecialC-Transformation (EQUIVALENT) 5.82/2.24 We applied the Thiemann-SpecialC transformation to transform the outermost TRS to an innermost TRS. 5.82/2.24 ---------------------------------------- 5.82/2.24 5.82/2.24 (2) 5.82/2.24 Obligation: 5.82/2.24 Q restricted rewrite system: 5.82/2.24 The TRS R consists of the following rules: 5.82/2.24 5.82/2.24 top(go_up(x)) -> top(reduce(x)) 5.82/2.24 reduce(f(x_1)) -> check_f(redex_f(x_1)) 5.82/2.24 reduce(g(x_1)) -> check_g(redex_g(x_1)) 5.82/2.24 redex_f(g(x)) -> result_f(g(g(x))) 5.82/2.24 redex_g(x) -> result_g(f(f(x))) 5.82/2.24 redex_f(f(x)) -> result_f(x) 5.82/2.24 check_f(result_f(x)) -> go_up(x) 5.82/2.24 check_g(result_g(x)) -> go_up(x) 5.82/2.24 check_f(redex_f(x_1)) -> in_f_1(reduce(x_1)) 5.82/2.24 check_g(redex_g(x_1)) -> in_g_1(reduce(x_1)) 5.82/2.24 in_f_1(go_up(x_1)) -> go_up(f(x_1)) 5.82/2.24 in_g_1(go_up(x_1)) -> go_up(g(x_1)) 5.82/2.24 5.82/2.24 The set Q consists of the following terms: 5.82/2.24 5.82/2.24 top(go_up(x0)) 5.82/2.24 reduce(f(x0)) 5.82/2.24 reduce(g(x0)) 5.82/2.24 redex_f(g(x0)) 5.82/2.24 redex_g(x0) 5.82/2.24 redex_f(f(x0)) 5.82/2.24 check_f(result_f(x0)) 5.82/2.24 check_g(result_g(x0)) 5.82/2.24 check_f(redex_f(x0)) 5.82/2.24 in_f_1(go_up(x0)) 5.82/2.24 in_g_1(go_up(x0)) 5.82/2.24 5.82/2.24 5.82/2.24 ---------------------------------------- 5.82/2.24 5.82/2.24 (3) DependencyPairsProof (EQUIVALENT) 5.82/2.24 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 5.82/2.24 ---------------------------------------- 5.82/2.24 5.82/2.24 (4) 5.82/2.24 Obligation: 5.82/2.24 Q DP problem: 5.82/2.24 The TRS P consists of the following rules: 5.82/2.24 5.82/2.24 TOP(go_up(x)) -> TOP(reduce(x)) 5.82/2.24 TOP(go_up(x)) -> REDUCE(x) 5.82/2.24 REDUCE(f(x_1)) -> CHECK_F(redex_f(x_1)) 5.82/2.24 REDUCE(f(x_1)) -> REDEX_F(x_1) 5.82/2.24 REDUCE(g(x_1)) -> CHECK_G(redex_g(x_1)) 5.82/2.24 REDUCE(g(x_1)) -> REDEX_G(x_1) 5.82/2.24 CHECK_F(redex_f(x_1)) -> IN_F_1(reduce(x_1)) 5.82/2.24 CHECK_F(redex_f(x_1)) -> REDUCE(x_1) 5.82/2.24 CHECK_G(redex_g(x_1)) -> IN_G_1(reduce(x_1)) 5.82/2.24 CHECK_G(redex_g(x_1)) -> REDUCE(x_1) 5.82/2.24 5.82/2.24 The TRS R consists of the following rules: 5.82/2.24 popout

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

job log

popout

actions

all output return to TRS_Outermost 2019-04-01 06.45