Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381714618
details
property
value
status
complete
benchmark
Ex15_Luc98_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n096.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
Wanda
configuration
FirstOrder
runtime (wallclock)
0.202722072601 seconds
cpu usage
0.185079054
max memory
9191424.0
stage attributes
key
value
output-size
8968
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_FirstOrder /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES We consider the system theBenchmark. We are asked to determine termination of the following first-order TRS. 0 : [] --> o activate : [o] --> o add : [o * o] --> o and : [o * o] --> o cons : [o * o] --> o false : [] --> o first : [o * o] --> o from : [o] --> o if : [o * o * o] --> o n!6220!6220add : [o * o] --> o n!6220!6220first : [o * o] --> o n!6220!6220from : [o] --> o n!6220!6220s : [o] --> o nil : [] --> o s : [o] --> o true : [] --> o and(true, X) => activate(X) and(false, X) => false if(true, X, Y) => activate(X) if(false, X, Y) => activate(Y) add(0, X) => activate(X) add(s(X), Y) => s(n!6220!6220add(activate(X), activate(Y))) first(0, X) => nil first(s(X), cons(Y, Z)) => cons(activate(Y), n!6220!6220first(activate(X), activate(Z))) from(X) => cons(activate(X), n!6220!6220from(n!6220!6220s(activate(X)))) add(X, Y) => n!6220!6220add(X, Y) first(X, Y) => n!6220!6220first(X, Y) from(X) => n!6220!6220from(X) s(X) => n!6220!6220s(X) activate(n!6220!6220add(X, Y)) => add(X, Y) activate(n!6220!6220first(X, Y)) => first(X, Y) activate(n!6220!6220from(X)) => from(X) activate(n!6220!6220s(X)) => s(X) activate(X) => X We use the dependency pair framework as described in [Kop12, Ch. 6/7], with static dependency pairs (see [KusIsoSakBla09] and the adaptation for AFSMs in [Kop12, Ch. 7.8]). We thus obtain the following dependency pair problem (P_0, R_0, minimal, formative): Dependency Pairs P_0: 0] and#(true, X) =#> activate#(X) 1] if#(true, X, Y) =#> activate#(X) 2] if#(false, X, Y) =#> activate#(Y) 3] add#(0, X) =#> activate#(X) 4] add#(s(X), Y) =#> s#(n!6220!6220add(activate(X), activate(Y))) 5] add#(s(X), Y) =#> activate#(X) 6] add#(s(X), Y) =#> activate#(Y) 7] first#(s(X), cons(Y, Z)) =#> activate#(Y) 8] first#(s(X), cons(Y, Z)) =#> activate#(X) 9] first#(s(X), cons(Y, Z)) =#> activate#(Z) 10] from#(X) =#> activate#(X) 11] from#(X) =#> activate#(X) 12] activate#(n!6220!6220add(X, Y)) =#> add#(X, Y) 13] activate#(n!6220!6220first(X, Y)) =#> first#(X, Y) 14] activate#(n!6220!6220from(X)) =#> from#(X) 15] activate#(n!6220!6220s(X)) =#> s#(X) Rules R_0: and(true, X) => activate(X) and(false, X) => false if(true, X, Y) => activate(X) if(false, X, Y) => activate(Y) add(0, X) => activate(X) add(s(X), Y) => s(n!6220!6220add(activate(X), activate(Y))) first(0, X) => nil first(s(X), cons(Y, Z)) => cons(activate(Y), n!6220!6220first(activate(X), activate(Z))) from(X) => cons(activate(X), n!6220!6220from(n!6220!6220s(activate(X)))) add(X, Y) => n!6220!6220add(X, Y) first(X, Y) => n!6220!6220first(X, Y) from(X) => n!6220!6220from(X) s(X) => n!6220!6220s(X) activate(n!6220!6220add(X, Y)) => add(X, Y) activate(n!6220!6220first(X, Y)) => first(X, Y) activate(n!6220!6220from(X)) => from(X) activate(n!6220!6220s(X)) => s(X) activate(X) => X Thus, the original system is terminating if (P_0, R_0, minimal, formative) is finite. We consider the dependency pair problem (P_0, R_0, minimal, formative). We place the elements of P in a dependency graph approximation G (see e.g. [Kop12, Thm. 7.27, 7.29], as follows: * 0 : 12, 13, 14, 15 * 1 : 12, 13, 14, 15 * 2 : 12, 13, 14, 15
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472