Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381711753
details
property
value
status
complete
benchmark
cime5.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n002.star.cs.uiowa.edu
space
Secret_05_TRS
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
2.51384305954 seconds
cpu usage
2.528566489
max memory
1.3266944E7
stage attributes
key
value
output-size
217101
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 A B F F1 F2 Fs G1 G2 Gs Left NF Right V X X0 X1 Xs Ys) (RULES intersect'ii'in(cons(X,X0),cons(X,X1)) -> intersect'ii'out intersect'ii'in(cons(X0,Xs),Ys) -> u'2'1(intersect'ii'in(Xs,Ys)) intersect'ii'in(Xs,cons(X0,Ys)) -> u'1'1(intersect'ii'in(Xs,Ys)) reduce'ii'in(sequent(cons(if(A,B),Fs),Gs),NF) -> u'3'1(reduce'ii'in(sequent(cons(x'2b(x'2d(B),A),Fs),Gs),NF)) reduce'ii'in(sequent(cons(iff(A,B),Fs),Gs),NF) -> u'4'1(reduce'ii'in(sequent(cons(x'2a(if(A,B),if(B,A)),Fs),Gs),NF)) reduce'ii'in(sequent(cons(p(V),Fs),Gs),sequent(Left,Right)) -> u'10'1(reduce'ii'in(sequent(Fs,Gs),sequent(cons(p(V),Left),Right))) reduce'ii'in(sequent(cons(x'2a(F1,F2),Fs),Gs),NF) -> u'5'1(reduce'ii'in(sequent(cons(F1,cons(F2,Fs)),Gs),NF)) reduce'ii'in(sequent(cons(x'2b(F1,F2),Fs),Gs),NF) -> u'6'1(reduce'ii'in(sequent(cons(F1,Fs),Gs),NF),F2,Fs,Gs,NF) reduce'ii'in(sequent(cons(x'2d(F1),Fs),Gs),NF) -> u'7'1(reduce'ii'in(sequent(Fs,cons(F1,Gs)),NF)) reduce'ii'in(sequent(nil,cons(p(V),Gs)),sequent(Left,Right)) -> u'14'1(reduce'ii'in(sequent(nil,Gs),sequent(Left,cons(p(V),Right)))) reduce'ii'in(sequent(nil,nil),sequent(F1,F2)) -> u'15'1(intersect'ii'in(F1,F2)) reduce'ii'in(sequent(Fs,cons(if(A,B),Gs)),NF) -> u'8'1(reduce'ii'in(sequent(Fs,cons(x'2b(x'2d(B),A),Gs)),NF)) reduce'ii'in(sequent(Fs,cons(iff(A,B),Gs)),NF) -> u'9'1(reduce'ii'in(sequent(Fs,cons(x'2a(if(A,B),if(B,A)),Gs)),NF)) reduce'ii'in(sequent(Fs,cons(x'2a(G1,G2),Gs)),NF) -> u'12'1(reduce'ii'in(sequent(Fs,cons(G1,Gs)),NF),Fs,G2,Gs,NF) reduce'ii'in(sequent(Fs,cons(x'2b(G1,G2),Gs)),NF) -> u'11'1(reduce'ii'in(sequent(Fs,cons(G1,cons(G2,Gs))),NF)) reduce'ii'in(sequent(Fs,cons(x'2d(G1),Gs)),NF) -> u'13'1(reduce'ii'in(sequent(cons(G1,Fs),Gs),NF)) tautology'i'in(F) -> u'16'1(reduce'ii'in(sequent(nil,cons(F,nil)),sequent(nil,nil))) u'1'1(intersect'ii'out) -> intersect'ii'out u'10'1(reduce'ii'out) -> reduce'ii'out u'11'1(reduce'ii'out) -> reduce'ii'out u'12'1(reduce'ii'out,Fs,G2,Gs,NF) -> u'12'2(reduce'ii'in(sequent(Fs,cons(G2,Gs)),NF)) u'12'2(reduce'ii'out) -> reduce'ii'out u'13'1(reduce'ii'out) -> reduce'ii'out u'14'1(reduce'ii'out) -> reduce'ii'out u'15'1(intersect'ii'out) -> reduce'ii'out u'16'1(reduce'ii'out) -> tautology'i'out u'2'1(intersect'ii'out) -> intersect'ii'out u'3'1(reduce'ii'out) -> reduce'ii'out u'4'1(reduce'ii'out) -> reduce'ii'out u'5'1(reduce'ii'out) -> reduce'ii'out u'6'1(reduce'ii'out,F2,Fs,Gs,NF) -> u'6'2(reduce'ii'in(sequent(cons(F2,Fs),Gs),NF)) u'6'2(reduce'ii'out) -> reduce'ii'out u'7'1(reduce'ii'out) -> reduce'ii'out u'8'1(reduce'ii'out) -> reduce'ii'out u'9'1(reduce'ii'out) -> reduce'ii'out ) Problem 1: Dependency Pairs Processor: -> Pairs: INTERSECT'II'IN(cons(X0,Xs),Ys) -> INTERSECT'II'IN(Xs,Ys) INTERSECT'II'IN(cons(X0,Xs),Ys) -> U'2'1(intersect'ii'in(Xs,Ys)) INTERSECT'II'IN(Xs,cons(X0,Ys)) -> INTERSECT'II'IN(Xs,Ys) INTERSECT'II'IN(Xs,cons(X0,Ys)) -> U'1'1(intersect'ii'in(Xs,Ys)) REDUCE'II'IN(sequent(cons(if(A,B),Fs),Gs),NF) -> REDUCE'II'IN(sequent(cons(x'2b(x'2d(B),A),Fs),Gs),NF) REDUCE'II'IN(sequent(cons(if(A,B),Fs),Gs),NF) -> U'3'1(reduce'ii'in(sequent(cons(x'2b(x'2d(B),A),Fs),Gs),NF)) REDUCE'II'IN(sequent(cons(iff(A,B),Fs),Gs),NF) -> REDUCE'II'IN(sequent(cons(x'2a(if(A,B),if(B,A)),Fs),Gs),NF) REDUCE'II'IN(sequent(cons(iff(A,B),Fs),Gs),NF) -> U'4'1(reduce'ii'in(sequent(cons(x'2a(if(A,B),if(B,A)),Fs),Gs),NF)) REDUCE'II'IN(sequent(cons(p(V),Fs),Gs),sequent(Left,Right)) -> REDUCE'II'IN(sequent(Fs,Gs),sequent(cons(p(V),Left),Right)) REDUCE'II'IN(sequent(cons(p(V),Fs),Gs),sequent(Left,Right)) -> U'10'1(reduce'ii'in(sequent(Fs,Gs),sequent(cons(p(V),Left),Right))) REDUCE'II'IN(sequent(cons(x'2a(F1,F2),Fs),Gs),NF) -> REDUCE'II'IN(sequent(cons(F1,cons(F2,Fs)),Gs),NF) REDUCE'II'IN(sequent(cons(x'2a(F1,F2),Fs),Gs),NF) -> U'5'1(reduce'ii'in(sequent(cons(F1,cons(F2,Fs)),Gs),NF)) REDUCE'II'IN(sequent(cons(x'2b(F1,F2),Fs),Gs),NF) -> REDUCE'II'IN(sequent(cons(F1,Fs),Gs),NF) REDUCE'II'IN(sequent(cons(x'2b(F1,F2),Fs),Gs),NF) -> U'6'1(reduce'ii'in(sequent(cons(F1,Fs),Gs),NF),F2,Fs,Gs,NF) REDUCE'II'IN(sequent(cons(x'2d(F1),Fs),Gs),NF) -> REDUCE'II'IN(sequent(Fs,cons(F1,Gs)),NF) REDUCE'II'IN(sequent(cons(x'2d(F1),Fs),Gs),NF) -> U'7'1(reduce'ii'in(sequent(Fs,cons(F1,Gs)),NF)) REDUCE'II'IN(sequent(nil,cons(p(V),Gs)),sequent(Left,Right)) -> REDUCE'II'IN(sequent(nil,Gs),sequent(Left,cons(p(V),Right))) REDUCE'II'IN(sequent(nil,cons(p(V),Gs)),sequent(Left,Right)) -> U'14'1(reduce'ii'in(sequent(nil,Gs),sequent(Left,cons(p(V),Right)))) REDUCE'II'IN(sequent(nil,nil),sequent(F1,F2)) -> INTERSECT'II'IN(F1,F2) REDUCE'II'IN(sequent(nil,nil),sequent(F1,F2)) -> U'15'1(intersect'ii'in(F1,F2)) REDUCE'II'IN(sequent(Fs,cons(if(A,B),Gs)),NF) -> REDUCE'II'IN(sequent(Fs,cons(x'2b(x'2d(B),A),Gs)),NF) REDUCE'II'IN(sequent(Fs,cons(if(A,B),Gs)),NF) -> U'8'1(reduce'ii'in(sequent(Fs,cons(x'2b(x'2d(B),A),Gs)),NF)) REDUCE'II'IN(sequent(Fs,cons(iff(A,B),Gs)),NF) -> REDUCE'II'IN(sequent(Fs,cons(x'2a(if(A,B),if(B,A)),Gs)),NF) REDUCE'II'IN(sequent(Fs,cons(iff(A,B),Gs)),NF) -> U'9'1(reduce'ii'in(sequent(Fs,cons(x'2a(if(A,B),if(B,A)),Gs)),NF)) REDUCE'II'IN(sequent(Fs,cons(x'2a(G1,G2),Gs)),NF) -> REDUCE'II'IN(sequent(Fs,cons(G1,Gs)),NF) REDUCE'II'IN(sequent(Fs,cons(x'2a(G1,G2),Gs)),NF) -> U'12'1(reduce'ii'in(sequent(Fs,cons(G1,Gs)),NF),Fs,G2,Gs,NF) REDUCE'II'IN(sequent(Fs,cons(x'2b(G1,G2),Gs)),NF) -> REDUCE'II'IN(sequent(Fs,cons(G1,cons(G2,Gs))),NF) REDUCE'II'IN(sequent(Fs,cons(x'2b(G1,G2),Gs)),NF) -> U'11'1(reduce'ii'in(sequent(Fs,cons(G1,cons(G2,Gs))),NF)) REDUCE'II'IN(sequent(Fs,cons(x'2d(G1),Gs)),NF) -> REDUCE'II'IN(sequent(cons(G1,Fs),Gs),NF) REDUCE'II'IN(sequent(Fs,cons(x'2d(G1),Gs)),NF) -> U'13'1(reduce'ii'in(sequent(cons(G1,Fs),Gs),NF)) TAUTOLOGY'I'IN(F) -> REDUCE'II'IN(sequent(nil,cons(F,nil)),sequent(nil,nil)) TAUTOLOGY'I'IN(F) -> U'16'1(reduce'ii'in(sequent(nil,cons(F,nil)),sequent(nil,nil))) U'12'1(reduce'ii'out,Fs,G2,Gs,NF) -> REDUCE'II'IN(sequent(Fs,cons(G2,Gs)),NF) U'12'1(reduce'ii'out,Fs,G2,Gs,NF) -> U'12'2(reduce'ii'in(sequent(Fs,cons(G2,Gs)),NF)) U'6'1(reduce'ii'out,F2,Fs,Gs,NF) -> REDUCE'II'IN(sequent(cons(F2,Fs),Gs),NF) U'6'1(reduce'ii'out,F2,Fs,Gs,NF) -> U'6'2(reduce'ii'in(sequent(cons(F2,Fs),Gs),NF)) -> Rules: intersect'ii'in(cons(X,X0),cons(X,X1)) -> intersect'ii'out intersect'ii'in(cons(X0,Xs),Ys) -> u'2'1(intersect'ii'in(Xs,Ys)) intersect'ii'in(Xs,cons(X0,Ys)) -> u'1'1(intersect'ii'in(Xs,Ys)) reduce'ii'in(sequent(cons(if(A,B),Fs),Gs),NF) -> u'3'1(reduce'ii'in(sequent(cons(x'2b(x'2d(B),A),Fs),Gs),NF)) reduce'ii'in(sequent(cons(iff(A,B),Fs),Gs),NF) -> u'4'1(reduce'ii'in(sequent(cons(x'2a(if(A,B),if(B,A)),Fs),Gs),NF)) reduce'ii'in(sequent(cons(p(V),Fs),Gs),sequent(Left,Right)) -> u'10'1(reduce'ii'in(sequent(Fs,Gs),sequent(cons(p(V),Left),Right))) reduce'ii'in(sequent(cons(x'2a(F1,F2),Fs),Gs),NF) -> u'5'1(reduce'ii'in(sequent(cons(F1,cons(F2,Fs)),Gs),NF)) reduce'ii'in(sequent(cons(x'2b(F1,F2),Fs),Gs),NF) -> u'6'1(reduce'ii'in(sequent(cons(F1,Fs),Gs),NF),F2,Fs,Gs,NF) reduce'ii'in(sequent(cons(x'2d(F1),Fs),Gs),NF) -> u'7'1(reduce'ii'in(sequent(Fs,cons(F1,Gs)),NF)) reduce'ii'in(sequent(nil,cons(p(V),Gs)),sequent(Left,Right)) -> u'14'1(reduce'ii'in(sequent(nil,Gs),sequent(Left,cons(p(V),Right))))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472