Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381711754
details
property
value
status
complete
benchmark
ma96.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n190.star.cs.uiowa.edu
space
Rubio_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.197921991348 seconds
cpu usage
0.200780402
max memory
7385088.0
stage attributes
key
value
output-size
26580
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR K L Lp S Sp T Tp X Xp Y Z) (RULES and(false,false) -> false and(false,true) -> false and(true,false) -> false and(true,true) -> true eq(apply(T,S),apply(Tp,Sp)) -> and(eq(T,Tp),eq(S,Sp)) eq(apply(T,S),lambda(X,Tp)) -> false eq(apply(T,S),var(L)) -> false eq(cons(T,L),cons(Tp,Lp)) -> and(eq(T,Tp),eq(L,Lp)) eq(cons(T,L),nil) -> false eq(lambda(X,T),apply(Tp,Sp)) -> false eq(lambda(X,T),lambda(Xp,Tp)) -> and(eq(T,Tp),eq(X,Xp)) eq(lambda(X,T),var(L)) -> false eq(nil,cons(T,L)) -> false eq(nil,nil) -> true eq(var(L),apply(T,S)) -> false eq(var(L),lambda(X,T)) -> false eq(var(L),var(Lp)) -> eq(L,Lp) if(false,var(K),var(L)) -> var(L) if(true,var(K),var(L)) -> var(K) ren(var(L),var(K),var(Lp)) -> if(eq(L,Lp),var(K),var(Lp)) ren(X,Y,apply(T,S)) -> apply(ren(X,Y,T),ren(X,Y,S)) ren(X,Y,lambda(Z,T)) -> lambda(var(cons(X,cons(Y,cons(lambda(Z,T),nil)))),ren(X,Y,ren(Z,var(cons(X,cons(Y,cons(lambda(Z,T),nil)))),T))) ) Problem 1: Innermost Equivalent Processor: -> Rules: and(false,false) -> false and(false,true) -> false and(true,false) -> false and(true,true) -> true eq(apply(T,S),apply(Tp,Sp)) -> and(eq(T,Tp),eq(S,Sp)) eq(apply(T,S),lambda(X,Tp)) -> false eq(apply(T,S),var(L)) -> false eq(cons(T,L),cons(Tp,Lp)) -> and(eq(T,Tp),eq(L,Lp)) eq(cons(T,L),nil) -> false eq(lambda(X,T),apply(Tp,Sp)) -> false eq(lambda(X,T),lambda(Xp,Tp)) -> and(eq(T,Tp),eq(X,Xp)) eq(lambda(X,T),var(L)) -> false eq(nil,cons(T,L)) -> false eq(nil,nil) -> true eq(var(L),apply(T,S)) -> false eq(var(L),lambda(X,T)) -> false eq(var(L),var(Lp)) -> eq(L,Lp) if(false,var(K),var(L)) -> var(L) if(true,var(K),var(L)) -> var(K) ren(var(L),var(K),var(Lp)) -> if(eq(L,Lp),var(K),var(Lp)) ren(X,Y,apply(T,S)) -> apply(ren(X,Y,T),ren(X,Y,S)) ren(X,Y,lambda(Z,T)) -> lambda(var(cons(X,cons(Y,cons(lambda(Z,T),nil)))),ren(X,Y,ren(Z,var(cons(X,cons(Y,cons(lambda(Z,T),nil)))),T))) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: EQ(apply(T,S),apply(Tp,Sp)) -> AND(eq(T,Tp),eq(S,Sp)) EQ(apply(T,S),apply(Tp,Sp)) -> EQ(S,Sp) EQ(apply(T,S),apply(Tp,Sp)) -> EQ(T,Tp) EQ(cons(T,L),cons(Tp,Lp)) -> AND(eq(T,Tp),eq(L,Lp)) EQ(cons(T,L),cons(Tp,Lp)) -> EQ(L,Lp) EQ(cons(T,L),cons(Tp,Lp)) -> EQ(T,Tp) EQ(lambda(X,T),lambda(Xp,Tp)) -> AND(eq(T,Tp),eq(X,Xp)) EQ(lambda(X,T),lambda(Xp,Tp)) -> EQ(T,Tp) EQ(lambda(X,T),lambda(Xp,Tp)) -> EQ(X,Xp) EQ(var(L),var(Lp)) -> EQ(L,Lp) REN(var(L),var(K),var(Lp)) -> EQ(L,Lp) REN(var(L),var(K),var(Lp)) -> IF(eq(L,Lp),var(K),var(Lp)) REN(X,Y,apply(T,S)) -> REN(X,Y,S) REN(X,Y,apply(T,S)) -> REN(X,Y,T) REN(X,Y,lambda(Z,T)) -> REN(X,Y,ren(Z,var(cons(X,cons(Y,cons(lambda(Z,T),nil)))),T)) REN(X,Y,lambda(Z,T)) -> REN(Z,var(cons(X,cons(Y,cons(lambda(Z,T),nil)))),T) -> Rules: and(false,false) -> false and(false,true) -> false and(true,false) -> false and(true,true) -> true eq(apply(T,S),apply(Tp,Sp)) -> and(eq(T,Tp),eq(S,Sp)) eq(apply(T,S),lambda(X,Tp)) -> false eq(apply(T,S),var(L)) -> false eq(cons(T,L),cons(Tp,Lp)) -> and(eq(T,Tp),eq(L,Lp)) eq(cons(T,L),nil) -> false eq(lambda(X,T),apply(Tp,Sp)) -> false eq(lambda(X,T),lambda(Xp,Tp)) -> and(eq(T,Tp),eq(X,Xp)) eq(lambda(X,T),var(L)) -> false eq(nil,cons(T,L)) -> false eq(nil,nil) -> true
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472