Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
HRS union beta 16688 pair #381734875
details
property
value
status
complete
benchmark
Applicative_first_order_05__#3.48.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n110.star.cs.uiowa.edu
space
Uncurried_Applicative_11
run statistics
property
value
solver
Wanda
configuration
HigherOrder
runtime (wallclock)
0.859378099442 seconds
cpu usage
1.722946419
max memory
7.9904768E7
stage attributes
key
value
output-size
11810
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_HigherOrder /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES We consider the system theBenchmark. Alphabet: 0 : [] --> b 1 : [] --> b c : [b] --> b cons : [c * d] --> d f : [b] --> a false : [] --> a filter : [c -> a * d] --> d filter2 : [a * c -> a * c * d] --> d g : [b * b] --> b if : [a * b * b] --> b map : [c -> c * d] --> d nil : [] --> d s : [b] --> b true : [] --> a Rules: f(0) => true f(1) => false f(s(x)) => f(x) if(true, s(x), s(y)) => s(x) if(false, s(x), s(y)) => s(y) g(x, c(y)) => c(g(x, y)) g(x, c(y)) => g(x, if(f(x), c(g(s(x), y)), c(y))) map(h, nil) => nil map(h, cons(x, y)) => cons(h x, map(h, y)) filter(h, nil) => nil filter(h, cons(x, y)) => filter2(h x, h, x, y) filter2(true, h, x, y) => cons(x, filter(h, y)) filter2(false, h, x, y) => filter(h, y) This AFS is converted to an AFSM simply by replacing all free variables by meta-variables (with arity 0). We observe that the rules contain a first-order subset: f(0) => true f(1) => false f(s(X)) => f(X) if(true, s(X), s(Y)) => s(X) if(false, s(X), s(Y)) => s(Y) g(X, c(Y)) => c(g(X, Y)) g(X, c(Y)) => g(X, if(f(X), c(g(s(X), Y)), c(Y))) Moreover, the system is finitely branching. 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 Ce-terminating when seen as a many-sorted first-order TRS. According to the external first-order termination prover, this system is indeed Ce-terminating: || proof of resources/system.trs || # AProVE Commit ID: d84c10301d352dfd14de2104819581f4682260f5 fuhs 20130616 || || || Termination w.r.t. Q of the given QTRS could be proven: || || (0) QTRS || (1) DependencyPairsProof [EQUIVALENT] || (2) QDP || (3) DependencyGraphProof [EQUIVALENT] || (4) AND || (5) QDP || (6) UsableRulesProof [EQUIVALENT] || (7) QDP || (8) QDPSizeChangeProof [EQUIVALENT] || (9) YES || (10) QDP || (11) UsableRulesProof [EQUIVALENT] || (12) QDP || (13) QDPSizeChangeProof [EQUIVALENT] || (14) YES || || || ---------------------------------------- || || (0) || Obligation: || Q restricted rewrite system: || The TRS R consists of the following rules: || || f(0) -> true || f(1) -> false || f(s(%X)) -> f(%X) || if(true, s(%X), s(%Y)) -> s(%X) || if(false, s(%X), s(%Y)) -> s(%Y) || g(%X, c(%Y)) -> c(g(%X, %Y)) || g(%X, c(%Y)) -> g(%X, if(f(%X), c(g(s(%X), %Y)), c(%Y))) || ~PAIR(%X, %Y) -> %X || ~PAIR(%X, %Y) -> %Y || || Q is empty. ||
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to HRS union beta 16688