details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	63.4743 seconds
cpu usage	87.71
user time	84.28
system time	3.43
max virtual memory	3.64374E7
max residence set size	3885860.0

stage attributes

key	value
starexec-result	MAYBE

output

87.55/63.39 MAYBE 87.55/63.41 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 87.55/63.41 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 87.55/63.41 87.55/63.41 87.55/63.41 Outermost Termination of the given OTRS could not be shown: 87.55/63.41 87.55/63.41 (0) OTRS 87.55/63.41 (1) Thiemann-SpecialC-Transformation [EQUIVALENT, 0 ms] 87.55/63.41 (2) QTRS 87.55/63.41 (3) DependencyPairsProof [EQUIVALENT, 0 ms] 87.55/63.41 (4) QDP 87.55/63.41 (5) DependencyGraphProof [EQUIVALENT, 0 ms] 87.55/63.41 (6) AND 87.55/63.41 (7) QDP 87.55/63.41 (8) UsableRulesProof [EQUIVALENT, 0 ms] 87.55/63.41 (9) QDP 87.55/63.41 (10) QReductionProof [EQUIVALENT, 0 ms] 87.55/63.41 (11) QDP 87.55/63.41 (12) MRRProof [EQUIVALENT, 11 ms] 87.55/63.41 (13) QDP 87.55/63.41 (14) MRRProof [EQUIVALENT, 0 ms] 87.55/63.41 (15) QDP 87.55/63.41 (16) QReductionProof [EQUIVALENT, 0 ms] 87.55/63.41 (17) QDP 87.55/63.41 (18) MRRProof [EQUIVALENT, 10 ms] 87.55/63.41 (19) QDP 87.55/63.41 (20) UsableRulesReductionPairsProof [EQUIVALENT, 0 ms] 87.55/63.41 (21) QDP 87.55/63.41 (22) DependencyGraphProof [EQUIVALENT, 0 ms] 87.55/63.41 (23) TRUE 87.55/63.41 (24) QDP 87.55/63.41 (25) UsableRulesProof [EQUIVALENT, 0 ms] 87.55/63.41 (26) QDP 87.55/63.41 (27) QReductionProof [EQUIVALENT, 0 ms] 87.55/63.41 (28) QDP 87.55/63.41 (29) TransformationProof [EQUIVALENT, 0 ms] 87.55/63.41 (30) QDP 87.55/63.41 (31) UsableRulesProof [EQUIVALENT, 0 ms] 87.55/63.41 (32) QDP 87.55/63.41 (33) QReductionProof [EQUIVALENT, 0 ms] 87.55/63.41 (34) QDP 87.55/63.41 (35) Trivial-Transformation [SOUND, 0 ms] 87.55/63.41 (36) QTRS 87.55/63.41 (37) DependencyPairsProof [EQUIVALENT, 0 ms] 87.55/63.41 (38) QDP 87.55/63.41 (39) DependencyGraphProof [EQUIVALENT, 0 ms] 87.55/63.41 (40) QDP 87.55/63.41 (41) UsableRulesReductionPairsProof [EQUIVALENT, 0 ms] 87.55/63.41 (42) QDP 87.55/63.41 (43) NonTerminationLoopProof [COMPLETE, 0 ms] 87.55/63.41 (44) NO 87.55/63.41 87.55/63.41 87.55/63.41 ---------------------------------------- 87.55/63.41 87.55/63.41 (0) 87.55/63.41 Obligation: 87.55/63.41 Term rewrite system R: 87.55/63.41 The TRS R consists of the following rules: 87.55/63.41 87.55/63.41 p(x, y, x) -> q(p(y, x, y)) 87.55/63.41 q(q(x)) -> c 87.55/63.41 87.55/63.41 87.55/63.41 87.55/63.41 Outermost Strategy. 87.55/63.41 87.55/63.41 ---------------------------------------- 87.55/63.41 87.55/63.41 (1) Thiemann-SpecialC-Transformation (EQUIVALENT) 87.55/63.41 We applied the Thiemann-SpecialC transformation to transform the outermost TRS to an innermost TRS. 87.55/63.41 ---------------------------------------- 87.55/63.41 87.55/63.41 (2) 87.55/63.41 Obligation: 87.55/63.41 Q restricted rewrite system: 87.55/63.41 The TRS R consists of the following rules: 87.55/63.41 87.55/63.41 top(go_up(x)) -> top(reduce(x)) 87.55/63.41 reduce(p(x_1, x_2, x_3)) -> check_p(redex_p(x_1, x_2, x_3)) 87.55/63.41 reduce(q(x_1)) -> check_q(redex_q(x_1)) 87.55/63.41 redex_p(x, y, x) -> result_p(q(p(y, x, y))) 87.55/63.41 redex_q(q(x)) -> result_q(c) 87.55/63.41 check_p(result_p(x)) -> go_up(x) 87.55/63.41 check_q(result_q(x)) -> go_up(x) 87.55/63.41 check_p(redex_p(x_1, x_2, x_3)) -> in_p_1(reduce(x_1), x_2, x_3) 87.55/63.41 check_p(redex_p(x_1, x_2, x_3)) -> in_p_2(x_1, reduce(x_2), x_3) 87.55/63.41 check_p(redex_p(x_1, x_2, x_3)) -> in_p_3(x_1, x_2, reduce(x_3)) 87.55/63.41 check_q(redex_q(x_1)) -> in_q_1(reduce(x_1)) 87.55/63.41 in_p_1(go_up(x_1), x_2, x_3) -> go_up(p(x_1, x_2, x_3)) 87.55/63.41 in_p_2(x_1, go_up(x_2), x_3) -> go_up(p(x_1, x_2, x_3)) 87.55/63.41 in_p_3(x_1, x_2, go_up(x_3)) -> go_up(p(x_1, x_2, x_3)) 87.55/63.41 in_q_1(go_up(x_1)) -> go_up(q(x_1)) 87.55/63.41 87.55/63.41 The set Q consists of the following terms: 87.55/63.41 87.55/63.41 top(go_up(x0)) 87.55/63.41 reduce(p(x0, x1, x2)) 87.55/63.41 reduce(q(x0)) 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