details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	21.534 seconds
cpu usage	21.3565
user time	17.7255
system time	3.63106
max virtual memory	708120.0
max residence set size	6800.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S x:S) (RULES a(f,a(g,a(f,x:S))) -> a(f,a(g,a(g,a(f,x:S)))) a(g,a(f,a(g,x:S))) -> a(g,a(f,a(f,a(g,x:S)))) ) Problem 1: Dependency Pairs Processor: -> Pairs: A(f,a(g,a(f,x:S))) -> A(f,a(g,a(g,a(f,x:S)))) A(f,a(g,a(f,x:S))) -> A(g,a(g,a(f,x:S))) A(g,a(f,a(g,x:S))) -> A(f,a(f,a(g,x:S))) A(g,a(f,a(g,x:S))) -> A(g,a(f,a(f,a(g,x:S)))) -> Rules: a(f,a(g,a(f,x:S))) -> a(f,a(g,a(g,a(f,x:S)))) a(g,a(f,a(g,x:S))) -> a(g,a(f,a(f,a(g,x:S)))) Problem 1: SCC Processor: -> Pairs: A(f,a(g,a(f,x:S))) -> A(f,a(g,a(g,a(f,x:S)))) A(f,a(g,a(f,x:S))) -> A(g,a(g,a(f,x:S))) A(g,a(f,a(g,x:S))) -> A(f,a(f,a(g,x:S))) A(g,a(f,a(g,x:S))) -> A(g,a(f,a(f,a(g,x:S)))) -> Rules: a(f,a(g,a(f,x:S))) -> a(f,a(g,a(g,a(f,x:S)))) a(g,a(f,a(g,x:S))) -> a(g,a(f,a(f,a(g,x:S)))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A(f,a(g,a(f,x:S))) -> A(f,a(g,a(g,a(f,x:S)))) A(f,a(g,a(f,x:S))) -> A(g,a(g,a(f,x:S))) A(g,a(f,a(g,x:S))) -> A(f,a(f,a(g,x:S))) A(g,a(f,a(g,x:S))) -> A(g,a(f,a(f,a(g,x:S)))) ->->-> Rules: a(f,a(g,a(f,x:S))) -> a(f,a(g,a(g,a(f,x:S)))) a(g,a(f,a(g,x:S))) -> a(g,a(f,a(f,a(g,x:S)))) Problem 1: Reduction Pair Processor: -> Pairs: A(f,a(g,a(f,x:S))) -> A(f,a(g,a(g,a(f,x:S)))) A(f,a(g,a(f,x:S))) -> A(g,a(g,a(f,x:S))) A(g,a(f,a(g,x:S))) -> A(f,a(f,a(g,x:S))) A(g,a(f,a(g,x:S))) -> A(g,a(f,a(f,a(g,x:S)))) -> Rules: a(f,a(g,a(f,x:S))) -> a(f,a(g,a(g,a(f,x:S)))) a(g,a(f,a(g,x:S))) -> a(g,a(f,a(f,a(g,x:S)))) -> Usable rules: a(f,a(g,a(f,x:S))) -> a(f,a(g,a(g,a(f,x:S)))) a(g,a(f,a(g,x:S))) -> a(g,a(f,a(f,a(g,x:S)))) ->Mace4 Output: ============================== Mace4 ================================= Mace4 (64) version 2009-11A, November 2009. Process 59287 was started by sandbox2 on n183.star.cs.uiowa.edu, Mon Jun 22 00:57:59 2020 The command was "./mace4 -c -f /tmp/mace420406514341975960378.in". ============================== end of head =========================== ============================== INPUT ================================= % Reading from file /tmp/mace420406514341975960378.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). arrow_s0(x2,y) -> arrow_s0(f8(x1,x2),f8(x1,y)) # label(congruence). arrow_s0(f2(f3,f2(f5,f2(f3,x1))),f2(f3,f2(f5,f2(f5,f2(f3,x1))))) # label(replacement). arrow_s0(f2(f5,f2(f3,f2(f5,x1))),f2(f5,f2(f3,f2(f3,f2(f5,x1))))) # label(replacement). arrow_s0(f8(x2,x3),x2) # label(replacement). arrow_s0(f8(x2,x3),x3) # label(replacement). arrow_s0(x,y) -> gtrsim_s0(x,y) # label(inclusion). sqsupset_s0(f7(f3,f2(f5,f2(f3,x1))),f7(f5,f2(f5,f2(f3,x1)))) # label(replacement). succeq_s0(f7(f3,f2(f5,f2(f3,x1))),f7(f3,f2(f5,f2(f5,f2(f3,x1))))) # label(replacement). succeq_s0(f7(f5,f2(f3,f2(f5,x1))),f7(f3,f2(f3,f2(f5,x1)))) # label(replacement). succeq_s0(f7(f5,f2(f3,f2(f5,x1))),f7(f5,f2(f3,f2(f3,f2(f5,x1))))) # 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 ========================== popout

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

job log

popout

actions

all output return to TRS Standard