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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.16603 seconds
cpu usage	12.9093
user time	12.4625
system time	0.446855
max virtual memory	1.8424648E7
max residence set size	912032.0

stage attributes

key	value
starexec-result	NO

output

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

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

job log

popout

actions

all output return to TRS_Equational 2019-03-21 05.09