details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	14.8336389065 seconds
cpu usage	28.6778437
max memory	1.265528832E9

stage attributes

key	value
output-size	57199
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination of the given ETRS could be disproven: (0) ETRS (1) RRRPoloETRSProof [EQUIVALENT, 284 ms] (2) ETRS (3) RRRPoloETRSProof [EQUIVALENT, 132 ms] (4) ETRS (5) RRRPoloETRSProof [EQUIVALENT, 87 ms] (6) ETRS (7) RRRPoloETRSProof [EQUIVALENT, 117 ms] (8) ETRS (9) RRRPoloETRSProof [EQUIVALENT, 65 ms] (10) ETRS (11) EquationalDependencyPairsProof [EQUIVALENT, 58 ms] (12) EDP (13) EDependencyGraphProof [EQUIVALENT, 0 ms] (14) AND (15) EDP (16) ESharpUsableEquationsProof [EQUIVALENT, 0 ms] (17) EDP (18) EUsableRulesReductionPairsProof [EQUIVALENT, 0 ms] (19) EDP (20) EDPProblemToQDPProblemProof [EQUIVALENT, 7 ms] (21) QDP (22) TransformationProof [EQUIVALENT, 0 ms] (23) QDP (24) TransformationProof [EQUIVALENT, 0 ms] (25) QDP (26) TransformationProof [EQUIVALENT, 0 ms] (27) QDP (28) TransformationProof [EQUIVALENT, 0 ms] (29) QDP (30) NonTerminationLoopProof [COMPLETE, 0 ms] (31) NO (32) EDP ---------------------------------------- (0) Obligation: Equational rewrite system: The TRS R consists of the following rules: U11(tt, A, B, C) -> U12(tt, A, B, C) U12(tt, A, B, C) -> U13(tt, A, B, C) U13(tt, A, B, C) -> _xor_(_and_(A, B), _and_(A, C)) U21(tt, A, B) -> U22(tt, A, B) U22(tt, A, B) -> not_(_xor_(A, _and_(A, B))) U31(tt, U', U) -> U32(tt, U', U) U32(tt, U', U) -> U33(equal(_isNotEqualTo_(U, U'), true)) U33(tt) -> false U41(tt, U', U) -> U42(tt, U', U) U42(tt, U', U) -> if_then_else_fi(_isEqualTo_(U, U'), false, true) U51(tt, A, B) -> U52(tt, A, B) U52(tt, A, B) -> _xor_(_and_(A, B), _xor_(A, B)) U61(tt, B, U') -> U62(tt, B, U') U62(tt, B, U') -> U63(tt, B, U') U63(tt, B, U') -> U64(equal(_isNotEqualTo_(B, true), true), U') U64(tt, U') -> U' U71(tt, U) -> U72(tt, U) U72(tt, U) -> U _and_(A, A) -> A _and_(A, _xor_(B, C)) -> U11(tt, A, B, C) _and_(false, A) -> false _and_(true, A) -> A _implies_(A, B) -> U21(tt, A, B) _isEqualTo_(U, U') -> U31(tt, U', U) _isEqualTo_(U, U) -> true _isNotEqualTo_(U, U') -> U41(tt, U', U) _isNotEqualTo_(U, U) -> false _or_(A, B) -> U51(tt, A, B) _xor_(A, A) -> false _xor_(false, A) -> A equal(X, X) -> tt if_then_else_fi(B, U, U') -> U61(tt, B, U') if_then_else_fi(true, U, U') -> U71(tt, 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)) popout

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

job log

popout

actions

all output return to TRS Equat 89423