details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	116.84 seconds
cpu usage	182.7
user time	176.053
system time	6.64757
max virtual memory	1.8319764E7
max residence set size	6843788.0

stage attributes

key	value
starexec-result	MAYBE

output

182.56/116.76 MAYBE 182.56/116.77 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 182.56/116.77 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 182.56/116.77 182.56/116.77 182.56/116.77 Outermost Termination of the given OTRS could not be shown: 182.56/116.77 182.56/116.77 (0) OTRS 182.56/116.77 (1) Thiemann-SpecialC-Transformation [EQUIVALENT, 0 ms] 182.56/116.77 (2) QTRS 182.56/116.77 (3) QTRSRRRProof [EQUIVALENT, 63 ms] 182.56/116.77 (4) QTRS 182.56/116.77 (5) DependencyPairsProof [EQUIVALENT, 0 ms] 182.56/116.77 (6) QDP 182.56/116.77 (7) DependencyGraphProof [EQUIVALENT, 0 ms] 182.56/116.77 (8) AND 182.56/116.77 (9) QDP 182.56/116.77 (10) UsableRulesProof [EQUIVALENT, 0 ms] 182.56/116.77 (11) QDP 182.56/116.77 (12) QReductionProof [EQUIVALENT, 0 ms] 182.56/116.77 (13) QDP 182.56/116.77 (14) UsableRulesReductionPairsProof [EQUIVALENT, 0 ms] 182.56/116.77 (15) QDP 182.56/116.77 (16) UsableRulesReductionPairsProof [EQUIVALENT, 0 ms] 182.56/116.77 (17) QDP 182.56/116.77 (18) DependencyGraphProof [EQUIVALENT, 0 ms] 182.56/116.77 (19) TRUE 182.56/116.77 (20) QDP 182.56/116.77 (21) UsableRulesProof [EQUIVALENT, 0 ms] 182.56/116.77 (22) QDP 182.56/116.77 (23) QReductionProof [EQUIVALENT, 0 ms] 182.56/116.77 (24) QDP 182.56/116.77 (25) TransformationProof [SOUND, 0 ms] 182.56/116.77 (26) QDP 182.56/116.77 (27) TransformationProof [EQUIVALENT, 0 ms] 182.56/116.77 (28) QDP 182.56/116.77 (29) TransformationProof [EQUIVALENT, 0 ms] 182.56/116.77 (30) QDP 182.56/116.77 (31) QDPOrderProof [EQUIVALENT, 14 ms] 182.56/116.77 (32) QDP 182.56/116.77 (33) UsableRulesProof [EQUIVALENT, 0 ms] 182.56/116.77 (34) QDP 182.56/116.77 (35) QReductionProof [EQUIVALENT, 0 ms] 182.56/116.77 (36) QDP 182.56/116.77 (37) Trivial-Transformation [SOUND, 0 ms] 182.56/116.77 (38) QTRS 182.56/116.77 (39) QTRSRRRProof [EQUIVALENT, 52 ms] 182.56/116.77 (40) QTRS 182.56/116.77 (41) AAECC Innermost [EQUIVALENT, 0 ms] 182.56/116.77 (42) QTRS 182.56/116.77 (43) DependencyPairsProof [EQUIVALENT, 0 ms] 182.56/116.77 (44) QDP 182.56/116.77 (45) DependencyGraphProof [EQUIVALENT, 0 ms] 182.56/116.77 (46) QDP 182.56/116.77 (47) UsableRulesProof [EQUIVALENT, 0 ms] 182.56/116.77 (48) QDP 182.56/116.77 (49) QReductionProof [EQUIVALENT, 0 ms] 182.56/116.77 (50) QDP 182.56/116.77 (51) TransformationProof [EQUIVALENT, 0 ms] 182.56/116.77 (52) QDP 182.56/116.77 (53) UsableRulesProof [EQUIVALENT, 0 ms] 182.56/116.77 (54) QDP 182.56/116.77 (55) QReductionProof [EQUIVALENT, 0 ms] 182.56/116.77 (56) QDP 182.56/116.77 (57) NonTerminationLoopProof [COMPLETE, 0 ms] 182.56/116.77 (58) NO 182.56/116.77 182.56/116.77 182.56/116.77 ---------------------------------------- 182.56/116.77 182.56/116.77 (0) 182.56/116.77 Obligation: 182.56/116.77 Term rewrite system R: 182.56/116.77 The TRS R consists of the following rules: 182.56/116.77 182.56/116.77 f(h(x, x)) -> f(i(x)) 182.56/116.77 f(i(x)) -> a 182.56/116.77 i(x) -> h(x, x) 182.56/116.77 182.56/116.77 182.56/116.77 182.56/116.77 Outermost Strategy. 182.56/116.77 182.56/116.77 ---------------------------------------- 182.56/116.77 182.56/116.77 (1) Thiemann-SpecialC-Transformation (EQUIVALENT) 182.56/116.77 We applied the Thiemann-SpecialC transformation to transform the outermost TRS to an innermost TRS. 182.56/116.77 ---------------------------------------- 182.56/116.77 182.56/116.77 (2) 182.56/116.77 Obligation: 182.56/116.77 Q restricted rewrite system: 182.56/116.77 The TRS R consists of the following rules: 182.56/116.77 182.56/116.77 top(go_up(x)) -> top(reduce(x)) 182.56/116.77 reduce(f(x_1)) -> check_f(redex_f(x_1)) 182.56/116.77 reduce(i(x_1)) -> check_i(redex_i(x_1)) 182.56/116.77 redex_f(h(x, x)) -> result_f(f(i(x))) 182.56/116.77 redex_f(i(x)) -> result_f(a) 182.56/116.77 redex_i(x) -> result_i(h(x, x)) 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