Java Bytec 64199 pair #381919285

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.29335713387 seconds
cpu usage	16.572732403
max memory	1.297207296E9

stage attributes

key	value
output-size	182477
starexec-result	YES

output

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


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


YES
proof of /export/starexec/sandbox2/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, 96 ms]
(2) JBC problem
(3) JBCToGraph [EQUIVALENT, 1640 ms]
(4) JBCTerminationGraph
(5) TerminationGraphToSCCProof [SOUND, 0 ms]
(6) AND
    (7) JBCTerminationSCC
        (8) SCCToQDPProof [SOUND, 665 ms]
        (9) QDP
        (10) DependencyGraphProof [EQUIVALENT, 0 ms]
        (11) QDP
        (12) UsableRulesProof [EQUIVALENT, 0 ms]
        (13) QDP
        (14) QReductionProof [EQUIVALENT, 0 ms]
        (15) QDP
        (16) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (17) YES
    (18) JBCTerminationSCC
        (19) SCCToIRSProof [SOUND, 338 ms]
        (20) IRSwT
        (21) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
        (22) IRSwT
        (23) IRSwTTerminationDigraphProof [EQUIVALENT, 93 ms]
        (24) IRSwT
        (25) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (26) IRSwT
        (27) TempFilterProof [SOUND, 75 ms]
        (28) IntTRS
        (29) PolynomialOrderProcessor [EQUIVALENT, 26 ms]
        (30) IntTRS
        (31) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
        (32) 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;

popout

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

job log

popout

actions all output return to Java Bytec 64199