Java Bytec 64199 pair #381919224

details

property	value
status	complete
benchmark	TermsCreateMatch.jar
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n039.star.cs.uiowa.edu
space	AProVE_11_recursive

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	8.96111893654 seconds
cpu usage	24.034407469
max memory	1.494573056E9

stage attributes

key	value
output-size	103716
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.jar /export/starexec/sandbox/output/output_files


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


YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.jar
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


termination of the given Bare JBC problem could be proven:

(0) Bare JBC problem
(1) BareJBCToJBCProof [EQUIVALENT, 97 ms]
(2) JBC problem
(3) JBCToGraph [EQUIVALENT, 2856 ms]
(4) JBCTerminationGraph
(5) TerminationGraphToSCCProof [SOUND, 0 ms]
(6) AND
    (7) JBCTerminationSCC
        (8) SCCToQDPProof [SOUND, 1668 ms]
        (9) QDP
        (10) DependencyGraphProof [EQUIVALENT, 0 ms]
        (11) QDP
        (12) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (13) YES
    (14) JBCTerminationSCC
        (15) SCCToIRSProof [SOUND, 376 ms]
        (16) IRSwT
        (17) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
        (18) IRSwT
        (19) IRSwTTerminationDigraphProof [EQUIVALENT, 107 ms]
        (20) IRSwT
        (21) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (22) IRSwT
        (23) TempFilterProof [SOUND, 77 ms]
        (24) IntTRS
        (25) PolynomialOrderProcessor [EQUIVALENT, 14 ms]
        (26) IntTRS
        (27) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
        (28) YES


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

(0)
Obligation:
need to prove termination of the following program:
package Terms;

public final class FunctionApplication extends Term {
	FunctionSymbol fs;
	List<Term> args;
	
	public FunctionApplication(FunctionSymbol f, List<Term> a) {
		this.fs = f;
		this.args = a;
	}

	public void collectVariables(List<Variable> vars) {
		List<Term> cur = this.args;
		while (cur != null) {
			cur.value.collectVariables(vars);
			cur = cur.next;
		}
	}

	public Map<Variable, Term> extendMatchingSubstitution(Map<Variable, Term> sigma, Term that) {
		if (that instanceof Variable) {
			return null;
		}
		FunctionApplication fThat = (FunctionApplication) that;
		if (this.fs.equals(fThat.fs)) {
			List<Term> curThisArg = this.args; 
			List<Term> curThatArg = fThat.args; 
			while (curThisArg != null && curThatArg != null) {
				sigma = curThisArg.value.extendMatchingSubstitution(sigma, curThatArg.value);
				if (sigma == null) {
					return null;
				}
				curThisArg = curThisArg.next;
				curThatArg = curThatArg.next;
			}
			return sigma;
		} else {
			return null;
		}
	}


	public int getDepth(){
		int currentMaximum=0;
		List<Term> cur = this.args;
		while (cur != null) {
			int currentDepth = cur.value.getDepth()+1;
			if (currentDepth > currentMaximum) currentMaximum=currentDepth;
			cur = cur.next;
		}
		return currentMaximum;

popout

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

job log

popout

actions all output return to Java Bytec 64199