TRS Standard pair #516964744

details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	0.813183069229 seconds
cpu usage	2.052742234
max memory	4.59231232E8

stage attributes

key	value
output-size	2660
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_ttt2 /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES

Problem:
 minus(X,0()) -> X
 minus(s(X),s(Y)) -> p(minus(X,Y))
 p(s(X)) -> X
 div(0(),s(Y)) -> 0()
 div(s(X),s(Y)) -> s(div(minus(X,Y),s(Y)))

Proof:
 DP Processor:
  DPs:
   minus#(s(X),s(Y)) -> minus#(X,Y)
   minus#(s(X),s(Y)) -> p#(minus(X,Y))
   div#(s(X),s(Y)) -> minus#(X,Y)
   div#(s(X),s(Y)) -> div#(minus(X,Y),s(Y))
  TRS:
   minus(X,0()) -> X
   minus(s(X),s(Y)) -> p(minus(X,Y))
   p(s(X)) -> X
   div(0(),s(Y)) -> 0()
   div(s(X),s(Y)) -> s(div(minus(X,Y),s(Y)))
  TDG Processor:
   DPs:
    minus#(s(X),s(Y)) -> minus#(X,Y)
    minus#(s(X),s(Y)) -> p#(minus(X,Y))
    div#(s(X),s(Y)) -> minus#(X,Y)
    div#(s(X),s(Y)) -> div#(minus(X,Y),s(Y))
   TRS:
    minus(X,0()) -> X
    minus(s(X),s(Y)) -> p(minus(X,Y))
    p(s(X)) -> X
    div(0(),s(Y)) -> 0()
    div(s(X),s(Y)) -> s(div(minus(X,Y),s(Y)))
   graph:
    div#(s(X),s(Y)) -> div#(minus(X,Y),s(Y)) ->
    div#(s(X),s(Y)) -> div#(minus(X,Y),s(Y))
    div#(s(X),s(Y)) -> div#(minus(X,Y),s(Y)) ->
    div#(s(X),s(Y)) -> minus#(X,Y)
    div#(s(X),s(Y)) -> minus#(X,Y) ->
    minus#(s(X),s(Y)) -> p#(minus(X,Y))
    div#(s(X),s(Y)) -> minus#(X,Y) ->
    minus#(s(X),s(Y)) -> minus#(X,Y)
    minus#(s(X),s(Y)) -> minus#(X,Y) ->
    minus#(s(X),s(Y)) -> p#(minus(X,Y))
    minus#(s(X),s(Y)) -> minus#(X,Y) -> minus#(s(X),s(Y)) -> minus#(X,Y)
   SCC Processor:
    #sccs: 2
    #rules: 2
    #arcs: 6/16
    DPs:
     div#(s(X),s(Y)) -> div#(minus(X,Y),s(Y))
    TRS:
     minus(X,0()) -> X
     minus(s(X),s(Y)) -> p(minus(X,Y))
     p(s(X)) -> X
     div(0(),s(Y)) -> 0()
     div(s(X),s(Y)) -> s(div(minus(X,Y),s(Y)))
    Subterm Criterion Processor:
     simple projection:
      pi(minus) = 0
      pi(p) = 0
      pi(div#) = 0
     problem:
      DPs:
       
      TRS:
       minus(X,0()) -> X
       minus(s(X),s(Y)) -> p(minus(X,Y))
       p(s(X)) -> X
       div(0(),s(Y)) -> 0()
       div(s(X),s(Y)) -> s(div(minus(X,Y),s(Y)))
     Qed
    
    DPs:
     minus#(s(X),s(Y)) -> minus#(X,Y)
    TRS:
     minus(X,0()) -> X
     minus(s(X),s(Y)) -> p(minus(X,Y))
     p(s(X)) -> X
     div(0(),s(Y)) -> 0()
     div(s(X),s(Y)) -> s(div(minus(X,Y),s(Y)))
    Subterm Criterion Processor:
     simple projection:
      pi(minus#) = 0
     problem:
      DPs:
       
      TRS:
       minus(X,0()) -> X
       minus(s(X),s(Y)) -> p(minus(X,Y))
       p(s(X)) -> X
       div(0(),s(Y)) -> 0()
       div(s(X),s(Y)) -> s(div(minus(X,Y),s(Y)))

popout

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

job log

popout

actions all output return to TRS Standard