Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516968191
details
property
value
status
complete
benchmark
t001.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
HirokawaMiddeldorp_04
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.189092874527 seconds
cpu usage
0.11375949
max memory
4083712.0
stage attributes
key
value
output-size
14480
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR v_NonEmpty:S x:S y:S z:S) (RULES *(x:S,0) -> 0 *(x:S,s(y:S)) -> +(*(x:S,y:S),x:S) -(s(x:S),s(y:S)) -> -(x:S,y:S) -(x:S,0) -> x:S f(x:S,0,z:S) -> z:S f(x:S,s(y:S),z:S) -> if(odd(s(y:S)),f(x:S,y:S,*(x:S,z:S)),f(*(x:S,x:S),half(s(y:S)),z:S)) half(0) -> 0 half(s(0)) -> 0 half(s(s(x:S))) -> s(half(x:S)) if(ffalse,x:S,y:S) -> ffalse if(ffalse,x:S,y:S) -> y:S if(ttrue,x:S,y:S) -> ttrue if(ttrue,x:S,y:S) -> x:S odd(0) -> ffalse odd(s(0)) -> ttrue odd(s(s(x:S))) -> odd(x:S) pow(x:S,y:S) -> f(x:S,y:S,s(0)) ) Problem 1: Dependency Pairs Processor: -> Pairs: *#(x:S,s(y:S)) -> *#(x:S,y:S) -#(s(x:S),s(y:S)) -> -#(x:S,y:S) F(x:S,s(y:S),z:S) -> *#(x:S,x:S) F(x:S,s(y:S),z:S) -> *#(x:S,z:S) F(x:S,s(y:S),z:S) -> F(*(x:S,x:S),half(s(y:S)),z:S) F(x:S,s(y:S),z:S) -> F(x:S,y:S,*(x:S,z:S)) F(x:S,s(y:S),z:S) -> HALF(s(y:S)) F(x:S,s(y:S),z:S) -> IF(odd(s(y:S)),f(x:S,y:S,*(x:S,z:S)),f(*(x:S,x:S),half(s(y:S)),z:S)) F(x:S,s(y:S),z:S) -> ODD(s(y:S)) HALF(s(s(x:S))) -> HALF(x:S) ODD(s(s(x:S))) -> ODD(x:S) POW(x:S,y:S) -> F(x:S,y:S,s(0)) -> Rules: *(x:S,0) -> 0 *(x:S,s(y:S)) -> +(*(x:S,y:S),x:S) -(s(x:S),s(y:S)) -> -(x:S,y:S) -(x:S,0) -> x:S f(x:S,0,z:S) -> z:S f(x:S,s(y:S),z:S) -> if(odd(s(y:S)),f(x:S,y:S,*(x:S,z:S)),f(*(x:S,x:S),half(s(y:S)),z:S)) half(0) -> 0 half(s(0)) -> 0 half(s(s(x:S))) -> s(half(x:S)) if(ffalse,x:S,y:S) -> ffalse if(ffalse,x:S,y:S) -> y:S if(ttrue,x:S,y:S) -> ttrue if(ttrue,x:S,y:S) -> x:S odd(0) -> ffalse odd(s(0)) -> ttrue odd(s(s(x:S))) -> odd(x:S) pow(x:S,y:S) -> f(x:S,y:S,s(0)) Problem 1: SCC Processor: -> Pairs: *#(x:S,s(y:S)) -> *#(x:S,y:S) -#(s(x:S),s(y:S)) -> -#(x:S,y:S) F(x:S,s(y:S),z:S) -> *#(x:S,x:S) F(x:S,s(y:S),z:S) -> *#(x:S,z:S) F(x:S,s(y:S),z:S) -> F(*(x:S,x:S),half(s(y:S)),z:S) F(x:S,s(y:S),z:S) -> F(x:S,y:S,*(x:S,z:S)) F(x:S,s(y:S),z:S) -> HALF(s(y:S)) F(x:S,s(y:S),z:S) -> IF(odd(s(y:S)),f(x:S,y:S,*(x:S,z:S)),f(*(x:S,x:S),half(s(y:S)),z:S)) F(x:S,s(y:S),z:S) -> ODD(s(y:S)) HALF(s(s(x:S))) -> HALF(x:S) ODD(s(s(x:S))) -> ODD(x:S) POW(x:S,y:S) -> F(x:S,y:S,s(0)) -> Rules: *(x:S,0) -> 0 *(x:S,s(y:S)) -> +(*(x:S,y:S),x:S) -(s(x:S),s(y:S)) -> -(x:S,y:S) -(x:S,0) -> x:S f(x:S,0,z:S) -> z:S f(x:S,s(y:S),z:S) -> if(odd(s(y:S)),f(x:S,y:S,*(x:S,z:S)),f(*(x:S,x:S),half(s(y:S)),z:S)) half(0) -> 0 half(s(0)) -> 0 half(s(s(x:S))) -> s(half(x:S)) if(ffalse,x:S,y:S) -> ffalse if(ffalse,x:S,y:S) -> y:S if(ttrue,x:S,y:S) -> ttrue if(ttrue,x:S,y:S) -> x:S odd(0) -> ffalse odd(s(0)) -> ttrue odd(s(s(x:S))) -> odd(x:S) pow(x:S,y:S) -> f(x:S,y:S,s(0))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard