details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	74.3321 seconds
cpu usage	93.6061
user time	88.3003
system time	5.30581
max virtual memory	1.8343352E7
max residence set size	3910216.0

stage attributes

key	value
starexec-result	MAYBE

output

93.39/74.26 MAYBE 93.39/74.27 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 93.39/74.27 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 93.39/74.27 93.39/74.27 93.39/74.27 Outermost Termination of the given OTRS could not be shown: 93.39/74.27 93.39/74.27 (0) OTRS 93.39/74.27 (1) Thiemann-SpecialC-Transformation [EQUIVALENT, 0 ms] 93.39/74.27 (2) QTRS 93.39/74.27 (3) QTRSRRRProof [EQUIVALENT, 64 ms] 93.39/74.27 (4) QTRS 93.39/74.27 (5) DependencyPairsProof [EQUIVALENT, 0 ms] 93.39/74.27 (6) QDP 93.39/74.27 (7) DependencyGraphProof [EQUIVALENT, 0 ms] 93.39/74.27 (8) AND 93.39/74.27 (9) QDP 93.39/74.27 (10) UsableRulesProof [EQUIVALENT, 0 ms] 93.39/74.27 (11) QDP 93.39/74.27 (12) QReductionProof [EQUIVALENT, 0 ms] 93.39/74.27 (13) QDP 93.39/74.27 (14) MRRProof [EQUIVALENT, 0 ms] 93.39/74.27 (15) QDP 93.39/74.27 (16) MRRProof [EQUIVALENT, 0 ms] 93.39/74.27 (17) QDP 93.39/74.27 (18) DependencyGraphProof [EQUIVALENT, 0 ms] 93.39/74.27 (19) QDP 93.39/74.27 (20) QReductionProof [EQUIVALENT, 0 ms] 93.39/74.27 (21) QDP 93.39/74.27 (22) MRRProof [EQUIVALENT, 0 ms] 93.39/74.27 (23) QDP 93.39/74.27 (24) PisEmptyProof [EQUIVALENT, 0 ms] 93.39/74.27 (25) YES 93.39/74.27 (26) QDP 93.39/74.27 (27) UsableRulesProof [EQUIVALENT, 0 ms] 93.39/74.27 (28) QDP 93.39/74.27 (29) QReductionProof [EQUIVALENT, 0 ms] 93.39/74.27 (30) QDP 93.39/74.27 (31) TransformationProof [SOUND, 0 ms] 93.39/74.27 (32) QDP 93.39/74.27 (33) QReductionProof [EQUIVALENT, 0 ms] 93.39/74.27 (34) QDP 93.39/74.27 (35) UsableRulesProof [EQUIVALENT, 0 ms] 93.39/74.27 (36) QDP 93.39/74.27 (37) QReductionProof [EQUIVALENT, 0 ms] 93.39/74.27 (38) QDP 93.39/74.27 (39) QReductionProof [EQUIVALENT, 0 ms] 93.39/74.27 (40) QDP 93.39/74.27 (41) Trivial-Transformation [SOUND, 0 ms] 93.39/74.27 (42) QTRS 93.39/74.27 (43) QTRSRRRProof [EQUIVALENT, 35 ms] 93.39/74.27 (44) QTRS 93.39/74.27 (45) DependencyPairsProof [EQUIVALENT, 0 ms] 93.39/74.27 (46) QDP 93.39/74.27 (47) DependencyGraphProof [EQUIVALENT, 0 ms] 93.39/74.27 (48) QDP 93.39/74.27 (49) UsableRulesProof [EQUIVALENT, 0 ms] 93.39/74.27 (50) QDP 93.39/74.27 (51) NonTerminationLoopProof [COMPLETE, 0 ms] 93.39/74.27 (52) NO 93.39/74.27 93.39/74.27 93.39/74.27 ---------------------------------------- 93.39/74.27 93.39/74.27 (0) 93.39/74.27 Obligation: 93.39/74.27 Term rewrite system R: 93.39/74.27 The TRS R consists of the following rules: 93.39/74.27 93.39/74.27 f(g(a, a)) -> a 93.39/74.27 f(f(x)) -> b 93.39/74.27 g(x, x) -> f(g(x, x)) 93.39/74.27 93.39/74.27 93.39/74.27 93.39/74.27 Outermost Strategy. 93.39/74.27 93.39/74.27 ---------------------------------------- 93.39/74.27 93.39/74.27 (1) Thiemann-SpecialC-Transformation (EQUIVALENT) 93.39/74.27 We applied the Thiemann-SpecialC transformation to transform the outermost TRS to an innermost TRS. 93.39/74.27 ---------------------------------------- 93.39/74.27 93.39/74.27 (2) 93.39/74.27 Obligation: 93.39/74.27 Q restricted rewrite system: 93.39/74.27 The TRS R consists of the following rules: 93.39/74.27 93.39/74.27 top(go_up(x)) -> top(reduce(x)) 93.39/74.27 reduce(f(x_1)) -> check_f(redex_f(x_1)) 93.39/74.27 reduce(g(x_1, x_2)) -> check_g(redex_g(x_1, x_2)) 93.39/74.27 redex_f(g(a, a)) -> result_f(a) 93.39/74.27 redex_f(f(x)) -> result_f(b) 93.39/74.27 redex_g(x, x) -> result_g(f(g(x, x))) 93.39/74.27 check_f(result_f(x)) -> go_up(x) 93.39/74.27 check_g(result_g(x)) -> go_up(x) 93.39/74.27 check_f(redex_f(x_1)) -> in_f_1(reduce(x_1)) 93.39/74.27 check_g(redex_g(x_1, x_2)) -> in_g_1(reduce(x_1), x_2) 93.39/74.27 check_g(redex_g(x_1, x_2)) -> in_g_2(x_1, reduce(x_2)) 93.39/74.27 in_f_1(go_up(x_1)) -> go_up(f(x_1)) 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