Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Higher_Order_Rewriting_Union_Beta 2019-03-28 22.10 pair #432270723
details
property
value
status
complete
benchmark
Applicative_first_order_05__perfect2.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n147.star.cs.uiowa.edu
space
Uncurried_Applicative_11
run statistics
property
value
solver
Wanda 2.1c
configuration
default
runtime (wallclock)
1.51323 seconds
cpu usage
3.13356
user time
2.92815
system time
0.20541
max virtual memory
7028820.0
max residence set size
179564.0
stage attributes
key
value
starexec-result
YES
output
3.01/1.49 YES 3.01/1.51 We consider the system theBenchmark. 3.01/1.51 3.01/1.51 Alphabet: 3.01/1.51 3.01/1.51 0 : [] --> a 3.01/1.51 cons : [c * d] --> d 3.01/1.51 f : [a * a * a * a] --> b 3.01/1.51 false : [] --> b 3.01/1.51 filter : [c -> b * d] --> d 3.01/1.51 filter2 : [b * c -> b * c * d] --> d 3.01/1.51 if : [b * b * b] --> b 3.01/1.51 le : [a * a] --> b 3.01/1.51 map : [c -> c * d] --> d 3.01/1.51 minus : [a * a] --> a 3.01/1.51 nil : [] --> d 3.01/1.51 perfectp : [a] --> b 3.01/1.51 s : [a] --> a 3.01/1.51 true : [] --> b 3.01/1.51 3.01/1.51 Rules: 3.01/1.51 3.01/1.51 minus(0, x) => 0 3.01/1.51 minus(s(x), 0) => s(x) 3.01/1.51 minus(s(x), s(y)) => minus(x, y) 3.01/1.51 le(0, x) => true 3.01/1.51 le(s(x), 0) => false 3.01/1.51 le(s(x), s(y)) => le(x, y) 3.01/1.51 if(true, x, y) => x 3.01/1.51 if(false, x, y) => y 3.01/1.51 perfectp(0) => false 3.01/1.51 perfectp(s(x)) => f(x, s(0), s(x), s(x)) 3.01/1.51 f(0, x, 0, y) => true 3.01/1.51 f(0, x, s(y), z) => false 3.01/1.51 f(s(x), 0, y, z) => f(x, z, minus(y, s(x)), z) 3.01/1.51 f(s(x), s(y), z, u) => if(le(x, y), f(s(x), minus(y, x), z, u), f(x, u, z, u)) 3.01/1.51 map(g, nil) => nil 3.01/1.51 map(g, cons(x, y)) => cons(g x, map(g, y)) 3.01/1.51 filter(g, nil) => nil 3.01/1.51 filter(g, cons(x, y)) => filter2(g x, g, x, y) 3.01/1.51 filter2(true, g, x, y) => cons(x, filter(g, y)) 3.01/1.51 filter2(false, g, x, y) => filter(g, y) 3.01/1.51 3.01/1.51 This AFS is converted to an AFSM simply by replacing all free variables by meta-variables (with arity 0). 3.01/1.51 3.01/1.51 We observe that the rules contain a first-order subset: 3.01/1.51 3.01/1.51 minus(0, X) => 0 3.01/1.51 minus(s(X), 0) => s(X) 3.01/1.51 minus(s(X), s(Y)) => minus(X, Y) 3.01/1.51 le(0, X) => true 3.01/1.51 le(s(X), 0) => false 3.01/1.51 le(s(X), s(Y)) => le(X, Y) 3.01/1.51 if(true, X, Y) => X 3.01/1.51 if(false, X, Y) => Y 3.01/1.51 perfectp(0) => false 3.01/1.51 perfectp(s(X)) => f(X, s(0), s(X), s(X)) 3.01/1.51 f(0, X, 0, Y) => true 3.01/1.51 f(0, X, s(Y), Z) => false 3.01/1.51 f(s(X), 0, Y, Z) => f(X, Z, minus(Y, s(X)), Z) 3.01/1.51 f(s(X), s(Y), Z, U) => if(le(X, Y), f(s(X), minus(Y, X), Z, U), f(X, U, Z, U)) 3.01/1.51 3.01/1.51 Moreover, the system is orthogonal. Thus, by [Kop12, Thm. 7.55], we may omit all first-order dependency pairs from the dependency pair problem (DP(R), R) if this first-order part is terminating when seen as a many-sorted first-order TRS. 3.01/1.51 3.01/1.51 According to the external first-order termination prover, this system is indeed terminating: 3.01/1.51 3.01/1.51 || proof of resources/system.trs 3.01/1.51 || # AProVE Commit ID: d84c10301d352dfd14de2104819581f4682260f5 fuhs 20130616 3.01/1.51 || 3.01/1.51 || 3.01/1.51 || Termination w.r.t. Q of the given QTRS could be proven: 3.01/1.51 || 3.01/1.51 || (0) QTRS 3.01/1.51 || (1) Overlay + Local Confluence [EQUIVALENT] 3.01/1.51 || (2) QTRS 3.01/1.51 || (3) DependencyPairsProof [EQUIVALENT] 3.01/1.51 || (4) QDP 3.01/1.51 || (5) DependencyGraphProof [EQUIVALENT] 3.01/1.51 || (6) AND 3.01/1.51 || (7) QDP 3.01/1.51 || (8) UsableRulesProof [EQUIVALENT] 3.01/1.51 || (9) QDP 3.01/1.51 || (10) QReductionProof [EQUIVALENT] 3.01/1.51 || (11) QDP 3.01/1.51 || (12) QDPSizeChangeProof [EQUIVALENT] 3.01/1.51 || (13) YES 3.01/1.51 || (14) QDP 3.01/1.51 || (15) UsableRulesProof [EQUIVALENT] 3.01/1.51 || (16) QDP 3.01/1.51 || (17) QReductionProof [EQUIVALENT] 3.01/1.51 || (18) QDP 3.01/1.51 || (19) QDPSizeChangeProof [EQUIVALENT] 3.01/1.51 || (20) YES 3.01/1.51 || (21) QDP 3.01/1.51 || (22) UsableRulesProof [EQUIVALENT] 3.01/1.51 || (23) QDP 3.01/1.51 || (24) QReductionProof [EQUIVALENT] 3.01/1.51 || (25) QDP 3.01/1.51 || (26) QDPOrderProof [EQUIVALENT] 3.01/1.51 || (27) QDP
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Higher_Order_Rewriting_Union_Beta 2019-03-28 22.10