Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381711031
details
property
value
status
complete
benchmark
factorial1.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n051.star.cs.uiowa.edu
space
AProVE_06
run statistics
property
value
solver
ttt2-1.17+nonreach
configuration
ttt2-1.17+nonreach
runtime (wallclock)
2.65569186211 seconds
cpu usage
9.047335806
max memory
7.24688896E8
stage attributes
key
value
output-size
8321
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: plus(0(),x) -> x plus(s(x),y) -> s(plus(p(s(x)),y)) times(0(),y) -> 0() times(s(x),y) -> plus(y,times(p(s(x)),y)) p(s(0())) -> 0() p(s(s(x))) -> s(p(s(x))) fac(0(),x) -> x fac(s(x),y) -> fac(p(s(x)),times(s(x),y)) factorial(x) -> fac(x,s(0())) Proof: DP Processor: DPs: plus#(s(x),y) -> p#(s(x)) plus#(s(x),y) -> plus#(p(s(x)),y) times#(s(x),y) -> p#(s(x)) times#(s(x),y) -> times#(p(s(x)),y) times#(s(x),y) -> plus#(y,times(p(s(x)),y)) p#(s(s(x))) -> p#(s(x)) fac#(s(x),y) -> times#(s(x),y) fac#(s(x),y) -> p#(s(x)) fac#(s(x),y) -> fac#(p(s(x)),times(s(x),y)) factorial#(x) -> fac#(x,s(0())) TRS: plus(0(),x) -> x plus(s(x),y) -> s(plus(p(s(x)),y)) times(0(),y) -> 0() times(s(x),y) -> plus(y,times(p(s(x)),y)) p(s(0())) -> 0() p(s(s(x))) -> s(p(s(x))) fac(0(),x) -> x fac(s(x),y) -> fac(p(s(x)),times(s(x),y)) factorial(x) -> fac(x,s(0())) TDG Processor: DPs: plus#(s(x),y) -> p#(s(x)) plus#(s(x),y) -> plus#(p(s(x)),y) times#(s(x),y) -> p#(s(x)) times#(s(x),y) -> times#(p(s(x)),y) times#(s(x),y) -> plus#(y,times(p(s(x)),y)) p#(s(s(x))) -> p#(s(x)) fac#(s(x),y) -> times#(s(x),y) fac#(s(x),y) -> p#(s(x)) fac#(s(x),y) -> fac#(p(s(x)),times(s(x),y)) factorial#(x) -> fac#(x,s(0())) TRS: plus(0(),x) -> x plus(s(x),y) -> s(plus(p(s(x)),y)) times(0(),y) -> 0() times(s(x),y) -> plus(y,times(p(s(x)),y)) p(s(0())) -> 0() p(s(s(x))) -> s(p(s(x))) fac(0(),x) -> x fac(s(x),y) -> fac(p(s(x)),times(s(x),y)) factorial(x) -> fac(x,s(0())) graph: factorial#(x) -> fac#(x,s(0())) -> fac#(s(x),y) -> fac#(p(s(x)),times(s(x),y)) factorial#(x) -> fac#(x,s(0())) -> fac#(s(x),y) -> p#(s(x)) factorial#(x) -> fac#(x,s(0())) -> fac#(s(x),y) -> times#(s(x),y) fac#(s(x),y) -> fac#(p(s(x)),times(s(x),y)) -> fac#(s(x),y) -> fac#(p(s(x)),times(s(x),y)) fac#(s(x),y) -> fac#(p(s(x)),times(s(x),y)) -> fac#(s(x),y) -> p#(s(x)) fac#(s(x),y) -> fac#(p(s(x)),times(s(x),y)) -> fac#(s(x),y) -> times#(s(x),y) fac#(s(x),y) -> times#(s(x),y) -> times#(s(x),y) -> plus#(y,times(p(s(x)),y)) fac#(s(x),y) -> times#(s(x),y) -> times#(s(x),y) -> times#(p(s(x)),y) fac#(s(x),y) -> times#(s(x),y) -> times#(s(x),y) -> p#(s(x)) fac#(s(x),y) -> p#(s(x)) -> p#(s(s(x))) -> p#(s(x)) times#(s(x),y) -> times#(p(s(x)),y) -> times#(s(x),y) -> plus#(y,times(p(s(x)),y)) times#(s(x),y) -> times#(p(s(x)),y) -> times#(s(x),y) -> times#(p(s(x)),y) times#(s(x),y) -> times#(p(s(x)),y) -> times#(s(x),y) -> p#(s(x)) times#(s(x),y) -> p#(s(x)) -> p#(s(s(x))) -> p#(s(x)) times#(s(x),y) -> plus#(y,times(p(s(x)),y)) -> plus#(s(x),y) -> plus#(p(s(x)),y) times#(s(x),y) -> plus#(y,times(p(s(x)),y)) -> plus#(s(x),y) -> p#(s(x)) p#(s(s(x))) -> p#(s(x)) -> p#(s(s(x))) -> p#(s(x)) plus#(s(x),y) -> p#(s(x)) -> p#(s(s(x))) -> p#(s(x)) plus#(s(x),y) -> plus#(p(s(x)),y) -> plus#(s(x),y) -> plus#(p(s(x)),y) plus#(s(x),y) -> plus#(p(s(x)),y) -> plus#(s(x),y) -> p#(s(x)) SCC Processor: #sccs: 4 #rules: 4
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472