details

property	value
status	complete
benchmark	4.55.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n174.star.cs.uiowa.edu
space	SK90

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.148962 seconds
cpu usage	0.117441
user time	0.048489
system time	0.068952
max virtual memory	113188.0
max residence set size	5860.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S x:S) (RULES b -> c f(x:S,x:S) -> f(a,b) ) Problem 1: Innermost Equivalent Processor: -> Rules: b -> c f(x:S,x:S) -> f(a,b) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: F(x:S,x:S) -> B F(x:S,x:S) -> F(a,b) -> Rules: b -> c f(x:S,x:S) -> f(a,b) Problem 1: SCC Processor: -> Pairs: F(x:S,x:S) -> B F(x:S,x:S) -> F(a,b) -> Rules: b -> c f(x:S,x:S) -> f(a,b) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(x:S,x:S) -> F(a,b) ->->-> Rules: b -> c f(x:S,x:S) -> f(a,b) Problem 1: Reduction Pair Processor: -> Pairs: F(x:S,x:S) -> F(a,b) -> Rules: b -> c f(x:S,x:S) -> f(a,b) -> Usable rules: b -> c ->Mace4 Output: ============================== Mace4 ================================= Mace4 (64) version 2009-11A, November 2009. Process 46839 was started by sandbox2 on n174.star.cs.uiowa.edu, Mon Jun 22 00:28:39 2020 The command was "./mace4 -c -f /tmp/mace4336465782861021530.in". ============================== end of head =========================== ============================== INPUT ================================= % Reading from file /tmp/mace4336465782861021530.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(f3(x1,x2),f3(y,x2)) # label(congruence). arrow_s0(x2,y) -> arrow_s0(f3(x1,x2),f3(x1,y)) # label(congruence). arrow_s0(x1,y) -> arrow_s0(f9(x1,x2),f9(y,x2)) # label(congruence). arrow_s0(x2,y) -> arrow_s0(f9(x1,x2),f9(x1,y)) # label(congruence). arrow_s0(f2,f5) # label(replacement). arrow_s0(x,y) -> gtrsim_s0(x,y) # label(inclusion). sqsupset_s0(f9(x1,x1),f9(f4,f2)) # label(replacement). sqsupset_s0(x,y) -> sqsupsetStar_s0(x,y) # label(inclusion). sqsupset_s0(x,y) & sqsupsetStar_s0(y,z) -> sqsupsetStar_s0(x,z) # label(compatibility). end_of_list. formulas(goals). (exists x sqsupsetStar_s0(x,x)) # label(wellfoundedness). end_of_list. ============================== end of input ========================== ============================== PROCESS NON-CLAUSAL FORMULAS ========== % Formulas that are not ordinary clauses: 1 gtrsim_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility) # label(non_clause). [assumption]. 2 succeq_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility) # label(non_clause). [assumption]. 3 gtrsim_s0(x,y) & succeq_s0(y,z) -> gtrsim_s0(x,z) # label(compatibility) # label(non_clause). [assumption]. 4 arrow_s0(x1,y) -> arrow_s0(f3(x1,x2),f3(y,x2)) # label(congruence) # label(non_clause). [assumption]. 5 arrow_s0(x2,y) -> arrow_s0(f3(x1,x2),f3(x1,y)) # label(congruence) # label(non_clause). [assumption]. 6 arrow_s0(x1,y) -> arrow_s0(f9(x1,x2),f9(y,x2)) # label(congruence) # label(non_clause). [assumption]. popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Standard