Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516964930
details
property
value
status
complete
benchmark
#3.38.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n062.star.cs.uiowa.edu
space
Applicative_first_order_05
run statistics
property
value
solver
AProVE21
configuration
standard
runtime (wallclock)
2.71086406708 seconds
cpu usage
7.505912666
max memory
5.26860288E8
stage attributes
key
value
output-size
23902
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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) Overlay + Local Confluence [EQUIVALENT, 0 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 54 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, 0 ms] (20) QDP (21) QReductionProof [EQUIVALENT, 0 ms] (22) QDP (23) QDPOrderProof [EQUIVALENT, 30 ms] (24) QDP (25) DependencyGraphProof [EQUIVALENT, 0 ms] (26) TRUE (27) QDP (28) UsableRulesProof [EQUIVALENT, 0 ms] (29) QDP (30) QDPSizeChangeProof [EQUIVALENT, 0 ms] (31) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: app(rev, nil) -> nil app(rev, app(app(cons, x), l)) -> app(app(cons, app(app(rev1, x), l)), app(app(rev2, x), l)) app(app(rev1, 0), nil) -> 0 app(app(rev1, app(s, x)), nil) -> app(s, x) app(app(rev1, x), app(app(cons, y), l)) -> app(app(rev1, y), l) app(app(rev2, x), nil) -> nil app(app(rev2, x), app(app(cons, y), l)) -> app(rev, app(app(cons, x), app(app(rev2, y), l))) 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(rev, nil) -> nil app(rev, app(app(cons, x), l)) -> app(app(cons, app(app(rev1, x), l)), app(app(rev2, x), l)) app(app(rev1, 0), nil) -> 0 app(app(rev1, app(s, x)), nil) -> app(s, x) app(app(rev1, x), app(app(cons, y), l)) -> app(app(rev1, y), l) app(app(rev2, x), nil) -> nil app(app(rev2, x), app(app(cons, y), l)) -> app(rev, app(app(cons, x), app(app(rev2, y), l))) 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(rev, nil) app(rev, app(app(cons, x0), x1)) app(app(rev1, 0), nil)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard