details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.91982316971 seconds
cpu usage	4.768671946
max memory	2.8389376E8

stage attributes

key	value
output-size	19501
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) Overlay + Local Confluence [EQUIVALENT, 5 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 0 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) QDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) QDP (10) ATransformationProof [EQUIVALENT, 0 ms] (11) QDP (12) QReductionProof [EQUIVALENT, 0 ms] (13) QDP (14) QDPSizeChangeProof [EQUIVALENT, 0 ms] (15) YES (16) QDP (17) UsableRulesProof [EQUIVALENT, 0 ms] (18) QDP (19) ATransformationProof [EQUIVALENT, 1 ms] (20) QDP (21) QReductionProof [EQUIVALENT, 0 ms] (22) QDP (23) QDPOrderProof [EQUIVALENT, 0 ms] (24) QDP (25) PisEmptyProof [EQUIVALENT, 0 ms] (26) YES (27) QDP (28) QDPSizeChangeProof [EQUIVALENT, 0 ms] (29) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: app(pred, app(s, x)) -> x app(app(minus, x), 0) -> x app(app(minus, x), app(s, y)) -> app(pred, app(app(minus, x), y)) app(app(quot, 0), app(s, y)) -> 0 app(app(quot, app(s, x)), app(s, y)) -> app(s, app(app(quot, app(app(minus, x), y)), app(s, y))) app(app(map, f), nil) -> nil app(app(map, f), app(app(cons, x), xs)) -> app(app(cons, app(f, x)), app(app(map, f), xs)) app(app(filter, f), nil) -> nil app(app(filter, f), app(app(cons, x), xs)) -> app(app(app(app(filter2, app(f, x)), f), x), xs) app(app(app(app(filter2, true), f), x), xs) -> app(app(cons, x), app(app(filter, f), xs)) app(app(app(app(filter2, false), f), x), xs) -> app(app(filter, f), xs) Q is empty. ---------------------------------------- (1) Overlay + Local Confluence (EQUIVALENT) The TRS is overlay and locally confluent. By [NOC] we can switch to innermost. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: app(pred, app(s, x)) -> x app(app(minus, x), 0) -> x app(app(minus, x), app(s, y)) -> app(pred, app(app(minus, x), y)) app(app(quot, 0), app(s, y)) -> 0 app(app(quot, app(s, x)), app(s, y)) -> app(s, app(app(quot, app(app(minus, x), y)), app(s, y))) app(app(map, f), nil) -> nil app(app(map, f), app(app(cons, x), xs)) -> app(app(cons, app(f, x)), app(app(map, f), xs)) app(app(filter, f), nil) -> nil app(app(filter, f), app(app(cons, x), xs)) -> app(app(app(app(filter2, app(f, x)), f), x), xs) app(app(app(app(filter2, true), f), x), xs) -> app(app(cons, x), app(app(filter, f), xs)) app(app(app(app(filter2, false), f), x), xs) -> app(app(filter, f), xs) The set Q consists of the following terms: app(pred, app(s, x0)) app(app(minus, x0), 0) app(app(minus, x0), app(s, x1)) app(app(quot, 0), app(s, x0)) app(app(quot, app(s, x0)), app(s, x1)) app(app(map, x0), nil) app(app(map, x0), app(app(cons, x1), x2)) app(app(filter, x0), nil) app(app(filter, x0), app(app(cons, x1), x2)) popout

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

job log

popout

actions

all output return to TRS Stand 20472