Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904915
details
property
value
status
complete
benchmark
vangelder_typed.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n040.star.cs.uiowa.edu
space
Frederiksen_Glenstrup
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
294.235626936 seconds
cpu usage
903.334292941
max memory
1.875234816E9
stage attributes
key
value
output-size
6361
starexec-result
MAYBE
output
/export/starexec/sandbox2/solver/bin/starexec_run_tct_rci /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE * Step 1: Failure MAYBE + Considered Problem: - Strict TRS: e(Cons(A(),Cons(x,xs)),b) -> False() e(Cons(A(),Nil()),b) -> e[Match][Cons][Ite][True][Match](A(),Nil(),b) e(Cons(B(),Cons(x,xs)),b) -> False() e(Cons(B(),Nil()),b) -> False() e(Cons(F(),Cons(x,xs)),b) -> False() e(Cons(F(),Nil()),b) -> False() e(Cons(T(),Cons(x,xs)),b) -> False() e(Cons(T(),Nil()),b) -> False() e(Nil(),b) -> False() equal(A(),A()) -> True() equal(A(),B()) -> False() equal(A(),F()) -> False() equal(A(),T()) -> False() equal(B(),A()) -> False() equal(B(),B()) -> True() equal(B(),F()) -> False() equal(B(),T()) -> False() equal(F(),A()) -> False() equal(F(),B()) -> False() equal(F(),F()) -> True() equal(F(),T()) -> False() equal(T(),A()) -> False() equal(T(),B()) -> False() equal(T(),F()) -> False() equal(T(),T()) -> True() goal(x,y) -> q(x,y) head(Cons(x,xs)) -> x notEmpty(Cons(x,xs)) -> True() notEmpty(Nil()) -> False() p(x,y) -> p[Ite](e(x,y),x,y) q(x,y) -> q[Ite](e(x,y),x,y) r(x,y) -> r[Ite](e(x,y),x,y) t(x,y) -> t[Ite](e(x,y),x,y) - Weak TRS: and(False(),False()) -> False() and(False(),True()) -> False() and(True(),False()) -> False() and(True(),True()) -> True() p[Ite](False(),x,Cons(A(),xs)) -> False() p[Ite](False(),x,Cons(B(),xs)) -> False() p[Ite](False(),x,Cons(T(),xs)) -> False() p[Ite](False(),x',Cons(F(),xs)) -> and(r(x',Cons(F(),xs)),p(x',xs)) p[Ite](True(),x,y) -> True() q[Ite](False(),x,Cons(A(),Cons(A(),xs))) -> False() q[Ite](False(),x,Cons(A(),Cons(B(),xs))) -> False() q[Ite](False(),x,Cons(A(),Cons(F(),xs))) -> False() q[Ite](False(),x,Cons(A(),Cons(T(),xs))) -> False() q[Ite](False(),x,Cons(B(),Cons(A(),xs))) -> False() q[Ite](False(),x,Cons(B(),Cons(B(),xs))) -> False() q[Ite](False(),x,Cons(B(),Cons(F(),xs))) -> False() q[Ite](False(),x,Cons(B(),Cons(T(),xs))) -> False() q[Ite](False(),x,Cons(F(),Cons(A(),xs))) -> False() q[Ite](False(),x,Cons(F(),Cons(B(),xs))) -> False() q[Ite](False(),x,Cons(F(),Cons(T(),xs))) -> False() q[Ite](False(),x,Cons(T(),Cons(A(),xs))) -> False() q[Ite](False(),x,Cons(T(),Cons(B(),xs))) -> False() q[Ite](False(),x,Cons(T(),Cons(F(),xs))) -> False() q[Ite](False(),x,Cons(T(),Cons(T(),xs))) -> False() q[Ite](False(),x',Cons(A(),Nil())) -> q[Ite][False][Ite](and(True() ,and(False(),and(False(),equal(head(Nil()),F())))) ,x' ,Cons(A(),Nil())) q[Ite](False(),x',Cons(B(),Nil())) -> q[Ite][False][Ite](and(True() ,and(False(),and(False(),equal(head(Nil()),F())))) ,x' ,Cons(B(),Nil())) q[Ite](False(),x',Cons(F(),Cons(F(),xs))) -> q[Ite][False][Ite][True][Ite](and(p(x',Cons(F(),Cons(F(),xs))) ,q(x',Cons(F(),xs))) ,x' ,Cons(F(),Cons(F(),xs))) q[Ite](False(),x',Cons(F(),Nil())) -> q[Ite][False][Ite](and(True() ,and(True(),and(False(),equal(head(Nil()),F())))) ,x' ,Cons(F(),Nil())) q[Ite](False(),x',Cons(T(),Nil())) -> q[Ite][False][Ite](and(True() ,and(False(),and(False(),equal(head(Nil()),F())))) ,x' ,Cons(T(),Nil())) q[Ite](True(),x,y) -> True() q[Ite][False][Ite](False(),x,y) -> False() q[Ite][False][Ite](True(),x',Cons(x,xs)) -> q[Ite][False][Ite][True][Ite](and(p(x',Cons(x,xs)),q(x',xs)) ,x' ,Cons(x,xs)) r[Ite](False(),x,Cons(A(),xs)) -> False() r[Ite](False(),x,Cons(B(),xs)) -> False() r[Ite](False(),x,Cons(T(),xs)) -> False() r[Ite](False(),x',Cons(F(),xs)) -> r[Ite][False][Ite][True][Ite](and(q(x',xs),r(x',xs)),x',Cons(F(),xs)) r[Ite](True(),x,y) -> True() t[Ite](False(),x,y) -> True() t[Ite](True(),x,y) -> True()
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807