details

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

run statistics

property	value
solver	AProVE21
configuration	certified
runtime (wallclock)	2.33651208878 seconds
cpu usage	5.971085866
max memory	4.77351936E8

stage attributes

key	value
certification-result	CERTIFIED
starexec-result	YES
certification-time	0.07

output

/export/starexec/sandbox/solver/bin/starexec_run_certified /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES <?xml version="1.0" encoding="UTF-8" standalone="no"?><?xml-stylesheet type="text/xsl" href="cpfHTML.xsl"?><certificationProblem xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:noNamespaceSchemaLocation="cpf.xsd"><input><trsInput><trs><rules><rule><lhs><funapp><name>append</name><arg><var>@l1</var></arg><arg><var>@l2</var></arg></funapp></lhs><rhs><funapp><name>append#1</name><arg><var>@l1</var></arg><arg><var>@l2</var></arg></funapp></rhs></rule><rule><lhs><funapp><name>append#1</name><arg><funapp><name>::</name><arg><var>@x</var></arg><arg><var>@xs</var></arg></funapp></arg><arg><var>@l2</var></arg></funapp></lhs><rhs><funapp><name>::</name><arg><var>@x</var></arg><arg><funapp><name>append</name><arg><var>@xs</var></arg><arg><var>@l2</var></arg></funapp></arg></funapp></rhs></rule><rule><lhs><funapp><name>append#1</name><arg><funapp><name>nil</name></funapp></arg><arg><var>@l2</var></arg></funapp></lhs><rhs><var>@l2</var></rhs></rule><rule><lhs><funapp><name>subtrees</name><arg><var>@t</var></arg></funapp></lhs><rhs><funapp><name>subtrees#1</name><arg><var>@t</var></arg></funapp></rhs></rule><rule><lhs><funapp><name>subtrees#1</name><arg><funapp><name>leaf</name></funapp></arg></funapp></lhs><rhs><funapp><name>nil</name></funapp></rhs></rule><rule><lhs><funapp><name>subtrees#1</name><arg><funapp><name>node</name><arg><var>@x</var></arg><arg><var>@t1</var></arg><arg><var>@t2</var></arg></funapp></arg></funapp></lhs><rhs><funapp><name>subtrees#2</name><arg><funapp><name>subtrees</name><arg><var>@t1</var></arg></funapp></arg><arg><var>@t1</var></arg><arg><var>@t2</var></arg><arg><var>@x</var></arg></funapp></rhs></rule><rule><lhs><funapp><name>subtrees#2</name><arg><var>@l1</var></arg><arg><var>@t1</var></arg><arg><var>@t2</var></arg><arg><var>@x</var></arg></funapp></lhs><rhs><funapp><name>subtrees#3</name><arg><funapp><name>subtrees</name><arg><var>@t2</var></arg></funapp></arg><arg><var>@l1</var></arg><arg><var>@t1</var></arg><arg><var>@t2</var></arg><arg><var>@x</var></arg></funapp></rhs></rule><rule><lhs><funapp><name>subtrees#3</name><arg><var>@l2</var></arg><arg><var>@l1</var></arg><arg><var>@t1</var></arg><arg><var>@t2</var></arg><arg><var>@x</var></arg></funapp></lhs><rhs><funapp><name>::</name><arg><funapp><name>node</name><arg><var>@x</var></arg><arg><var>@t1</var></arg><arg><var>@t2</var></arg></funapp></arg><arg><funapp><name>append</name><arg><var>@l1</var></arg><arg><var>@l2</var></arg></funapp></arg></funapp></rhs></rule></rules></trs><strategy><innermost/></strategy></trsInput></input><cpfVersion>2.1</cpfVersion><proof><trsTerminationProof><ruleRemoval><orderingConstraintProof><redPair><pathOrder><statusPrecedence><statusPrecedenceEntry><name>append</name><arity>2</arity><precedence>1</precedence><mul/></statusPrecedenceEntry><statusPrecedenceEntry><name>append#1</name><arity>2</arity><precedence>1</precedence><mul/></statusPrecedenceEntry><statusPrecedenceEntry><name>::</name><arity>2</arity><precedence>0</precedence><mul/></statusPrecedenceEntry><statusPrecedenceEntry><name>nil</name><arity>0</arity><precedence>3</precedence><mul/></statusPrecedenceEntry><statusPrecedenceEntry><name>subtrees</name><arity>1</arity><precedence>3</precedence><lex/></statusPrecedenceEntry><statusPrecedenceEntry><name>subtrees#1</name><arity>1</arity><precedence>3</precedence><lex/></statusPrecedenceEntry><statusPrecedenceEntry><name>leaf</name><arity>0</arity><precedence>4</precedence><mul/></statusPrecedenceEntry><statusPrecedenceEntry><name>node</name><arity>3</arity><precedence>2</precedence><mul/></statusPrecedenceEntry><statusPrecedenceEntry><name>subtrees#2</name><arity>4</arity><precedence>3</precedence><lex/></statusPrecedenceEntry><statusPrecedenceEntry><name>subtrees#3</name><arity>5</arity><precedence>2</precedence><mul/></statusPrecedenceEntry></statusPrecedence><argumentFilter><argumentFilterEntry><name>append</name><arity>2</arity><nonCollapsing><position>1</position><position>2</position></nonCollapsing></argumentFilterEntry><argumentFilterEntry><name>append#1</name><arity>2</arity><nonCollapsing><position>1</position><position>2</position></nonCollapsing></argumentFilterEntry><argumentFilterEntry><name>::</name><arity>2</arity><nonCollapsing><position>1</position><position>2</position></nonCollapsing></argumentFilterEntry><argumentFilterEntry><name>nil</name><arity>0</arity><nonCollapsing/></argumentFilterEntry><argumentFilterEntry><name>subtrees</name><arity>1</arity><nonCollapsing><position>1</position></nonCollapsing></argumentFilterEntry><argumentFilterEntry><name>subtrees#1</name><arity>1</arity><nonCollapsing><position>1</position></nonCollapsing></argumentFilterEntry><argumentFilterEntry><name>leaf</name><arity>0</arity><nonCollapsing/></argumentFilterEntry><argumentFilterEntry><name>node</name><arity>3</arity><nonCollapsing><position>1</position><position>2</position><position>3</position></nonCollapsing></argumentFilterEntry><argumentFilterEntry><name>subtrees#2</name><arity>4</arity><nonCollapsing><position>3</position><position>1</position><position>2</position><position>4</position></nonCollapsing></argumentFilterEntry><argumentFilterEntry><name>subtrees#3</name><arity>5</arity><nonCollapsing><position>1</position><position>2</position><position>3</position><position>4</position><position>5</position></nonCollapsing></argumentFilterEntry></argumentFilter></pathOrder></redPair></orderingConstraintProof><trs><rules><rule><lhs><funapp><name>append</name><arg><var>@l1</var></arg><arg><var>@l2</var></arg></funapp></lhs><rhs><funapp><name>append#1</name><arg><var>@l1</var></arg><arg><var>@l2</var></arg></funapp></rhs></rule><rule><lhs><funapp><name>subtrees</name><arg><var>@t</var></arg></funapp></lhs><rhs><funapp><name>subtrees#1</name><arg><var>@t</var></arg></funapp></rhs></rule></rules></trs><trsTerminationProof><ruleRemoval><orderingConstraintProof><redPair><interpretation><type><polynomial><domain><naturals/></domain><degree>1</degree></polynomial></type><interpret><name>append</name><arity>2</arity><polynomial><sum><polynomial><coefficient><integer>1</integer></coefficient></polynomial><polynomial><product><polynomial><coefficient><integer>2</integer></coefficient></polynomial><polynomial><variable>1</variable></polynomial></product></polynomial><polynomial><product><polynomial><coefficient><integer>2</integer></coefficient></polynomial><polynomial><variable>2</variable></polynomial></product></polynomial></sum></polynomial></interpret><interpret><name>append#1</name><arity>2</arity><polynomial><sum><polynomial><product><polynomial><coefficient><integer>2</integer></coefficient></polynomial><polynomial><variable>1</variable></polynomial></product></polynomial><polynomial><product><polynomial><coefficient><integer>2</integer></coefficient></polynomial><polynomial><variable>2</variable></polynomial></product></polynomial></sum></polynomial></interpret><interpret><name>subtrees</name><arity>1</arity><polynomial><sum><polynomial><coefficient><integer>1</integer></coefficient></polynomial><polynomial><product><polynomial><coefficient><integer>2</integer></coefficient></polynomial><polynomial><variable>1</variable></polynomial></product></polynomial></sum></polynomial></interpret><interpret><name>subtrees#1</name><arity>1</arity><polynomial><sum><polynomial><coefficient><integer>1</integer></coefficient></polynomial><polynomial><product><polynomial><coefficient><integer>2</integer></coefficient></polynomial><polynomial><variable>1</variable></polynomial></product></polynomial></sum></polynomial></interpret></interpretation></redPair></orderingConstraintProof><trs><rules><rule><lhs><funapp><name>subtrees</name><arg><var>@t</var></arg></funapp></lhs><rhs><funapp><name>subtrees#1</name><arg><var>@t</var></arg></funapp></rhs></rule></rules></trs><trsTerminationProof><ruleRemoval><orderingConstraintProof><redPair><knuthBendixOrder><w0>1</w0><precedenceWeight><precedenceWeightEntry><name>subtrees</name><arity>1</arity><precedence>1</precedence><weight>1</weight></precedenceWeightEntry><precedenceWeightEntry><name>subtrees#1</name><arity>1</arity><precedence>0</precedence><weight>1</weight></precedenceWeightEntry></precedenceWeight></knuthBendixOrder></redPair></orderingConstraintProof><trs><rules/></trs><trsTerminationProof><rIsEmpty/></trsTerminationProof></ruleRemoval></trsTerminationProof></ruleRemoval></trsTerminationProof></ruleRemoval></trsTerminationProof></proof><origin><proofOrigin><tool><name>AProVE</name><version>AProVE Commit ID: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished </version><strategy>Statistics for single proof: 100.00 % (4 real / 0 unknown / 0 assumptions / 4 total proof steps)</strategy><url>http://aprove.informatik.rwth-aachen.de</url></tool><toolUser><firstName>John</firstName><lastName>Doe</lastName></toolUser></proofOrigin><inputOrigin/></origin></certificationProblem> popout

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

job log

popout

actions

all output return to TRS Innermost Certified