TRS Standard pair #615305627

details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.217391014099 seconds
cpu usage	0.131937022
max memory	3387392.0

stage attributes

key	value
output-size	7157
starexec-result	"YES"

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES

Problem 1: 

(VAR v_NonEmpty:S x:S)
(RULES
b -> c
f(x:S,x:S) -> f(a,b)
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 b -> c
 f(x:S,x:S) -> f(a,b)
-> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination.
 

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F(x:S,x:S) -> B
 F(x:S,x:S) -> F(a,b)
-> Rules:
 b -> c
 f(x:S,x:S) -> f(a,b)

Problem 1: 

SCC Processor:
-> Pairs:
 F(x:S,x:S) -> B
 F(x:S,x:S) -> F(a,b)
-> Rules:
 b -> c
 f(x:S,x:S) -> f(a,b)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(x:S,x:S) -> F(a,b)
->->-> Rules:
 b -> c
 f(x:S,x:S) -> f(a,b)

Problem 1: 

Reduction Pair Processor:
-> Pairs:
 F(x:S,x:S) -> F(a,b)
-> Rules:
 b -> c
 f(x:S,x:S) -> f(a,b)
-> Usable rules:
 b -> c
->Mace4 Output:
 ============================== Mace4 =================================
Mace4 (64) version 2009-11A, November 2009.
Process 50225 was started by sandbox on n026.star.cs.uiowa.edu,
Thu Aug 24 15:27:30 2023
The command was "./mace4 -c -f /tmp/mace4336465782861021530.in".
============================== end of head ===========================

============================== INPUT =================================

% Reading from file /tmp/mace4336465782861021530.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(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(f9(x1,x2),f9(y,x2)) # label(congruence).
arrow_s0(x2,y) -> arrow_s0(f9(x1,x2),f9(x1,y)) # label(congruence).
arrow_s0(f2,f5) # label(replacement).
arrow_s0(x,y) -> gtrsim_s0(x,y) # label(inclusion).
sqsupset_s0(f9(x1,x1),f9(f4,f2)) # 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.

============================== end of input ==========================

============================== PROCESS NON-CLAUSAL FORMULAS ==========

% Formulas that are not ordinary clauses:

popout

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

job log

popout

actions all output return to TRS Standard