details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	79.3836050034 seconds
cpu usage	273.067218806
max memory	3.124559872E9

stage attributes

key	value
output-size	493433
starexec-result	MAYBE

output

/export/starexec/sandbox/solver/bin/starexec_run_ttt2 /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- failure 'Failure("No result of SMT solver - maybe due to some flag of the solver? or the solver was not found in PATH?")' in subprocess 45076 YES Problem: active(U11(tt(),V1,V2)) -> mark(U12(isNat(V1),V2)) active(U12(tt(),V2)) -> mark(U13(isNat(V2))) active(U13(tt())) -> mark(tt()) active(U21(tt(),V1)) -> mark(U22(isNat(V1))) active(U22(tt())) -> mark(tt()) active(U31(tt(),N)) -> mark(N) active(U41(tt(),M,N)) -> mark(s(plus(N,M))) active(and(tt(),X)) -> mark(X) active(isNat(0())) -> mark(tt()) active(isNat(plus(V1,V2))) -> mark(U11(and(isNatKind(V1),isNatKind(V2)),V1,V2)) active(isNat(s(V1))) -> mark(U21(isNatKind(V1),V1)) active(isNatKind(0())) -> mark(tt()) active(isNatKind(plus(V1,V2))) -> mark(and(isNatKind(V1),isNatKind(V2))) active(isNatKind(s(V1))) -> mark(isNatKind(V1)) active(plus(N,0())) -> mark(U31(and(isNat(N),isNatKind(N)),N)) active(plus(N,s(M))) -> mark(U41(and(and(isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N)) mark(U11(X1,X2,X3)) -> active(U11(mark(X1),X2,X3)) mark(tt()) -> active(tt()) mark(U12(X1,X2)) -> active(U12(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(U13(X)) -> active(U13(mark(X))) mark(U21(X1,X2)) -> active(U21(mark(X1),X2)) mark(U22(X)) -> active(U22(mark(X))) mark(U31(X1,X2)) -> active(U31(mark(X1),X2)) mark(U41(X1,X2,X3)) -> active(U41(mark(X1),X2,X3)) mark(s(X)) -> active(s(mark(X))) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(0()) -> active(0()) mark(isNatKind(X)) -> active(isNatKind(X)) U11(mark(X1),X2,X3) -> U11(X1,X2,X3) U11(X1,mark(X2),X3) -> U11(X1,X2,X3) U11(X1,X2,mark(X3)) -> U11(X1,X2,X3) U11(active(X1),X2,X3) -> U11(X1,X2,X3) U11(X1,active(X2),X3) -> U11(X1,X2,X3) U11(X1,X2,active(X3)) -> U11(X1,X2,X3) U12(mark(X1),X2) -> U12(X1,X2) U12(X1,mark(X2)) -> U12(X1,X2) U12(active(X1),X2) -> U12(X1,X2) U12(X1,active(X2)) -> U12(X1,X2) isNat(mark(X)) -> isNat(X) isNat(active(X)) -> isNat(X) U13(mark(X)) -> U13(X) U13(active(X)) -> U13(X) U21(mark(X1),X2) -> U21(X1,X2) U21(X1,mark(X2)) -> U21(X1,X2) U21(active(X1),X2) -> U21(X1,X2) U21(X1,active(X2)) -> U21(X1,X2) U22(mark(X)) -> U22(X) U22(active(X)) -> U22(X) U31(mark(X1),X2) -> U31(X1,X2) U31(X1,mark(X2)) -> U31(X1,X2) U31(active(X1),X2) -> U31(X1,X2) U31(X1,active(X2)) -> U31(X1,X2) U41(mark(X1),X2,X3) -> U41(X1,X2,X3) U41(X1,mark(X2),X3) -> U41(X1,X2,X3) U41(X1,X2,mark(X3)) -> U41(X1,X2,X3) U41(active(X1),X2,X3) -> U41(X1,X2,X3) U41(X1,active(X2),X3) -> U41(X1,X2,X3) U41(X1,X2,active(X3)) -> U41(X1,X2,X3) s(mark(X)) -> s(X) s(active(X)) -> s(X) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) plus(active(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) and(active(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) isNatKind(mark(X)) -> isNatKind(X) isNatKind(active(X)) -> isNatKind(X) Proof: DP Processor: DPs: active#(U11(tt(),V1,V2)) -> isNat#(V1) active#(U11(tt(),V1,V2)) -> U12#(isNat(V1),V2) active#(U11(tt(),V1,V2)) -> mark#(U12(isNat(V1),V2)) active#(U12(tt(),V2)) -> isNat#(V2) active#(U12(tt(),V2)) -> U13#(isNat(V2)) active#(U12(tt(),V2)) -> mark#(U13(isNat(V2))) active#(U13(tt())) -> mark#(tt()) active#(U21(tt(),V1)) -> isNat#(V1) active#(U21(tt(),V1)) -> U22#(isNat(V1)) active#(U21(tt(),V1)) -> mark#(U22(isNat(V1))) active#(U22(tt())) -> mark#(tt()) active#(U31(tt(),N)) -> mark#(N) active#(U41(tt(),M,N)) -> plus#(N,M) active#(U41(tt(),M,N)) -> s#(plus(N,M)) popout

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

job log

popout

actions

all output return to TRS Standard