details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.237655878067 seconds
cpu usage	0.171956269
max memory	1.839104E7

stage attributes

key	value
output-size	262335
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR v_NonEmpty:S m:S n:S) (RULES BIT0(0) -> 0 EVEN(BIT0(n:S)) -> T EVEN(NUMERAL(n:S)) -> EVEN(n:S) EVEN(0) -> T EVEN(BIT1(n:S)) -> F NUMERAL(0) -> 0 ODD(BIT0(n:S)) -> F ODD(NUMERAL(n:S)) -> ODD(n:S) ODD(0) -> F ODD(BIT1(n:S)) -> T PRE(BIT0(n:S)) -> if(eq(n:S,0),0,BIT1(PRE(n:S))) PRE(NUMERAL(n:S)) -> NUMERAL(PRE(n:S)) PRE(0) -> 0 PRE(BIT1(n:S)) -> BIT0(n:S) SUC(BIT0(n:S)) -> BIT1(n:S) SUC(NUMERAL(n:S)) -> NUMERAL(SUC(n:S)) SUC(0) -> BIT1(0) SUC(BIT1(n:S)) -> BIT0(SUC(n:S)) eq(BIT0(m:S),BIT0(n:S)) -> eq(m:S,n:S) eq(BIT0(m:S),BIT1(n:S)) -> F eq(BIT0(n:S),0) -> eq(n:S,0) eq(NUMERAL(m:S),NUMERAL(n:S)) -> eq(m:S,n:S) eq(0,BIT0(n:S)) -> eq(0,n:S) eq(0,0) -> T eq(0,BIT1(n:S)) -> F eq(BIT1(m:S),BIT0(n:S)) -> F eq(BIT1(m:S),BIT1(n:S)) -> eq(m:S,n:S) eq(BIT1(n:S),0) -> F exp(BIT0(m:S),BIT0(n:S)) -> mult(exp(BIT0(m:S),n:S),exp(BIT0(m:S),n:S)) exp(BIT0(m:S),0) -> BIT1(0) exp(BIT0(m:S),BIT1(n:S)) -> mult(mult(BIT0(m:S),exp(BIT0(m:S),n:S)),exp(BIT0(m:S),n:S)) exp(NUMERAL(m:S),NUMERAL(n:S)) -> NUMERAL(exp(m:S,n:S)) exp(0,BIT0(n:S)) -> mult(exp(0,n:S),exp(0,n:S)) exp(0,0) -> BIT1(0) exp(0,BIT1(n:S)) -> 0 exp(BIT1(m:S),BIT0(n:S)) -> mult(exp(BIT1(m:S),n:S),exp(BIT1(m:S),n:S)) exp(BIT1(m:S),0) -> BIT1(0) exp(BIT1(m:S),BIT1(n:S)) -> mult(mult(BIT1(m:S),exp(BIT1(m:S),n:S)),exp(BIT1(m:S),n:S)) ge(BIT0(n:S),BIT0(m:S)) -> ge(n:S,m:S) ge(BIT0(n:S),0) -> T ge(BIT0(n:S),BIT1(m:S)) -> gt(n:S,m:S) ge(NUMERAL(n:S),NUMERAL(m:S)) -> ge(n:S,m:S) ge(0,BIT0(n:S)) -> ge(0,n:S) ge(0,0) -> T ge(0,BIT1(n:S)) -> F ge(BIT1(n:S),BIT0(m:S)) -> ge(n:S,m:S) ge(BIT1(n:S),0) -> T ge(BIT1(n:S),BIT1(m:S)) -> ge(n:S,m:S) gt(BIT0(n:S),BIT0(m:S)) -> gt(n:S,m:S) gt(BIT0(n:S),0) -> gt(n:S,0) gt(BIT0(n:S),BIT1(m:S)) -> gt(n:S,m:S) gt(NUMERAL(n:S),NUMERAL(m:S)) -> gt(n:S,m:S) gt(0,BIT0(n:S)) -> F gt(0,0) -> F gt(0,BIT1(n:S)) -> F gt(BIT1(n:S),BIT0(m:S)) -> ge(n:S,m:S) gt(BIT1(n:S),0) -> T gt(BIT1(n:S),BIT1(m:S)) -> gt(n:S,m:S) le(BIT0(m:S),BIT0(n:S)) -> le(m:S,n:S) le(BIT0(m:S),BIT1(n:S)) -> le(m:S,n:S) le(BIT0(n:S),0) -> le(n:S,0) le(NUMERAL(m:S),NUMERAL(n:S)) -> le(m:S,n:S) le(0,BIT0(n:S)) -> T le(0,0) -> T le(0,BIT1(n:S)) -> T le(BIT1(m:S),BIT0(n:S)) -> lt(m:S,n:S) le(BIT1(m:S),BIT1(n:S)) -> le(m:S,n:S) le(BIT1(n:S),0) -> F lt(BIT0(m:S),BIT0(n:S)) -> lt(m:S,n:S) lt(BIT0(m:S),BIT1(n:S)) -> le(m:S,n:S) lt(BIT0(n:S),0) -> F lt(NUMERAL(m:S),NUMERAL(n:S)) -> lt(m:S,n:S) lt(0,BIT0(n:S)) -> lt(0,n:S) lt(0,0) -> F lt(0,BIT1(n:S)) -> T lt(BIT1(m:S),BIT0(n:S)) -> lt(m:S,n:S) lt(BIT1(m:S),BIT1(n:S)) -> lt(m:S,n:S) lt(BIT1(n:S),0) -> F minus(BIT0(m:S),BIT0(n:S)) -> BIT0(minus(m:S,n:S)) minus(BIT0(m:S),BIT1(n:S)) -> PRE(BIT0(minus(m:S,n:S))) minus(BIT0(n:S),0) -> BIT0(n:S) minus(NUMERAL(m:S),NUMERAL(n:S)) -> NUMERAL(minus(m:S,n:S)) minus(0,BIT0(n:S)) -> 0 minus(0,0) -> 0 minus(0,BIT1(n:S)) -> 0 minus(BIT1(m:S),BIT0(n:S)) -> if(le(n:S,m:S),BIT1(minus(m:S,n:S)),0) minus(BIT1(m:S),BIT1(n:S)) -> BIT0(minus(m:S,n:S)) minus(BIT1(n:S),0) -> BIT1(n:S) popout

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

job log

popout

actions

all output return to TRS Standard