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	n118.star.cs.uiowa.edu
space	Mixed_innermost

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.242076 seconds
cpu usage	0.225669
user time	0.106841
system time	0.118828
max virtual memory	113176.0
max residence set size	5996.0

stage attributes

key	value
starexec-result	YES

output

0.00/0.24 YES 0.00/0.24 0.00/0.24 Problem 1: 0.00/0.24 0.00/0.24 (VAR v_NonEmpty:S X:S Y:S) 0.00/0.24 (RULES 0.00/0.24 f(0,1,X:S) -> h(X:S,X:S) 0.00/0.24 g(X:S,Y:S) -> X:S 0.00/0.24 g(X:S,Y:S) -> Y:S 0.00/0.24 h(0,X:S) -> f(0,X:S,X:S) 0.00/0.24 ) 0.00/0.24 (STRATEGY INNERMOST) 0.00/0.24 0.00/0.24 Problem 1: 0.00/0.24 0.00/0.24 Dependency Pairs Processor: 0.00/0.24 -> Pairs: 0.00/0.24 F(0,1,X:S) -> H(X:S,X:S) 0.00/0.24 H(0,X:S) -> F(0,X:S,X:S) 0.00/0.24 -> Rules: 0.00/0.24 f(0,1,X:S) -> h(X:S,X:S) 0.00/0.24 g(X:S,Y:S) -> X:S 0.00/0.24 g(X:S,Y:S) -> Y:S 0.00/0.24 h(0,X:S) -> f(0,X:S,X:S) 0.00/0.24 0.00/0.24 Problem 1: 0.00/0.24 0.00/0.24 SCC Processor: 0.00/0.24 -> Pairs: 0.00/0.24 F(0,1,X:S) -> H(X:S,X:S) 0.00/0.24 H(0,X:S) -> F(0,X:S,X:S) 0.00/0.24 -> Rules: 0.00/0.24 f(0,1,X:S) -> h(X:S,X:S) 0.00/0.24 g(X:S,Y:S) -> X:S 0.00/0.24 g(X:S,Y:S) -> Y:S 0.00/0.24 h(0,X:S) -> f(0,X:S,X:S) 0.00/0.24 ->Strongly Connected Components: 0.00/0.24 ->->Cycle: 0.00/0.24 ->->-> Pairs: 0.00/0.24 F(0,1,X:S) -> H(X:S,X:S) 0.00/0.24 H(0,X:S) -> F(0,X:S,X:S) 0.00/0.24 ->->-> Rules: 0.00/0.24 f(0,1,X:S) -> h(X:S,X:S) 0.00/0.24 g(X:S,Y:S) -> X:S 0.00/0.24 g(X:S,Y:S) -> Y:S 0.00/0.24 h(0,X:S) -> f(0,X:S,X:S) 0.00/0.24 0.00/0.24 Problem 1: 0.00/0.24 0.00/0.24 Reduction Pair Processor: 0.00/0.24 -> Pairs: 0.00/0.24 F(0,1,X:S) -> H(X:S,X:S) 0.00/0.24 H(0,X:S) -> F(0,X:S,X:S) 0.00/0.24 -> Rules: 0.00/0.24 f(0,1,X:S) -> h(X:S,X:S) 0.00/0.24 g(X:S,Y:S) -> X:S 0.00/0.24 g(X:S,Y:S) -> Y:S 0.00/0.24 h(0,X:S) -> f(0,X:S,X:S) 0.00/0.24 -> Usable rules: 0.00/0.24 Empty 0.00/0.24 ->Mace4 Output: 0.00/0.24 ============================== Mace4 ================================= 0.00/0.24 Mace4 (64) version 2009-11A, November 2009. 0.00/0.24 Process 33344 was started by sandbox on n118.star.cs.uiowa.edu, 0.00/0.24 Thu Mar 28 22:18:28 2019 0.00/0.24 The command was "./mace4 -c -f /tmp/mace41497983152038664370.in". 0.00/0.24 ============================== end of head =========================== 0.00/0.24 0.00/0.24 ============================== INPUT ================================= 0.00/0.24 0.00/0.24 % Reading from file /tmp/mace41497983152038664370.in 0.00/0.24 0.00/0.24 assign(max_seconds,20). 0.00/0.24 0.00/0.24 formulas(assumptions). 0.00/0.24 gtrsim_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility). 0.00/0.24 succeq_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility). 0.00/0.24 gtrsim_s0(x,y) & succeq_s0(y,z) -> gtrsim_s0(x,z) # label(compatibility). 0.00/0.24 arrow_s0(x1,y) -> arrow_s0(f2(x1,x2,x3),f2(y,x2,x3)) # label(congruence). 0.00/0.24 arrow_s0(x2,y) -> arrow_s0(f2(x1,x2,x3),f2(x1,y,x3)) # label(congruence). 0.00/0.24 arrow_s0(x3,y) -> arrow_s0(f2(x1,x2,x3),f2(x1,x2,y)) # label(congruence). 0.00/0.24 arrow_s0(x1,y) -> arrow_s0(f3(x1,x2),f3(y,x2)) # label(congruence). 0.00/0.24 arrow_s0(x2,y) -> arrow_s0(f3(x1,x2),f3(x1,y)) # label(congruence). 0.00/0.24 arrow_s0(x1,y) -> arrow_s0(f4(x1,x2),f4(y,x2)) # label(congruence). 0.00/0.24 arrow_s0(x2,y) -> arrow_s0(f4(x1,x2),f4(x1,y)) # label(congruence). 0.00/0.24 arrow_s0(x1,y) -> arrow_s0(f9(x1,x2,x3),f9(y,x2,x3)) # label(congruence). 0.00/0.24 arrow_s0(x2,y) -> arrow_s0(f9(x1,x2,x3),f9(x1,y,x3)) # label(congruence). 0.00/0.24 arrow_s0(x3,y) -> arrow_s0(f9(x1,x2,x3),f9(x1,x2,y)) # label(congruence). 0.00/0.24 arrow_s0(x1,y) -> arrow_s0(f10(x1,x2),f10(y,x2)) # label(congruence). 0.00/0.24 arrow_s0(x2,y) -> arrow_s0(f10(x1,x2),f10(x1,y)) # label(congruence). 0.00/0.24 arrow_s0(x,y) -> gtrsim_s0(x,y) # label(inclusion). 0.00/0.24 sqsupset_s0(f9(f5,f6,x1),f10(x1,x1)) # label(replacement). 0.00/0.24 succeq_s0(f10(f5,x1),f9(f5,x1,x1)) # label(replacement). 0.00/0.24 sqsupset_s0(x,y) -> sqsupsetStar_s0(x,y) # label(inclusion). 0.00/0.24 sqsupset_s0(x,y) & sqsupsetStar_s0(y,z) -> sqsupsetStar_s0(x,z) # label(compatibility). 0.00/0.24 end_of_list. 0.00/0.24 0.00/0.24 formulas(goals). 0.00/0.24 (exists x sqsupsetStar_s0(x,x)) # label(wellfoundedness). 0.00/0.24 end_of_list. popout

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

job log

popout

actions

all output return to TRS_Innermost 2019-03-28 22.12