TRS Standard pair #615304610

details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	0.681499958038 seconds
cpu usage	1.559697746
max memory	3.36592896E8

stage attributes

key	value
output-size	2727
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:
 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)))

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))
  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)))
  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))
   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)))
   graph:
    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: 2
    #rules: 2
    #arcs: 6/16
    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)))
    Subterm Criterion Processor:
     simple projection:
      pi(s) = [0,0,0]
      pi(pred) = 0
      pi(minus) = [0,0]
      pi(quot#) = 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)))
     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)))
    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)))

popout

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

job log

popout

actions all output return to TRS Standard