details

property	value
status	complete
benchmark	kabasci02.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n113.star.cs.uiowa.edu
space	AProVE_07

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	5.33991885185 seconds
cpu usage	19.83856625
max memory	1.510486016E9

stage attributes

key	value
output-size	44970
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_ttt2 /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: p(0()) -> 0() p(s(x)) -> x plus(x,0()) -> x plus(0(),y) -> y plus(s(x),y) -> s(plus(x,y)) plus(s(x),y) -> s(plus(p(s(x)),y)) plus(x,s(y)) -> s(plus(x,p(s(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(zero(y),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(zero(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) zero(div(x,x)) -> x zero(divides(x,x)) -> x zero(times(x,x)) -> x zero(quot(x,x,x)) -> x zero(s(x)) -> if(eq(x,s(0())),plus(zero(0()),0()),s(plus(0(),zero(0())))) Proof: DP Processor: DPs: plus#(s(x),y) -> plus#(x,y) plus#(s(x),y) -> p#(s(x)) plus#(s(x),y) -> plus#(p(s(x)),y) plus#(x,s(y)) -> p#(s(y)) plus#(x,s(y)) -> plus#(x,p(s(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) -> zero#(y) div#(div(x,y),z) -> times#(zero(y),z) div#(div(x,y),z) -> div#(x,times(zero(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) zero#(s(x)) -> plus#(0(),zero(0())) zero#(s(x)) -> zero#(0()) zero#(s(x)) -> plus#(zero(0()),0()) zero#(s(x)) -> eq#(x,s(0())) zero#(s(x)) -> if#(eq(x,s(0())),plus(zero(0()),0()),s(plus(0(),zero(0())))) TRS: p(0()) -> 0() p(s(x)) -> x plus(x,0()) -> x plus(0(),y) -> y plus(s(x),y) -> s(plus(x,y)) plus(s(x),y) -> s(plus(p(s(x)),y)) plus(x,s(y)) -> s(plus(x,p(s(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(zero(y),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(zero(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) zero(div(x,x)) -> x zero(divides(x,x)) -> x zero(times(x,x)) -> x popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Standard