details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	111.116 seconds
cpu usage	166.819
user time	160.293
system time	6.52626
max virtual memory	1.8463916E7
max residence set size	7390336.0

stage attributes

key	value
starexec-result	MAYBE

output

166.67/111.04 MAYBE 166.67/111.05 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 166.67/111.05 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 166.67/111.05 166.67/111.05 166.67/111.05 Outermost Termination of the given OTRS could not be shown: 166.67/111.05 166.67/111.05 (0) OTRS 166.67/111.05 (1) Thiemann-SpecialC-Transformation [EQUIVALENT, 0 ms] 166.67/111.05 (2) QTRS 166.67/111.05 (3) DependencyPairsProof [EQUIVALENT, 0 ms] 166.67/111.05 (4) QDP 166.67/111.05 (5) DependencyGraphProof [EQUIVALENT, 0 ms] 166.67/111.05 (6) AND 166.67/111.05 (7) QDP 166.67/111.05 (8) UsableRulesProof [EQUIVALENT, 1 ms] 166.67/111.05 (9) QDP 166.67/111.05 (10) QReductionProof [EQUIVALENT, 0 ms] 166.67/111.05 (11) QDP 166.67/111.05 (12) UsableRulesReductionPairsProof [EQUIVALENT, 0 ms] 166.67/111.05 (13) QDP 166.67/111.05 (14) DependencyGraphProof [EQUIVALENT, 0 ms] 166.67/111.05 (15) TRUE 166.67/111.05 (16) QDP 166.67/111.05 (17) UsableRulesProof [EQUIVALENT, 0 ms] 166.67/111.05 (18) QDP 166.67/111.05 (19) QReductionProof [EQUIVALENT, 0 ms] 166.67/111.05 (20) QDP 166.67/111.05 (21) TransformationProof [EQUIVALENT, 0 ms] 166.67/111.05 (22) QDP 166.67/111.05 (23) TransformationProof [EQUIVALENT, 0 ms] 166.67/111.05 (24) QDP 166.67/111.05 (25) TransformationProof [EQUIVALENT, 0 ms] 166.67/111.05 (26) QDP 166.67/111.05 (27) QDPOrderProof [EQUIVALENT, 8 ms] 166.67/111.05 (28) QDP 166.67/111.05 (29) UsableRulesProof [EQUIVALENT, 0 ms] 166.67/111.05 (30) QDP 166.67/111.05 (31) QReductionProof [EQUIVALENT, 0 ms] 166.67/111.05 (32) QDP 166.67/111.05 (33) Trivial-Transformation [SOUND, 0 ms] 166.67/111.05 (34) QTRS 166.67/111.05 (35) DependencyPairsProof [EQUIVALENT, 0 ms] 166.67/111.05 (36) QDP 166.67/111.05 (37) DependencyGraphProof [EQUIVALENT, 0 ms] 166.67/111.05 (38) QDP 166.67/111.05 (39) UsableRulesProof [EQUIVALENT, 0 ms] 166.67/111.05 (40) QDP 166.67/111.05 (41) TransformationProof [EQUIVALENT, 0 ms] 166.67/111.05 (42) QDP 166.67/111.05 (43) TransformationProof [EQUIVALENT, 0 ms] 166.67/111.05 (44) QDP 166.67/111.05 (45) NonTerminationLoopProof [COMPLETE, 0 ms] 166.67/111.05 (46) NO 166.67/111.05 166.67/111.05 166.67/111.05 ---------------------------------------- 166.67/111.05 166.67/111.05 (0) 166.67/111.05 Obligation: 166.67/111.05 Term rewrite system R: 166.67/111.05 The TRS R consists of the following rules: 166.67/111.05 166.67/111.05 cons(x, cons(y, z)) -> big 166.67/111.05 inf(x) -> cons(x, inf(s(x))) 166.67/111.05 g(x, x) -> b 166.67/111.05 166.67/111.05 166.67/111.05 166.67/111.05 Outermost Strategy. 166.67/111.05 166.67/111.05 ---------------------------------------- 166.67/111.05 166.67/111.05 (1) Thiemann-SpecialC-Transformation (EQUIVALENT) 166.67/111.05 We applied the Thiemann-SpecialC transformation to transform the outermost TRS to an innermost TRS. 166.67/111.05 ---------------------------------------- 166.67/111.05 166.67/111.05 (2) 166.67/111.05 Obligation: 166.67/111.05 Q restricted rewrite system: 166.67/111.05 The TRS R consists of the following rules: 166.67/111.05 166.67/111.05 top(go_up(x)) -> top(reduce(x)) 166.67/111.05 reduce(cons(x_1, x_2)) -> check_cons(redex_cons(x_1, x_2)) 166.67/111.05 reduce(inf(x_1)) -> check_inf(redex_inf(x_1)) 166.67/111.05 reduce(g(x_1, x_2)) -> check_g(redex_g(x_1, x_2)) 166.67/111.05 redex_cons(x, cons(y, z)) -> result_cons(big) 166.67/111.05 redex_inf(x) -> result_inf(cons(x, inf(s(x)))) 166.67/111.05 redex_g(x, x) -> result_g(b) 166.67/111.05 check_cons(result_cons(x)) -> go_up(x) 166.67/111.05 check_inf(result_inf(x)) -> go_up(x) 166.67/111.05 check_g(result_g(x)) -> go_up(x) 166.67/111.05 check_cons(redex_cons(x_1, x_2)) -> in_cons_1(reduce(x_1), x_2) 166.67/111.05 check_cons(redex_cons(x_1, x_2)) -> in_cons_2(x_1, reduce(x_2)) 166.67/111.05 check_inf(redex_inf(x_1)) -> in_inf_1(reduce(x_1)) 166.67/111.05 check_g(redex_g(x_1, x_2)) -> in_g_1(reduce(x_1), x_2) 166.67/111.05 check_g(redex_g(x_1, x_2)) -> in_g_2(x_1, reduce(x_2)) 166.67/111.05 reduce(s(x_1)) -> in_s_1(reduce(x_1)) 166.67/111.05 in_cons_1(go_up(x_1), x_2) -> go_up(cons(x_1, x_2)) 166.67/111.05 in_cons_2(x_1, go_up(x_2)) -> go_up(cons(x_1, x_2)) 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