Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516963771
details
property
value
status
complete
benchmark
jwteparla2.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n005.star.cs.uiowa.edu
space
Waldmann_06
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
13.6468560696 seconds
cpu usage
13.579258164
max memory
8048640.0
stage attributes
key
value
output-size
9546
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) (RULES f(f(f(a,f(a,a)),a),x:S) -> f(x:S,f(x:S,a)) ) Problem 1: Innermost Equivalent Processor: -> Rules: f(f(f(a,f(a,a)),a),x:S) -> f(x:S,f(x:S,a)) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: F(f(f(a,f(a,a)),a),x:S) -> F(x:S,f(x:S,a)) F(f(f(a,f(a,a)),a),x:S) -> F(x:S,a) -> Rules: f(f(f(a,f(a,a)),a),x:S) -> f(x:S,f(x:S,a)) Problem 1: SCC Processor: -> Pairs: F(f(f(a,f(a,a)),a),x:S) -> F(x:S,f(x:S,a)) F(f(f(a,f(a,a)),a),x:S) -> F(x:S,a) -> Rules: f(f(f(a,f(a,a)),a),x:S) -> f(x:S,f(x:S,a)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(f(f(a,f(a,a)),a),x:S) -> F(x:S,f(x:S,a)) F(f(f(a,f(a,a)),a),x:S) -> F(x:S,a) ->->-> Rules: f(f(f(a,f(a,a)),a),x:S) -> f(x:S,f(x:S,a)) Problem 1: Reduction Pairs Processor: -> Pairs: F(f(f(a,f(a,a)),a),x:S) -> F(x:S,f(x:S,a)) F(f(f(a,f(a,a)),a),x:S) -> F(x:S,a) -> Rules: f(f(f(a,f(a,a)),a),x:S) -> f(x:S,f(x:S,a)) -> Usable rules: f(f(f(a,f(a,a)),a),x:S) -> f(x:S,f(x:S,a)) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [f](X1,X2) = 2 [a] = 1 [fSNonEmpty] = 0 [F](X1,X2) = 2.X1 + 2.X2 Problem 1: SCC Processor: -> Pairs: F(f(f(a,f(a,a)),a),x:S) -> F(x:S,f(x:S,a)) -> Rules: f(f(f(a,f(a,a)),a),x:S) -> f(x:S,f(x:S,a)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(f(f(a,f(a,a)),a),x:S) -> F(x:S,f(x:S,a)) ->->-> Rules: f(f(f(a,f(a,a)),a),x:S) -> f(x:S,f(x:S,a)) Problem 1: Reduction Pair Processor: -> Pairs: F(f(f(a,f(a,a)),a),x:S) -> F(x:S,f(x:S,a)) -> Rules: f(f(f(a,f(a,a)),a),x:S) -> f(x:S,f(x:S,a)) -> Usable rules: f(f(f(a,f(a,a)),a),x:S) -> f(x:S,f(x:S,a)) ->Mace4 Output: ============================== Mace4 ================================= Mace4 (64) version 2009-11A, November 2009. Process 52056 was started by sandbox on n005.star.cs.uiowa.edu,
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard