details

property	value
status	complete
benchmark	gen-28.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n186.star.cs.uiowa.edu
space	Secret_06_TRS

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	57.1547 seconds
cpu usage	56.9218
user time	54.0194
system time	2.90238
max virtual memory	755900.0
max residence set size	46472.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S x:S y:S z:S) (RULES b(b(z:S,y:S),a) -> z:S b(y:S,z:S) -> f(c(c(y:S,z:S,z:S),a,a)) c(f(z:S),f(c(a,x:S,a)),y:S) -> c(f(b(x:S,z:S)),c(z:S,y:S,a),a) ) Problem 1: Dependency Pairs Processor: -> Pairs: B(y:S,z:S) -> C(c(y:S,z:S,z:S),a,a) B(y:S,z:S) -> C(y:S,z:S,z:S) C(f(z:S),f(c(a,x:S,a)),y:S) -> B(x:S,z:S) C(f(z:S),f(c(a,x:S,a)),y:S) -> C(f(b(x:S,z:S)),c(z:S,y:S,a),a) C(f(z:S),f(c(a,x:S,a)),y:S) -> C(z:S,y:S,a) -> Rules: b(b(z:S,y:S),a) -> z:S b(y:S,z:S) -> f(c(c(y:S,z:S,z:S),a,a)) c(f(z:S),f(c(a,x:S,a)),y:S) -> c(f(b(x:S,z:S)),c(z:S,y:S,a),a) Problem 1: SCC Processor: -> Pairs: B(y:S,z:S) -> C(c(y:S,z:S,z:S),a,a) B(y:S,z:S) -> C(y:S,z:S,z:S) C(f(z:S),f(c(a,x:S,a)),y:S) -> B(x:S,z:S) C(f(z:S),f(c(a,x:S,a)),y:S) -> C(f(b(x:S,z:S)),c(z:S,y:S,a),a) C(f(z:S),f(c(a,x:S,a)),y:S) -> C(z:S,y:S,a) -> Rules: b(b(z:S,y:S),a) -> z:S b(y:S,z:S) -> f(c(c(y:S,z:S,z:S),a,a)) c(f(z:S),f(c(a,x:S,a)),y:S) -> c(f(b(x:S,z:S)),c(z:S,y:S,a),a) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: B(y:S,z:S) -> C(y:S,z:S,z:S) C(f(z:S),f(c(a,x:S,a)),y:S) -> B(x:S,z:S) C(f(z:S),f(c(a,x:S,a)),y:S) -> C(f(b(x:S,z:S)),c(z:S,y:S,a),a) C(f(z:S),f(c(a,x:S,a)),y:S) -> C(z:S,y:S,a) ->->-> Rules: b(b(z:S,y:S),a) -> z:S b(y:S,z:S) -> f(c(c(y:S,z:S,z:S),a,a)) c(f(z:S),f(c(a,x:S,a)),y:S) -> c(f(b(x:S,z:S)),c(z:S,y:S,a),a) Problem 1: Reduction Pair Processor: -> Pairs: B(y:S,z:S) -> C(y:S,z:S,z:S) C(f(z:S),f(c(a,x:S,a)),y:S) -> B(x:S,z:S) C(f(z:S),f(c(a,x:S,a)),y:S) -> C(f(b(x:S,z:S)),c(z:S,y:S,a),a) C(f(z:S),f(c(a,x:S,a)),y:S) -> C(z:S,y:S,a) -> Rules: b(b(z:S,y:S),a) -> z:S b(y:S,z:S) -> f(c(c(y:S,z:S,z:S),a,a)) c(f(z:S),f(c(a,x:S,a)),y:S) -> c(f(b(x:S,z:S)),c(z:S,y:S,a),a) -> Usable rules: b(b(z:S,y:S),a) -> z:S b(y:S,z:S) -> f(c(c(y:S,z:S,z:S),a,a)) c(f(z:S),f(c(a,x:S,a)),y:S) -> c(f(b(x:S,z:S)),c(z:S,y:S,a),a) ->Mace4 Output: ============================== Mace4 ================================= Mace4 (64) version 2009-11A, November 2009. Process 8050 was started by sandbox2 on n186.star.cs.uiowa.edu, Mon Jun 22 08:13:19 2020 The command was "./mace4 -c -f /tmp/mace41330573317603570492.in". ============================== end of head =========================== ============================== INPUT ================================= % Reading from file /tmp/mace41330573317603570492.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(f3(x1,x2,x3),f3(y,x2,x3)) # label(congruence). arrow_s0(x2,y) -> arrow_s0(f3(x1,x2,x3),f3(x1,y,x3)) # label(congruence). arrow_s0(x3,y) -> arrow_s0(f3(x1,x2,x3),f3(x1,x2,y)) # label(congruence). arrow_s0(x1,y) -> arrow_s0(f5(x1),f5(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(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(f2(f2(x3,x2),f4),x3) # label(replacement). arrow_s0(f2(x2,x3),f5(f3(f3(x2,x3,x3),f4,f4))) # label(replacement). arrow_s0(f3(f5(x3),f5(f3(f4,x1,f4)),x2),f3(f5(f2(x1,x3)),f3(x3,x2,f4),f4)) # label(replacement). popout

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

job log

popout

actions

all output return to TRS Standard