details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.144564 seconds
cpu usage	0.121723
user time	0.054893
system time	0.06683
max virtual memory	113176.0
max residence set size	5744.0

stage attributes

key	value
starexec-result	YES

output

0.00/0.14 YES 0.00/0.14 0.00/0.14 Problem 1: 0.00/0.14 0.00/0.14 (VAR v_NonEmpty:S x:S) 0.00/0.14 (RULES 0.00/0.14 f(x:S,x:S) -> f(g(x:S),x:S) 0.00/0.14 g(x:S) -> s(x:S) 0.00/0.14 ) 0.00/0.14 (STRATEGY INNERMOST) 0.00/0.14 0.00/0.14 Problem 1: 0.00/0.14 0.00/0.14 Dependency Pairs Processor: 0.00/0.14 -> Pairs: 0.00/0.14 F(x:S,x:S) -> F(g(x:S),x:S) 0.00/0.14 F(x:S,x:S) -> G(x:S) 0.00/0.14 -> Rules: 0.00/0.14 f(x:S,x:S) -> f(g(x:S),x:S) 0.00/0.14 g(x:S) -> s(x:S) 0.00/0.14 0.00/0.14 Problem 1: 0.00/0.14 0.00/0.14 SCC Processor: 0.00/0.14 -> Pairs: 0.00/0.14 F(x:S,x:S) -> F(g(x:S),x:S) 0.00/0.14 F(x:S,x:S) -> G(x:S) 0.00/0.14 -> Rules: 0.00/0.14 f(x:S,x:S) -> f(g(x:S),x:S) 0.00/0.14 g(x:S) -> s(x:S) 0.00/0.14 ->Strongly Connected Components: 0.00/0.14 ->->Cycle: 0.00/0.14 ->->-> Pairs: 0.00/0.14 F(x:S,x:S) -> F(g(x:S),x:S) 0.00/0.14 ->->-> Rules: 0.00/0.14 f(x:S,x:S) -> f(g(x:S),x:S) 0.00/0.14 g(x:S) -> s(x:S) 0.00/0.14 0.00/0.14 Problem 1: 0.00/0.14 0.00/0.14 Reduction Pair Processor: 0.00/0.14 -> Pairs: 0.00/0.14 F(x:S,x:S) -> F(g(x:S),x:S) 0.00/0.14 -> Rules: 0.00/0.14 f(x:S,x:S) -> f(g(x:S),x:S) 0.00/0.14 g(x:S) -> s(x:S) 0.00/0.14 -> Usable rules: 0.00/0.14 g(x:S) -> s(x:S) 0.00/0.14 ->Mace4 Output: 0.00/0.14 ============================== Mace4 ================================= 0.00/0.14 Mace4 (64) version 2009-11A, November 2009. 0.00/0.14 Process 38208 was started by sandbox2 on n069.star.cs.uiowa.edu, 0.00/0.14 Thu Mar 28 22:22:14 2019 0.00/0.14 The command was "./mace4 -c -f /tmp/mace4336465782861021530.in". 0.00/0.14 ============================== end of head =========================== 0.00/0.14 0.00/0.14 ============================== INPUT ================================= 0.00/0.14 0.00/0.14 % Reading from file /tmp/mace4336465782861021530.in 0.00/0.14 0.00/0.14 assign(max_seconds,20). 0.00/0.14 0.00/0.14 formulas(assumptions). 0.00/0.14 gtrsim_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility). 0.00/0.14 succeq_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility). 0.00/0.14 gtrsim_s0(x,y) & succeq_s0(y,z) -> gtrsim_s0(x,z) # label(compatibility). 0.00/0.14 arrow_s0(x1,y) -> arrow_s0(f2(x1,x2),f2(y,x2)) # label(congruence). 0.00/0.14 arrow_s0(x2,y) -> arrow_s0(f2(x1,x2),f2(x1,y)) # label(congruence). 0.00/0.14 arrow_s0(x1,y) -> arrow_s0(f3(x1),f3(y)) # label(congruence). 0.00/0.14 arrow_s0(x1,y) -> arrow_s0(f5(x1),f5(y)) # label(congruence). 0.00/0.14 arrow_s0(x1,y) -> arrow_s0(f7(x1,x2),f7(y,x2)) # label(congruence). 0.00/0.14 arrow_s0(x2,y) -> arrow_s0(f7(x1,x2),f7(x1,y)) # label(congruence). 0.00/0.14 arrow_s0(x1,y) -> arrow_s0(f8(x1),f8(y)) # label(congruence). 0.00/0.14 arrow_s0(f3(x1),f5(x1)) # label(replacement). 0.00/0.14 arrow_s0(x,y) -> gtrsim_s0(x,y) # label(inclusion). 0.00/0.14 sqsupset_s0(f7(x1,x1),f7(f3(x1),x1)) # label(replacement). 0.00/0.14 sqsupset_s0(x,y) -> sqsupsetStar_s0(x,y) # label(inclusion). 0.00/0.14 sqsupset_s0(x,y) & sqsupsetStar_s0(y,z) -> sqsupsetStar_s0(x,z) # label(compatibility). 0.00/0.14 end_of_list. 0.00/0.14 0.00/0.14 formulas(goals). 0.00/0.14 (exists x sqsupsetStar_s0(x,x)) # label(wellfoundedness). 0.00/0.14 end_of_list. 0.00/0.14 0.00/0.14 ============================== end of input ========================== 0.00/0.14 0.00/0.14 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.00/0.14 0.00/0.14 % Formulas that are not ordinary clauses: 0.00/0.14 1 gtrsim_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility) # label(non_clause). [assumption]. 0.00/0.14 2 succeq_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility) # label(non_clause). [assumption]. 0.00/0.14 3 gtrsim_s0(x,y) & succeq_s0(y,z) -> gtrsim_s0(x,z) # label(compatibility) # label(non_clause). [assumption]. 0.00/0.14 4 arrow_s0(x1,y) -> arrow_s0(f2(x1,x2),f2(y,x2)) # label(congruence) # label(non_clause). [assumption]. 0.00/0.14 5 arrow_s0(x2,y) -> arrow_s0(f2(x1,x2),f2(x1,y)) # label(congruence) # label(non_clause). [assumption]. 0.00/0.14 6 arrow_s0(x1,y) -> arrow_s0(f3(x1),f3(y)) # label(congruence) # label(non_clause). [assumption]. 0.00/0.14 7 arrow_s0(x1,y) -> arrow_s0(f5(x1),f5(y)) # label(congruence) # label(non_clause). [assumption]. 0.00/0.14 8 arrow_s0(x1,y) -> arrow_s0(f7(x1,x2),f7(y,x2)) # label(congruence) # label(non_clause). [assumption]. 0.00/0.14 9 arrow_s0(x2,y) -> arrow_s0(f7(x1,x2),f7(x1,y)) # label(congruence) # label(non_clause). [assumption]. 0.00/0.14 10 arrow_s0(x1,y) -> arrow_s0(f8(x1),f8(y)) # label(congruence) # label(non_clause). [assumption]. 0.00/0.14 11 arrow_s0(x,y) -> gtrsim_s0(x,y) # label(inclusion) # label(non_clause). [assumption]. 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