details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	9.26073288918 seconds
cpu usage	32.450610766
max memory	3.081736192E9

stage attributes

key	value
output-size	53219
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination of the given RelTRS could be proven: (0) RelTRS (1) FlatCCProof [EQUIVALENT, 0 ms] (2) RelTRS (3) RootLabelingProof [EQUIVALENT, 16 ms] (4) RelTRS (5) RelTRSRRRProof [EQUIVALENT, 138 ms] (6) RelTRS (7) RelTRSRRRProof [EQUIVALENT, 68 ms] (8) RelTRS (9) RelTRSRRRProof [EQUIVALENT, 70 ms] (10) RelTRS (11) RelTRSRRRProof [EQUIVALENT, 0 ms] (12) RelTRS (13) RelTRSRRRProof [EQUIVALENT, 19 ms] (14) RelTRS (15) RelTRSRRRProof [EQUIVALENT, 24 ms] (16) RelTRS (17) RelTRSRRRProof [EQUIVALENT, 13 ms] (18) RelTRS (19) RIsEmptyProof [EQUIVALENT, 0 ms] (20) YES ---------------------------------------- (0) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: b(p(b(x1))) -> b(q(b(x1))) The relative TRS consists of the following S rules: 1(p(0(1(0(x1))))) -> p(x1) q(x1) -> 0(q(0(x1))) q(x1) -> 1(q(1(x1))) q(x1) -> 0(p(0(x1))) q(x1) -> 1(p(1(x1))) ---------------------------------------- (1) FlatCCProof (EQUIVALENT) We used flat context closure [ROOTLAB] ---------------------------------------- (2) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: b(p(b(x1))) -> b(q(b(x1))) The relative TRS consists of the following S rules: b(1(p(0(1(0(x1)))))) -> b(p(x1)) p(1(p(0(1(0(x1)))))) -> p(p(x1)) q(1(p(0(1(0(x1)))))) -> q(p(x1)) 1(1(p(0(1(0(x1)))))) -> 1(p(x1)) 0(1(p(0(1(0(x1)))))) -> 0(p(x1)) b(q(x1)) -> b(0(q(0(x1)))) p(q(x1)) -> p(0(q(0(x1)))) q(q(x1)) -> q(0(q(0(x1)))) 1(q(x1)) -> 1(0(q(0(x1)))) 0(q(x1)) -> 0(0(q(0(x1)))) b(q(x1)) -> b(1(q(1(x1)))) p(q(x1)) -> p(1(q(1(x1)))) q(q(x1)) -> q(1(q(1(x1)))) 1(q(x1)) -> 1(1(q(1(x1)))) 0(q(x1)) -> 0(1(q(1(x1)))) b(q(x1)) -> b(0(p(0(x1)))) p(q(x1)) -> p(0(p(0(x1)))) q(q(x1)) -> q(0(p(0(x1)))) 1(q(x1)) -> 1(0(p(0(x1)))) 0(q(x1)) -> 0(0(p(0(x1)))) b(q(x1)) -> b(1(p(1(x1)))) p(q(x1)) -> p(1(p(1(x1)))) q(q(x1)) -> q(1(p(1(x1)))) 1(q(x1)) -> 1(1(p(1(x1)))) 0(q(x1)) -> 0(1(p(1(x1)))) ---------------------------------------- (3) RootLabelingProof (EQUIVALENT) popout

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

job log

popout

actions

all output return to SRS Relat 19260