/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: pred(s(x)) -> x minus(x,0()) -> x minus(x,s(y)) -> pred(minus(x,y)) quot(0(),s(y)) -> 0() quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) log(s(0())) -> 0() log(s(s(x))) -> s(log(s(quot(x,s(s(0())))))) Proof: DP Processor: DPs: minus#(x,s(y)) -> minus#(x,y) minus#(x,s(y)) -> pred#(minus(x,y)) quot#(s(x),s(y)) -> minus#(x,y) quot#(s(x),s(y)) -> quot#(minus(x,y),s(y)) log#(s(s(x))) -> quot#(x,s(s(0()))) log#(s(s(x))) -> log#(s(quot(x,s(s(0()))))) TRS: pred(s(x)) -> x minus(x,0()) -> x minus(x,s(y)) -> pred(minus(x,y)) quot(0(),s(y)) -> 0() quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) log(s(0())) -> 0() log(s(s(x))) -> s(log(s(quot(x,s(s(0())))))) TDG Processor: DPs: minus#(x,s(y)) -> minus#(x,y) minus#(x,s(y)) -> pred#(minus(x,y)) quot#(s(x),s(y)) -> minus#(x,y) quot#(s(x),s(y)) -> quot#(minus(x,y),s(y)) log#(s(s(x))) -> quot#(x,s(s(0()))) log#(s(s(x))) -> log#(s(quot(x,s(s(0()))))) TRS: pred(s(x)) -> x minus(x,0()) -> x minus(x,s(y)) -> pred(minus(x,y)) quot(0(),s(y)) -> 0() quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) log(s(0())) -> 0() log(s(s(x))) -> s(log(s(quot(x,s(s(0())))))) graph: log#(s(s(x))) -> log#(s(quot(x,s(s(0()))))) -> log#(s(s(x))) -> log#(s(quot(x,s(s(0()))))) log#(s(s(x))) -> log#(s(quot(x,s(s(0()))))) -> log#(s(s(x))) -> quot#(x,s(s(0()))) log#(s(s(x))) -> quot#(x,s(s(0()))) -> quot#(s(x),s(y)) -> quot#(minus(x,y),s(y)) log#(s(s(x))) -> quot#(x,s(s(0()))) -> quot#(s(x),s(y)) -> minus#(x,y) quot#(s(x),s(y)) -> quot#(minus(x,y),s(y)) -> quot#(s(x),s(y)) -> quot#(minus(x,y),s(y)) quot#(s(x),s(y)) -> quot#(minus(x,y),s(y)) -> quot#(s(x),s(y)) -> minus#(x,y) quot#(s(x),s(y)) -> minus#(x,y) -> minus#(x,s(y)) -> pred#(minus(x,y)) quot#(s(x),s(y)) -> minus#(x,y) -> minus#(x,s(y)) -> minus#(x,y) minus#(x,s(y)) -> minus#(x,y) -> minus#(x,s(y)) -> pred#(minus(x,y)) minus#(x,s(y)) -> minus#(x,y) -> minus#(x,s(y)) -> minus#(x,y) SCC Processor: #sccs: 3 #rules: 3 #arcs: 10/36 DPs: log#(s(s(x))) -> log#(s(quot(x,s(s(0()))))) TRS: pred(s(x)) -> x minus(x,0()) -> x minus(x,s(y)) -> pred(minus(x,y)) quot(0(),s(y)) -> 0() quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) log(s(0())) -> 0() log(s(s(x))) -> s(log(s(quot(x,s(s(0())))))) Subterm Criterion Processor: simple projection: pi(s) = [0,0,0] pi(pred) = 0 pi(minus) = 0 pi(quot) = [0,0] pi(log#) = [0,0,0] problem: DPs: TRS: pred(s(x)) -> x minus(x,0()) -> x minus(x,s(y)) -> pred(minus(x,y)) quot(0(),s(y)) -> 0() quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) log(s(0())) -> 0() log(s(s(x))) -> s(log(s(quot(x,s(s(0())))))) Qed DPs: quot#(s(x),s(y)) -> quot#(minus(x,y),s(y)) TRS: pred(s(x)) -> x minus(x,0()) -> x minus(x,s(y)) -> pred(minus(x,y)) quot(0(),s(y)) -> 0() quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) log(s(0())) -> 0() log(s(s(x))) -> s(log(s(quot(x,s(s(0())))))) Subterm Criterion Processor: simple projection: pi(s) = [0,0] pi(pred) = 0 pi(minus) = 0 pi(quot#) = [0,1,1] problem: DPs: TRS: pred(s(x)) -> x minus(x,0()) -> x minus(x,s(y)) -> pred(minus(x,y)) quot(0(),s(y)) -> 0() quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) log(s(0())) -> 0() log(s(s(x))) -> s(log(s(quot(x,s(s(0())))))) Qed DPs: minus#(x,s(y)) -> minus#(x,y) TRS: pred(s(x)) -> x minus(x,0()) -> x minus(x,s(y)) -> pred(minus(x,y)) quot(0(),s(y)) -> 0() quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) log(s(0())) -> 0() log(s(s(x))) -> s(log(s(quot(x,s(s(0())))))) Subterm Criterion Processor: simple projection: pi(minus#) = 1 problem: DPs: TRS: pred(s(x)) -> x minus(x,0()) -> x minus(x,s(y)) -> pred(minus(x,y)) quot(0(),s(y)) -> 0() quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) log(s(0())) -> 0() log(s(s(x))) -> s(log(s(quot(x,s(s(0())))))) Qed