Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Inner 89993 pair #381733790
details
property
value
status
complete
benchmark
Ex1_GM99_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n009.star.cs.uiowa.edu
space
Transformed_CSR_innermost_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0379018783569 seconds
cpu usage
0.035200825
max memory
3837952.0
stage attributes
key
value
output-size
3660
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 X X1 X2 X3) (RULES a__c -> a a__c -> b a__c -> c a__f(a,b,X) -> a__f(X,X,mark(X)) a__f(X1,X2,X3) -> f(X1,X2,X3) mark(a) -> a mark(b) -> b mark(c) -> a__c mark(f(X1,X2,X3)) -> a__f(X1,X2,mark(X3)) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: A__F(a,b,X) -> A__F(X,X,mark(X)) A__F(a,b,X) -> MARK(X) MARK(c) -> A__C MARK(f(X1,X2,X3)) -> A__F(X1,X2,mark(X3)) MARK(f(X1,X2,X3)) -> MARK(X3) -> Rules: a__c -> a a__c -> b a__c -> c a__f(a,b,X) -> a__f(X,X,mark(X)) a__f(X1,X2,X3) -> f(X1,X2,X3) mark(a) -> a mark(b) -> b mark(c) -> a__c mark(f(X1,X2,X3)) -> a__f(X1,X2,mark(X3)) Problem 1: SCC Processor: -> Pairs: A__F(a,b,X) -> A__F(X,X,mark(X)) A__F(a,b,X) -> MARK(X) MARK(c) -> A__C MARK(f(X1,X2,X3)) -> A__F(X1,X2,mark(X3)) MARK(f(X1,X2,X3)) -> MARK(X3) -> Rules: a__c -> a a__c -> b a__c -> c a__f(a,b,X) -> a__f(X,X,mark(X)) a__f(X1,X2,X3) -> f(X1,X2,X3) mark(a) -> a mark(b) -> b mark(c) -> a__c mark(f(X1,X2,X3)) -> a__f(X1,X2,mark(X3)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A__F(a,b,X) -> MARK(X) MARK(f(X1,X2,X3)) -> A__F(X1,X2,mark(X3)) MARK(f(X1,X2,X3)) -> MARK(X3) ->->-> Rules: a__c -> a a__c -> b a__c -> c a__f(a,b,X) -> a__f(X,X,mark(X)) a__f(X1,X2,X3) -> f(X1,X2,X3) mark(a) -> a mark(b) -> b mark(c) -> a__c mark(f(X1,X2,X3)) -> a__f(X1,X2,mark(X3)) Problem 1: Reduction Pairs Processor: -> Pairs: A__F(a,b,X) -> MARK(X) MARK(f(X1,X2,X3)) -> A__F(X1,X2,mark(X3)) MARK(f(X1,X2,X3)) -> MARK(X3) -> Rules: a__c -> a a__c -> b a__c -> c a__f(a,b,X) -> a__f(X,X,mark(X)) a__f(X1,X2,X3) -> f(X1,X2,X3) mark(a) -> a mark(b) -> b mark(c) -> a__c mark(f(X1,X2,X3)) -> a__f(X1,X2,mark(X3)) -> Usable rules: a__c -> a a__c -> b
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Inner 89993