Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516965611
details
property
value
status
complete
benchmark
z06.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n178.star.cs.uiowa.edu
space
Zantema_05
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
2.32922101021 seconds
cpu usage
2.049607217
max memory
7041024.0
stage attributes
key
value
output-size
33303
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 v_NonEmpty:S x:S) (RULES f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S))) f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S))) ) Problem 1: Dependency Pairs Processor: -> Pairs: F(a,f(b,x:S)) -> F(a,f(a,f(a,x:S))) F(a,f(b,x:S)) -> F(a,f(a,x:S)) F(a,f(b,x:S)) -> F(a,x:S) F(b,f(a,x:S)) -> F(b,f(b,f(b,x:S))) F(b,f(a,x:S)) -> F(b,f(b,x:S)) F(b,f(a,x:S)) -> F(b,x:S) -> Rules: f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S))) f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S))) Problem 1: SCC Processor: -> Pairs: F(a,f(b,x:S)) -> F(a,f(a,f(a,x:S))) F(a,f(b,x:S)) -> F(a,f(a,x:S)) F(a,f(b,x:S)) -> F(a,x:S) F(b,f(a,x:S)) -> F(b,f(b,f(b,x:S))) F(b,f(a,x:S)) -> F(b,f(b,x:S)) F(b,f(a,x:S)) -> F(b,x:S) -> Rules: f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S))) f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(b,f(a,x:S)) -> F(b,f(b,f(b,x:S))) F(b,f(a,x:S)) -> F(b,f(b,x:S)) F(b,f(a,x:S)) -> F(b,x:S) ->->-> Rules: f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S))) f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S))) ->->Cycle: ->->-> Pairs: F(a,f(b,x:S)) -> F(a,f(a,f(a,x:S))) F(a,f(b,x:S)) -> F(a,f(a,x:S)) F(a,f(b,x:S)) -> F(a,x:S) ->->-> Rules: f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S))) f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S))) The problem is decomposed in 2 subproblems. Problem 1.1: Reduction Pair Processor: -> Pairs: F(b,f(a,x:S)) -> F(b,f(b,f(b,x:S))) F(b,f(a,x:S)) -> F(b,f(b,x:S)) F(b,f(a,x:S)) -> F(b,x:S) -> Rules: f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S))) f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S))) -> Usable rules: f(a,f(b,x:S)) -> f(a,f(a,f(a,x:S))) f(b,f(a,x:S)) -> f(b,f(b,f(b,x:S))) ->Mace4 Output: ============================== Mace4 ================================= Mace4 (64) version 2009-11A, November 2009. Process 59625 was started by sandbox2 on n178.star.cs.uiowa.edu, Tue Jul 13 16:44:51 2021 The command was "./mace4 -c -f /tmp/mace49398195822001100545.in". ============================== end of head =========================== ============================== INPUT ================================= % Reading from file /tmp/mace49398195822001100545.in assign(max_seconds,20). formulas(assumptions). gtrsim_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility). succeq_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility). gtrsim_s0(x,y) & succeq_s0(y,z) -> gtrsim_s0(x,z) # label(compatibility). arrow_s0(x1,y) -> arrow_s0(f2(x1,x2),f2(y,x2)) # label(congruence). arrow_s0(x2,y) -> arrow_s0(f2(x1,x2),f2(x1,y)) # label(congruence). arrow_s0(x1,y) -> arrow_s0(f7(x1,x2),f7(y,x2)) # label(congruence). arrow_s0(x2,y) -> arrow_s0(f7(x1,x2),f7(x1,y)) # label(congruence). arrow_s0(x1,y) -> arrow_s0(f8(x1,x2),f8(y,x2)) # label(congruence).
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard