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	n137.star.cs.uiowa.edu
space	Mixed_AC

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	7.81989 seconds
cpu usage	15.9261
user time	15.3858
system time	0.54029
max virtual memory	1.8418736E7
max residence set size	1082192.0

stage attributes

key	value
starexec-result	NO

output

NO proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given ETRS could be disproven: (0) ETRS (1) RRRPoloETRSProof [EQUIVALENT, 195 ms] (2) ETRS (3) RRRPoloETRSProof [EQUIVALENT, 66 ms] (4) ETRS (5) RRRPoloETRSProof [EQUIVALENT, 58 ms] (6) ETRS (7) RRRPoloETRSProof [EQUIVALENT, 48 ms] (8) ETRS (9) RRRPoloETRSProof [EQUIVALENT, 63 ms] (10) ETRS (11) RRRPoloETRSProof [EQUIVALENT, 31 ms] (12) ETRS (13) EquationalDependencyPairsProof [EQUIVALENT, 10 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, 5 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 _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 popout

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

job log

popout

actions

all output return to TRS Equational