details

property	value
status	complete
benchmark	rtL-cbn5.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n145.star.cs.uiowa.edu
space	Relative_05

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	10.0645 seconds
cpu usage	35.4892
user time	34.1467
system time	1.34254
max virtual memory	3.7502664E7
max residence set size	4305576.0

stage attributes

key	value
starexec-result	YES

output

35.00/9.91 YES 35.27/9.96 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 35.27/9.96 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 35.27/9.96 35.27/9.96 35.27/9.96 Termination of the given RelTRS could be proven: 35.27/9.96 35.27/9.96 (0) RelTRS 35.27/9.96 (1) RelTRSSemanticLabellingPOLOProof [EQUIVALENT, 568 ms] 35.27/9.96 (2) RelTRS 35.27/9.96 (3) RelTRSSemanticLabellingPOLOProof [EQUIVALENT, 179 ms] 35.27/9.96 (4) RelTRS 35.27/9.96 (5) RelTRSRRRProof [EQUIVALENT, 6 ms] 35.27/9.96 (6) RelTRS 35.27/9.96 (7) RIsEmptyProof [EQUIVALENT, 0 ms] 35.27/9.96 (8) YES 35.27/9.96 35.27/9.96 35.27/9.96 ---------------------------------------- 35.27/9.96 35.27/9.96 (0) 35.27/9.96 Obligation: 35.27/9.96 Relative term rewrite system: 35.27/9.96 The relative TRS consists of the following R rules: 35.27/9.96 35.27/9.96 top(ok(left(car(x, y), z))) -> top(check(right(y, z))) 35.27/9.96 top(ok(right(x, car(y, z)))) -> top(check(left(x, z))) 35.27/9.96 top(ok(left(bot, x))) -> top(check(right(bot, x))) 35.27/9.96 top(ok(right(x, bot))) -> top(check(left(x, bot))) 35.27/9.96 35.27/9.96 The relative TRS consists of the following S rules: 35.27/9.96 35.27/9.96 top(ok(left(car(x, y), z))) -> top(check(left(y, z))) 35.27/9.96 top(ok(right(x, car(y, z)))) -> top(check(right(x, z))) 35.27/9.96 bot -> car(new, bot) 35.27/9.96 check(old) -> ok(old) 35.27/9.96 check(car(x, y)) -> car(check(x), y) 35.27/9.96 check(car(x, y)) -> car(x, check(y)) 35.27/9.96 check(left(x, y)) -> left(check(x), y) 35.27/9.96 check(left(x, y)) -> left(x, check(y)) 35.27/9.96 check(right(x, y)) -> right(check(x), y) 35.27/9.96 check(right(x, y)) -> right(x, check(y)) 35.27/9.96 car(ok(x), y) -> ok(car(x, y)) 35.27/9.96 car(x, ok(y)) -> ok(car(x, y)) 35.27/9.96 left(ok(x), y) -> ok(left(x, y)) 35.27/9.96 left(x, ok(y)) -> ok(left(x, y)) 35.27/9.96 right(ok(x), y) -> ok(right(x, y)) 35.27/9.96 right(x, ok(y)) -> ok(right(x, y)) 35.27/9.96 35.27/9.96 35.27/9.96 ---------------------------------------- 35.27/9.96 35.27/9.96 (1) RelTRSSemanticLabellingPOLOProof (EQUIVALENT) 35.27/9.96 We use Semantic Labelling over tuples of bools combined with a polynomial order [SEMLAB] 35.27/9.96 35.27/9.96 35.27/9.96 35.27/9.96 We use semantic labelling over boolean tuples of size 1. 35.27/9.96 35.27/9.96 35.27/9.96 35.27/9.96 We used the following model: 35.27/9.96 35.27/9.96 top_1: component 1: OR[] 35.27/9.96 35.27/9.96 ok_1: component 1: AND[] 35.27/9.96 35.27/9.96 left_2: component 1: OR[x_1^1, x_2^1] 35.27/9.96 35.27/9.96 car_2: component 1: OR[x_1^1, x_2^1] 35.27/9.96 35.27/9.96 check_1: component 1: OR[x_1^1] 35.27/9.96 35.27/9.96 right_2: component 1: OR[x_1^1, x_2^1] 35.27/9.96 35.27/9.96 bot_0: component 1: OR[] 35.27/9.96 35.27/9.96 new_0: component 1: OR[] 35.27/9.96 35.27/9.96 old_0: component 1: AND[] 35.27/9.96 35.27/9.96 35.27/9.96 35.27/9.96 Our labelling function was: 35.27/9.96 35.27/9.96 top_1:component 1: XOR[x_1^1] 35.27/9.96 35.27/9.96 ok_1:component 1: OR[] 35.27/9.96 35.27/9.96 left_2:component 1: XOR[x_2^1] 35.27/9.96 35.27/9.96 car_2:component 1: OR[x_2^1] 35.27/9.96 35.27/9.96 check_1:component 1: XOR[] 35.27/9.96 35.27/9.96 right_2:component 1: AND[x_1^1] 35.27/9.96 35.27/9.96 bot_0:component 1: AND[] 35.27/9.96 35.27/9.96 new_0:component 1: OR[] popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS_Relative 2019-03-21 03.54