Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Equat 89423 pair #381732748
details
property
value
status
complete
benchmark
AC19.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n088.star.cs.uiowa.edu
space
AProVE_AC_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.203397035599 seconds
cpu usage
0.194417601
max memory
4268032.0
stage attributes
key
value
output-size
8393
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR x y) (THEORY (AC f)) (RULES f(g(f(h(a),a)),a) -> f(h(a),f(a,a)) f(g(h(a)),f(f(a,a),a)) -> f(g(f(h(a),a)),a) f(h(a),a) -> f(h(a),b) f(h(a),g(a)) -> f(g(h(a)),a) f(i(x,y),f(a,y)) -> f(g(i(x,y)),y) ) Problem 1: Reduction Order Processor: -> Rules: f(g(f(h(a),a)),a) -> f(h(a),f(a,a)) f(g(h(a)),f(f(a,a),a)) -> f(g(f(h(a),a)),a) f(h(a),a) -> f(h(a),b) f(h(a),g(a)) -> f(g(h(a)),a) f(i(x,y),f(a,y)) -> f(g(i(x,y)),y) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [f](X1,X2) = X1 + X2 [a] = 2 [b] = 2 [g](X) = X + 1 [h](X) = 2.X + 2 [i](X1,X2) = 2.X1 + X2 + 1 Problem 1: Reduction Order Processor: -> Rules: f(g(h(a)),f(f(a,a),a)) -> f(g(f(h(a),a)),a) f(h(a),a) -> f(h(a),b) f(h(a),g(a)) -> f(g(h(a)),a) f(i(x,y),f(a,y)) -> f(g(i(x,y)),y) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [f](X1,X2) = X1 + X2 + 2 [a] = 2 [b] = 0 [g](X) = X + 2 [h](X) = 2.X + 2 [i](X1,X2) = 2.X1 + X2 + 1 Problem 1: Reduction Order Processor: -> Rules: f(h(a),a) -> f(h(a),b) f(h(a),g(a)) -> f(g(h(a)),a) f(i(x,y),f(a,y)) -> f(g(i(x,y)),y) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [f](X1,X2) = X1 + X2 + 2 [a] = 1 [b] = 0 [g](X) = X + 2 [h](X) = X + 2 [i](X1,X2) = X1 + 2.X2 Problem 1: Reduction Order Processor: -> Rules:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Equat 89423