details

property	value
status	complete
benchmark	RENAMED-BOOL_nosorts.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n055.star.cs.uiowa.edu
space	Mixed_AC

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	13.1704611778 seconds
cpu usage	16.679054861
max memory	1.124982784E9

stage attributes

key	value
output-size	32670
starexec-result	NO

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination of the given ETRS could be disproven: (0) ETRS (1) RRRPoloETRSProof [EQUIVALENT, 245 ms] (2) ETRS (3) RRRPoloETRSProof [EQUIVALENT, 81 ms] (4) ETRS (5) RRRPoloETRSProof [EQUIVALENT, 59 ms] (6) ETRS (7) RRRPoloETRSProof [EQUIVALENT, 19 ms] (8) ETRS (9) RRRPoloETRSProof [EQUIVALENT, 16 ms] (10) ETRS (11) RRRPoloETRSProof [EQUIVALENT, 15 ms] (12) ETRS (13) EquationalDependencyPairsProof [EQUIVALENT, 0 ms] (14) EDP (15) EDependencyGraphProof [EQUIVALENT, 0 ms] (16) EDP (17) EUsableRulesReductionPairsProof [EQUIVALENT, 0 ms] (18) EDP (19) EDPProblemToQDPProblemProof [EQUIVALENT, 0 ms] (20) QDP (21) TransformationProof [EQUIVALENT, 0 ms] (22) QDP (23) TransformationProof [EQUIVALENT, 0 ms] (24) QDP (25) NonTerminationLoopProof [COMPLETE, 0 ms] (26) NO ---------------------------------------- (0) Obligation: Equational rewrite system: The TRS R consists of the following rules: U11(tt, U', U) -> U12(equal(_isNotEqualTo_(U, U'), true)) U12(tt) -> false U21(tt, B, U') -> U22(equal(_isNotEqualTo_(B, true), true), U') U22(tt, U') -> U' _and_(A, A) -> A _and_(A, _xor_(B, C)) -> _xor_(_and_(A, B), _and_(A, C)) _and_(false, A) -> false _and_(true, A) -> A _implies_(A, B) -> not_(_xor_(A, _and_(A, B))) _isEqualTo_(U, U') -> U11(tt, U', U) _isEqualTo_(U, U) -> true _isNotEqualTo_(U, U') -> if_then_else_fi(_isEqualTo_(U, U'), false, true) _isNotEqualTo_(U, U) -> false _or_(A, B) -> _xor_(_and_(A, B), _xor_(A, B)) _xor_(A, A) -> false _xor_(false, A) -> A and(tt, X) -> X equal(X, X) -> tt if_then_else_fi(B, U, U') -> U21(tt, B, U') if_then_else_fi(true, U, U') -> U not_(A) -> _xor_(A, true) not_(false) -> true not_(true) -> false The set E consists of the following equations: _and_(x, y) == _and_(y, x) _or_(x, y) == _or_(y, x) _xor_(x, y) == _xor_(y, x) _and_(_and_(x, y), z) == _and_(x, _and_(y, z)) _or_(_or_(x, y), z) == _or_(x, _or_(y, z)) _xor_(_xor_(x, y), z) == _xor_(x, _xor_(y, z)) ---------------------------------------- (1) RRRPoloETRSProof (EQUIVALENT) The following E TRS is given: Equational rewrite system: The TRS R consists of the following rules: U11(tt, U', U) -> U12(equal(_isNotEqualTo_(U, U'), true)) U12(tt) -> false U21(tt, B, U') -> U22(equal(_isNotEqualTo_(B, true), true), U') U22(tt, U') -> U' _and_(A, A) -> A _and_(A, _xor_(B, C)) -> _xor_(_and_(A, B), _and_(A, C)) _and_(false, A) -> false _and_(true, A) -> A _implies_(A, B) -> not_(_xor_(A, _and_(A, B))) _isEqualTo_(U, U') -> U11(tt, U', U) _isEqualTo_(U, U) -> true popout

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

job log

popout

actions

all output return to TRS Equational