details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.77399015427 seconds
cpu usage	4.164627677
max memory	2.47414784E8

stage attributes

key	value
output-size	3521
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 102 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 0 ms] (4) QTRS (5) RisEmptyProof [EQUIVALENT, 0 ms] (6) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: g(A) -> A g(B) -> A g(B) -> B g(C) -> A g(C) -> B g(C) -> C foldB(t, 0) -> t foldB(t, s(n)) -> f(foldB(t, n), B) foldC(t, 0) -> t foldC(t, s(n)) -> f(foldC(t, n), C) f(t, x) -> f'(t, g(x)) f'(triple(a, b, c), C) -> triple(a, b, s(c)) f'(triple(a, b, c), B) -> f(triple(a, b, c), A) f'(triple(a, b, c), A) -> f''(foldB(triple(s(a), 0, c), b)) f''(triple(a, b, c)) -> foldC(triple(a, b, 0), c) Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(0) = 0 POL(A) = 2 POL(B) = 2 POL(C) = 2 POL(f(x_1, x_2)) = x_1 + 2*x_2 POL(f'(x_1, x_2)) = x_1 + 2*x_2 POL(f''(x_1)) = x_1 POL(foldB(x_1, x_2)) = x_1 + 2*x_2 POL(foldC(x_1, x_2)) = x_1 + 2*x_2 POL(g(x_1)) = x_1 POL(s(x_1)) = 2 + x_1 POL(triple(x_1, x_2, x_3)) = x_1 + 2*x_2 + 2*x_3 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: f'(triple(a, b, c), A) -> f''(foldB(triple(s(a), 0, c), b)) ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: g(A) -> A g(B) -> A g(B) -> B g(C) -> A g(C) -> B g(C) -> C foldB(t, 0) -> t foldB(t, s(n)) -> f(foldB(t, n), B) foldC(t, 0) -> t foldC(t, s(n)) -> f(foldC(t, n), C) f(t, x) -> f'(t, g(x)) f'(triple(a, b, c), C) -> triple(a, b, s(c)) f'(triple(a, b, c), B) -> f(triple(a, b, c), A) f''(triple(a, b, c)) -> foldC(triple(a, b, 0), c) Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: popout

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

job log

popout

actions

all output return to TRS Stand 20472