details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	20.5404 seconds
cpu usage	49.6074
user time	47.7996
system time	1.8078
max virtual memory	3.6442456E7
max residence set size	4527400.0

stage attributes

key	value
starexec-result	YES

output

49.40/20.44 YES 49.40/20.45 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 49.40/20.45 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 49.40/20.45 49.40/20.45 49.40/20.45 Outermost Termination of the given OTRS could be proven: 49.40/20.45 49.40/20.45 (0) OTRS 49.40/20.45 (1) Thiemann-SpecialC-Transformation [EQUIVALENT, 0 ms] 49.40/20.45 (2) QTRS 49.40/20.45 (3) DependencyPairsProof [EQUIVALENT, 0 ms] 49.40/20.45 (4) QDP 49.40/20.45 (5) DependencyGraphProof [EQUIVALENT, 0 ms] 49.40/20.45 (6) AND 49.40/20.45 (7) QDP 49.40/20.45 (8) UsableRulesProof [EQUIVALENT, 0 ms] 49.40/20.45 (9) QDP 49.40/20.45 (10) QReductionProof [EQUIVALENT, 0 ms] 49.40/20.45 (11) QDP 49.40/20.45 (12) UsableRulesReductionPairsProof [EQUIVALENT, 5 ms] 49.40/20.45 (13) QDP 49.40/20.45 (14) DependencyGraphProof [EQUIVALENT, 0 ms] 49.40/20.45 (15) TRUE 49.40/20.45 (16) QDP 49.40/20.45 (17) UsableRulesProof [EQUIVALENT, 0 ms] 49.40/20.45 (18) QDP 49.40/20.45 (19) QReductionProof [EQUIVALENT, 0 ms] 49.40/20.45 (20) QDP 49.40/20.45 (21) TransformationProof [EQUIVALENT, 0 ms] 49.40/20.45 (22) QDP 49.40/20.45 (23) DependencyGraphProof [EQUIVALENT, 0 ms] 49.40/20.45 (24) QDP 49.40/20.45 (25) TransformationProof [EQUIVALENT, 0 ms] 49.40/20.45 (26) QDP 49.40/20.45 (27) TransformationProof [EQUIVALENT, 0 ms] 49.40/20.45 (28) QDP 49.40/20.45 (29) TransformationProof [EQUIVALENT, 0 ms] 49.40/20.45 (30) QDP 49.40/20.45 (31) DependencyGraphProof [EQUIVALENT, 0 ms] 49.40/20.45 (32) QDP 49.40/20.45 (33) SemLabProof [SOUND, 141 ms] 49.40/20.45 (34) QDP 49.40/20.45 (35) QDPOrderProof [EQUIVALENT, 32 ms] 49.40/20.45 (36) QDP 49.40/20.45 (37) PisEmptyProof [EQUIVALENT, 0 ms] 49.40/20.45 (38) YES 49.40/20.45 49.40/20.45 49.40/20.45 ---------------------------------------- 49.40/20.45 49.40/20.45 (0) 49.40/20.45 Obligation: 49.40/20.45 Term rewrite system R: 49.40/20.45 The TRS R consists of the following rules: 49.40/20.45 49.40/20.45 f(0, 1, x) -> f(x, x, x) 49.40/20.45 f(x, y, z) -> 2 49.40/20.45 0 -> 2 49.40/20.45 1 -> 2 49.40/20.45 g(x, x, y) -> y 49.40/20.45 g(x, y, y) -> x 49.40/20.45 49.40/20.45 49.40/20.45 49.40/20.45 Outermost Strategy. 49.40/20.45 49.40/20.45 ---------------------------------------- 49.40/20.45 49.40/20.45 (1) Thiemann-SpecialC-Transformation (EQUIVALENT) 49.40/20.45 We applied the Thiemann-SpecialC transformation to transform the outermost TRS to an innermost TRS. 49.40/20.45 ---------------------------------------- 49.40/20.45 49.40/20.45 (2) 49.40/20.45 Obligation: 49.40/20.45 Q restricted rewrite system: 49.40/20.45 The TRS R consists of the following rules: 49.40/20.45 49.40/20.45 top(go_up(x)) -> top(reduce(x)) 49.40/20.45 reduce(f(x_1, x_2, x_3)) -> check_f(redex_f(x_1, x_2, x_3)) 49.40/20.45 reduce(g(x_1, x_2, x_3)) -> check_g(redex_g(x_1, x_2, x_3)) 49.40/20.45 redex_f(0, 1, x) -> result_f(f(x, x, x)) 49.40/20.45 redex_f(x, y, z) -> result_f(2) 49.40/20.45 reduce(0) -> go_up(2) 49.40/20.45 reduce(1) -> go_up(2) 49.40/20.45 redex_g(x, x, y) -> result_g(y) 49.40/20.45 redex_g(x, y, y) -> result_g(x) 49.40/20.45 check_f(result_f(x)) -> go_up(x) 49.40/20.45 check_g(result_g(x)) -> go_up(x) 49.40/20.45 check_f(redex_f(x_1, x_2, x_3)) -> in_f_1(reduce(x_1), x_2, x_3) 49.40/20.45 check_f(redex_f(x_1, x_2, x_3)) -> in_f_2(x_1, reduce(x_2), x_3) 49.40/20.45 check_f(redex_f(x_1, x_2, x_3)) -> in_f_3(x_1, x_2, reduce(x_3)) 49.40/20.45 check_g(redex_g(x_1, x_2, x_3)) -> in_g_1(reduce(x_1), x_2, x_3) 49.40/20.45 check_g(redex_g(x_1, x_2, x_3)) -> in_g_2(x_1, reduce(x_2), x_3) 49.40/20.45 check_g(redex_g(x_1, x_2, x_3)) -> in_g_3(x_1, x_2, reduce(x_3)) 49.40/20.45 in_f_1(go_up(x_1), x_2, x_3) -> go_up(f(x_1, x_2, x_3)) 49.40/20.45 in_f_2(x_1, go_up(x_2), x_3) -> go_up(f(x_1, x_2, x_3)) 49.40/20.45 in_f_3(x_1, x_2, go_up(x_3)) -> go_up(f(x_1, x_2, x_3)) 49.40/20.45 in_g_1(go_up(x_1), x_2, x_3) -> go_up(g(x_1, x_2, x_3)) 49.40/20.45 in_g_2(x_1, go_up(x_2), x_3) -> go_up(g(x_1, x_2, x_3)) 49.40/20.45 in_g_3(x_1, x_2, go_up(x_3)) -> go_up(g(x_1, x_2, x_3)) 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