Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381710029
details
property
value
status
complete
benchmark
IJCAR_18.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n085.star.cs.uiowa.edu
space
AProVE_04
run statistics
property
value
solver
ttt2-1.17+nonreach
configuration
ttt2-1.17+nonreach
runtime (wallclock)
1.17324495316 seconds
cpu usage
3.080661369
max memory
3.02415872E8
stage attributes
key
value
output-size
17259
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: plus(x,0()) -> x plus(0(),y) -> y plus(s(x),y) -> s(plus(x,y)) times(0(),y) -> 0() times(s(0()),y) -> y times(s(x),y) -> plus(y,times(x,y)) div(0(),y) -> 0() div(x,y) -> quot(x,y,y) quot(0(),s(y),z) -> 0() quot(s(x),s(y),z) -> quot(x,y,z) quot(x,0(),s(z)) -> s(div(x,s(z))) div(div(x,y),z) -> div(x,times(y,z)) eq(0(),0()) -> true() eq(s(x),0()) -> false() eq(0(),s(y)) -> false() eq(s(x),s(y)) -> eq(x,y) divides(y,x) -> eq(x,times(div(x,y),y)) prime(s(s(x))) -> pr(s(s(x)),s(x)) pr(x,s(0())) -> true() pr(x,s(s(y))) -> if(divides(s(s(y)),x),x,s(y)) if(true(),x,y) -> false() if(false(),x,y) -> pr(x,y) Proof: DP Processor: DPs: plus#(s(x),y) -> plus#(x,y) times#(s(x),y) -> times#(x,y) times#(s(x),y) -> plus#(y,times(x,y)) div#(x,y) -> quot#(x,y,y) quot#(s(x),s(y),z) -> quot#(x,y,z) quot#(x,0(),s(z)) -> div#(x,s(z)) div#(div(x,y),z) -> times#(y,z) div#(div(x,y),z) -> div#(x,times(y,z)) eq#(s(x),s(y)) -> eq#(x,y) divides#(y,x) -> div#(x,y) divides#(y,x) -> times#(div(x,y),y) divides#(y,x) -> eq#(x,times(div(x,y),y)) prime#(s(s(x))) -> pr#(s(s(x)),s(x)) pr#(x,s(s(y))) -> divides#(s(s(y)),x) pr#(x,s(s(y))) -> if#(divides(s(s(y)),x),x,s(y)) if#(false(),x,y) -> pr#(x,y) TRS: plus(x,0()) -> x plus(0(),y) -> y plus(s(x),y) -> s(plus(x,y)) times(0(),y) -> 0() times(s(0()),y) -> y times(s(x),y) -> plus(y,times(x,y)) div(0(),y) -> 0() div(x,y) -> quot(x,y,y) quot(0(),s(y),z) -> 0() quot(s(x),s(y),z) -> quot(x,y,z) quot(x,0(),s(z)) -> s(div(x,s(z))) div(div(x,y),z) -> div(x,times(y,z)) eq(0(),0()) -> true() eq(s(x),0()) -> false() eq(0(),s(y)) -> false() eq(s(x),s(y)) -> eq(x,y) divides(y,x) -> eq(x,times(div(x,y),y)) prime(s(s(x))) -> pr(s(s(x)),s(x)) pr(x,s(0())) -> true() pr(x,s(s(y))) -> if(divides(s(s(y)),x),x,s(y)) if(true(),x,y) -> false() if(false(),x,y) -> pr(x,y) TDG Processor: DPs: plus#(s(x),y) -> plus#(x,y) times#(s(x),y) -> times#(x,y) times#(s(x),y) -> plus#(y,times(x,y)) div#(x,y) -> quot#(x,y,y) quot#(s(x),s(y),z) -> quot#(x,y,z) quot#(x,0(),s(z)) -> div#(x,s(z)) div#(div(x,y),z) -> times#(y,z) div#(div(x,y),z) -> div#(x,times(y,z)) eq#(s(x),s(y)) -> eq#(x,y) divides#(y,x) -> div#(x,y) divides#(y,x) -> times#(div(x,y),y) divides#(y,x) -> eq#(x,times(div(x,y),y)) prime#(s(s(x))) -> pr#(s(s(x)),s(x)) pr#(x,s(s(y))) -> divides#(s(s(y)),x) pr#(x,s(s(y))) -> if#(divides(s(s(y)),x),x,s(y)) if#(false(),x,y) -> pr#(x,y) TRS: plus(x,0()) -> x plus(0(),y) -> y plus(s(x),y) -> s(plus(x,y)) times(0(),y) -> 0() times(s(0()),y) -> y times(s(x),y) -> plus(y,times(x,y)) div(0(),y) -> 0()
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472