Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516964706
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
n090.star.cs.uiowa.edu
space
Rubio_04
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.280844926834 seconds
cpu usage
0.224220428
max memory
7450624.0
stage attributes
key
value
output-size
32476
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 v_NonEmpty:S K:S L:S Lp:S S:S Sp:S T:S Tp:S X:S Xp:S Y:S Z:S) (RULES and(ffalse,ffalse) -> ffalse and(ffalse,ttrue) -> ffalse and(ttrue,ffalse) -> ffalse and(ttrue,ttrue) -> ttrue eq(apply(T:S,S:S),apply(Tp:S,Sp:S)) -> and(eq(T:S,Tp:S),eq(S:S,Sp:S)) eq(apply(T:S,S:S),lambda(X:S,Tp:S)) -> ffalse eq(apply(T:S,S:S),var(L:S)) -> ffalse eq(cons(T:S,L:S),cons(Tp:S,Lp:S)) -> and(eq(T:S,Tp:S),eq(L:S,Lp:S)) eq(cons(T:S,L:S),nil) -> ffalse eq(lambda(X:S,T:S),apply(Tp:S,Sp:S)) -> ffalse eq(lambda(X:S,T:S),lambda(Xp:S,Tp:S)) -> and(eq(T:S,Tp:S),eq(X:S,Xp:S)) eq(lambda(X:S,T:S),var(L:S)) -> ffalse eq(nil,cons(T:S,L:S)) -> ffalse eq(nil,nil) -> ttrue eq(var(L:S),apply(T:S,S:S)) -> ffalse eq(var(L:S),lambda(X:S,T:S)) -> ffalse eq(var(L:S),var(Lp:S)) -> eq(L:S,Lp:S) if(ffalse,var(K:S),var(L:S)) -> var(L:S) if(ttrue,var(K:S),var(L:S)) -> var(K:S) ren(var(L:S),var(K:S),var(Lp:S)) -> if(eq(L:S,Lp:S),var(K:S),var(Lp:S)) ren(X:S,Y:S,apply(T:S,S:S)) -> apply(ren(X:S,Y:S,T:S),ren(X:S,Y:S,S:S)) ren(X:S,Y:S,lambda(Z:S,T:S)) -> lambda(var(cons(X:S,cons(Y:S,cons(lambda(Z:S,T:S),nil)))),ren(X:S,Y:S,ren(Z:S,var(cons(X:S,cons(Y:S,cons(lambda(Z:S,T:S),nil)))),T:S))) ) Problem 1: Innermost Equivalent Processor: -> Rules: and(ffalse,ffalse) -> ffalse and(ffalse,ttrue) -> ffalse and(ttrue,ffalse) -> ffalse and(ttrue,ttrue) -> ttrue eq(apply(T:S,S:S),apply(Tp:S,Sp:S)) -> and(eq(T:S,Tp:S),eq(S:S,Sp:S)) eq(apply(T:S,S:S),lambda(X:S,Tp:S)) -> ffalse eq(apply(T:S,S:S),var(L:S)) -> ffalse eq(cons(T:S,L:S),cons(Tp:S,Lp:S)) -> and(eq(T:S,Tp:S),eq(L:S,Lp:S)) eq(cons(T:S,L:S),nil) -> ffalse eq(lambda(X:S,T:S),apply(Tp:S,Sp:S)) -> ffalse eq(lambda(X:S,T:S),lambda(Xp:S,Tp:S)) -> and(eq(T:S,Tp:S),eq(X:S,Xp:S)) eq(lambda(X:S,T:S),var(L:S)) -> ffalse eq(nil,cons(T:S,L:S)) -> ffalse eq(nil,nil) -> ttrue eq(var(L:S),apply(T:S,S:S)) -> ffalse eq(var(L:S),lambda(X:S,T:S)) -> ffalse eq(var(L:S),var(Lp:S)) -> eq(L:S,Lp:S) if(ffalse,var(K:S),var(L:S)) -> var(L:S) if(ttrue,var(K:S),var(L:S)) -> var(K:S) ren(var(L:S),var(K:S),var(Lp:S)) -> if(eq(L:S,Lp:S),var(K:S),var(Lp:S)) ren(X:S,Y:S,apply(T:S,S:S)) -> apply(ren(X:S,Y:S,T:S),ren(X:S,Y:S,S:S)) ren(X:S,Y:S,lambda(Z:S,T:S)) -> lambda(var(cons(X:S,cons(Y:S,cons(lambda(Z:S,T:S),nil)))),ren(X:S,Y:S,ren(Z:S,var(cons(X:S,cons(Y:S,cons(lambda(Z:S,T:S),nil)))),T:S))) -> 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,S:S),apply(Tp:S,Sp:S)) -> AND(eq(T:S,Tp:S),eq(S:S,Sp:S)) EQ(apply(T:S,S:S),apply(Tp:S,Sp:S)) -> EQ(S:S,Sp:S) EQ(apply(T:S,S:S),apply(Tp:S,Sp:S)) -> EQ(T:S,Tp:S) EQ(cons(T:S,L:S),cons(Tp:S,Lp:S)) -> AND(eq(T:S,Tp:S),eq(L:S,Lp:S)) EQ(cons(T:S,L:S),cons(Tp:S,Lp:S)) -> EQ(L:S,Lp:S) EQ(cons(T:S,L:S),cons(Tp:S,Lp:S)) -> EQ(T:S,Tp:S) EQ(lambda(X:S,T:S),lambda(Xp:S,Tp:S)) -> AND(eq(T:S,Tp:S),eq(X:S,Xp:S)) EQ(lambda(X:S,T:S),lambda(Xp:S,Tp:S)) -> EQ(T:S,Tp:S) EQ(lambda(X:S,T:S),lambda(Xp:S,Tp:S)) -> EQ(X:S,Xp:S) EQ(var(L:S),var(Lp:S)) -> EQ(L:S,Lp:S) REN(var(L:S),var(K:S),var(Lp:S)) -> EQ(L:S,Lp:S) REN(var(L:S),var(K:S),var(Lp:S)) -> IF(eq(L:S,Lp:S),var(K:S),var(Lp:S)) REN(X:S,Y:S,apply(T:S,S:S)) -> REN(X:S,Y:S,S:S) REN(X:S,Y:S,apply(T:S,S:S)) -> REN(X:S,Y:S,T:S) REN(X:S,Y:S,lambda(Z:S,T:S)) -> REN(X:S,Y:S,ren(Z:S,var(cons(X:S,cons(Y:S,cons(lambda(Z:S,T:S),nil)))),T:S)) REN(X:S,Y:S,lambda(Z:S,T:S)) -> REN(Z:S,var(cons(X:S,cons(Y:S,cons(lambda(Z:S,T:S),nil)))),T:S) -> Rules: and(ffalse,ffalse) -> ffalse and(ffalse,ttrue) -> ffalse and(ttrue,ffalse) -> ffalse and(ttrue,ttrue) -> ttrue eq(apply(T:S,S:S),apply(Tp:S,Sp:S)) -> and(eq(T:S,Tp:S),eq(S:S,Sp:S)) eq(apply(T:S,S:S),lambda(X:S,Tp:S)) -> ffalse eq(apply(T:S,S:S),var(L:S)) -> ffalse eq(cons(T:S,L:S),cons(Tp:S,Lp:S)) -> and(eq(T:S,Tp:S),eq(L:S,Lp:S)) eq(cons(T:S,L:S),nil) -> ffalse eq(lambda(X:S,T:S),apply(Tp:S,Sp:S)) -> ffalse eq(lambda(X:S,T:S),lambda(Xp:S,Tp:S)) -> and(eq(T:S,Tp:S),eq(X:S,Xp:S)) eq(lambda(X:S,T:S),var(L:S)) -> ffalse eq(nil,cons(T:S,L:S)) -> ffalse eq(nil,nil) -> ttrue
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard