details

property	value
status	complete
benchmark	jlap09-ex16.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n147.star.cs.uiowa.edu
space	Mixed_CTRS_2014

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.146811 seconds
cpu usage	0.062157
user time	0.034315
system time	0.027842
max virtual memory	113176.0
max residence set size	7564.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) -> c | a ->* b 0.00/0.14 g(x:S,x:S) -> g(f(a),f(b)) 0.00/0.14 ) 0.00/0.14 0.00/0.14 Problem 1: 0.00/0.14 Valid CTRS Processor: 0.00/0.14 -> Rules: 0.00/0.14 f(x:S) -> c | a ->* b 0.00/0.14 g(x:S,x:S) -> g(f(a),f(b)) 0.00/0.14 -> The system is a deterministic 3-CTRS. 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 0.00/0.14 Conditional Termination Problem 1: 0.00/0.14 -> Pairs: 0.00/0.14 G(x:S,x:S) -> F(a) 0.00/0.14 G(x:S,x:S) -> F(b) 0.00/0.14 G(x:S,x:S) -> G(f(a),f(b)) 0.00/0.14 -> QPairs: 0.00/0.14 Empty 0.00/0.14 -> Rules: 0.00/0.14 f(x:S) -> c | a ->* b 0.00/0.14 g(x:S,x:S) -> g(f(a),f(b)) 0.00/0.14 0.00/0.14 Conditional Termination Problem 2: 0.00/0.14 -> Pairs: 0.00/0.14 Empty 0.00/0.14 -> QPairs: 0.00/0.14 Empty 0.00/0.14 -> Rules: 0.00/0.14 f(x:S) -> c | a ->* b 0.00/0.14 g(x:S,x:S) -> g(f(a),f(b)) 0.00/0.14 0.00/0.14 0.00/0.14 The problem is decomposed in 2 subproblems. 0.00/0.14 0.00/0.14 Problem 1.1: 0.00/0.14 0.00/0.14 SCC Processor: 0.00/0.14 -> Pairs: 0.00/0.14 G(x:S,x:S) -> F(a) 0.00/0.14 G(x:S,x:S) -> F(b) 0.00/0.14 G(x:S,x:S) -> G(f(a),f(b)) 0.00/0.14 -> QPairs: 0.00/0.14 Empty 0.00/0.14 -> Rules: 0.00/0.14 f(x:S) -> c | a ->* b 0.00/0.14 g(x:S,x:S) -> g(f(a),f(b)) 0.00/0.14 ->Strongly Connected Components: 0.00/0.14 ->->Cycle: 0.00/0.14 ->->-> Pairs: 0.00/0.14 G(x:S,x:S) -> G(f(a),f(b)) 0.00/0.14 -> QPairs: 0.00/0.14 Empty 0.00/0.14 ->->-> Rules: 0.00/0.14 f(x:S) -> c | a ->* b 0.00/0.14 g(x:S,x:S) -> g(f(a),f(b)) 0.00/0.14 0.00/0.14 Problem 1.1: 0.00/0.14 0.00/0.14 Reduction Pair Processor: 0.00/0.14 -> Pairs: 0.00/0.14 G(x:S,x:S) -> G(f(a),f(b)) 0.00/0.14 -> Rules: 0.00/0.14 f(x:S) -> c | a ->* b 0.00/0.14 g(x:S,x:S) -> g(f(a),f(b)) 0.00/0.14 -> Needed rules: 0.00/0.14 f(x:S) -> c | a ->* b 0.00/0.14 -> Usable rules: 0.00/0.14 Empty 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 47978 was started by sandbox on n147.star.cs.uiowa.edu, 0.00/0.14 Fri Mar 29 01:51:57 2019 0.00/0.14 The command was "./mace4 -c -f /tmp/mace41957747793424238335.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/mace41957747793424238335.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 arrowStar_s0(x,x) # label(reflexivity). 0.00/0.14 arrow_s0(x,y) & arrowStar_s0(y,z) -> arrowStar_s0(x,z) # label(compatibility). 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),f2(y)) # label(congruence). 0.00/0.14 arrow_s0(x1,y) -> arrow_s0(f3(x1,x2),f3(y,x2)) # label(congruence). popout

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

job log

popout

actions

all output return to TRS_Conditional 2019-03-28 22.59