details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.459694 seconds
cpu usage	0.444643
user time	0.207427
system time	0.237216
max virtual memory	113188.0
max residence set size	6000.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S X:S Y:S) (RULES f(0,1,X:S) -> h(X:S,X:S) g(X:S,Y:S) -> X:S g(X:S,Y:S) -> Y:S h(0,X:S) -> f(0,X:S,X:S) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: F(0,1,X:S) -> H(X:S,X:S) H(0,X:S) -> F(0,X:S,X:S) -> Rules: f(0,1,X:S) -> h(X:S,X:S) g(X:S,Y:S) -> X:S g(X:S,Y:S) -> Y:S h(0,X:S) -> f(0,X:S,X:S) Problem 1: SCC Processor: -> Pairs: F(0,1,X:S) -> H(X:S,X:S) H(0,X:S) -> F(0,X:S,X:S) -> Rules: f(0,1,X:S) -> h(X:S,X:S) g(X:S,Y:S) -> X:S g(X:S,Y:S) -> Y:S h(0,X:S) -> f(0,X:S,X:S) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(0,1,X:S) -> H(X:S,X:S) H(0,X:S) -> F(0,X:S,X:S) ->->-> Rules: f(0,1,X:S) -> h(X:S,X:S) g(X:S,Y:S) -> X:S g(X:S,Y:S) -> Y:S h(0,X:S) -> f(0,X:S,X:S) Problem 1: Reduction Pair Processor: -> Pairs: F(0,1,X:S) -> H(X:S,X:S) H(0,X:S) -> F(0,X:S,X:S) -> Rules: f(0,1,X:S) -> h(X:S,X:S) g(X:S,Y:S) -> X:S g(X:S,Y:S) -> Y:S h(0,X:S) -> f(0,X:S,X:S) -> Usable rules: Empty ->Mace4 Output: ============================== Mace4 ================================= Mace4 (64) version 2009-11A, November 2009. Process 27553 was started by sandbox2 on n150.star.cs.uiowa.edu, Mon Jun 22 08:44:38 2020 The command was "./mace4 -c -f /tmp/mace41497983152038664370.in". ============================== end of head =========================== ============================== INPUT ================================= % Reading from file /tmp/mace41497983152038664370.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,x3),f2(y,x2,x3)) # label(congruence). arrow_s0(x2,y) -> arrow_s0(f2(x1,x2,x3),f2(x1,y,x3)) # label(congruence). arrow_s0(x3,y) -> arrow_s0(f2(x1,x2,x3),f2(x1,x2,y)) # label(congruence). 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(f4(x1,x2),f4(y,x2)) # label(congruence). arrow_s0(x2,y) -> arrow_s0(f4(x1,x2),f4(x1,y)) # label(congruence). arrow_s0(x1,y) -> arrow_s0(f9(x1,x2,x3),f9(y,x2,x3)) # label(congruence). arrow_s0(x2,y) -> arrow_s0(f9(x1,x2,x3),f9(x1,y,x3)) # label(congruence). arrow_s0(x3,y) -> arrow_s0(f9(x1,x2,x3),f9(x1,x2,y)) # label(congruence). arrow_s0(x1,y) -> arrow_s0(f10(x1,x2),f10(y,x2)) # label(congruence). arrow_s0(x2,y) -> arrow_s0(f10(x1,x2),f10(x1,y)) # label(congruence). arrow_s0(x,y) -> gtrsim_s0(x,y) # label(inclusion). sqsupset_s0(f9(f5,f6,x1),f10(x1,x1)) # label(replacement). succeq_s0(f10(f5,x1),f9(f5,x1,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. popout

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

job log

popout

actions

all output return to TRS Innermost