TRS Equat 89423 pair #381732629

details

property	value
status	timeout (wallclock)
benchmark	RENAMED-BOOL_complete-noand.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
space	Mixed_AC

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	301.007516861 seconds
cpu usage	362.176604357
max memory	6.620553216E9

stage attributes

unavailable

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Termination of the given ETRS could be proven:

(0) ETRS
(1) EquationalDependencyPairsProof [EQUIVALENT, 56 ms]
(2) EDP
(3) EDependencyGraphProof [EQUIVALENT, 0 ms]
(4) AND
    (5) EDP
        (6) ESharpUsableEquationsProof [EQUIVALENT, 0 ms]
        (7) EDP
        (8) EUsableRulesReductionPairsProof [EQUIVALENT, 0 ms]
        (9) EDP
        (10) EDependencyGraphProof [EQUIVALENT, 0 ms]
        (11) TRUE
    (12) EDP
        (13) ESharpUsableEquationsProof [EQUIVALENT, 1 ms]
        (14) EDP
        (15) EUsableRulesReductionPairsProof [EQUIVALENT, 75 ms]
        (16) EDP
        (17) EDependencyGraphProof [EQUIVALENT, 0 ms]
        (18) TRUE
    (19) EDP
        (20) ESharpUsableEquationsProof [EQUIVALENT, 0 ms]
        (21) EDP
        (22) EDPPoloProof [EQUIVALENT, 180 ms]
        (23) EDP
        (24) PisEmptyProof [EQUIVALENT, 0 ms]
        (25) YES
    (26) EDP
        (27) ESharpUsableEquationsProof [EQUIVALENT, 0 ms]
        (28) EDP
        (29) EDPPoloProof [EQUIVALENT, 16.2 s]
        (30) EDP
        (31) EDependencyGraphProof [EQUIVALENT, 0 ms]
        (32) EDP
        (33) EDPPoloProof [EQUIVALENT, 37.1 s]
        (34) EDP
        (35) EDPPoloProof [EQUIVALENT, 26.2 s]
        (36) EDP
        (37) EDPPoloProof [EQUIVALENT, 36.9 s]
        (38) EDP
        (39) PisEmptyProof [EQUIVALENT, 0 ms]
        (40) YES
    (41) EDP
        (42) ESharpUsableEquationsProof [EQUIVALENT, 0 ms]
        (43) EDP
        (44) EDPPoloProof [EQUIVALENT, 140.2 s]
        (45) EDP
        (46) PisEmptyProof [EQUIVALENT, 0 ms]
        (47) YES


----------------------------------------

(0)
Obligation:
Equational rewrite system:
The TRS R consists of the following rules:

   U101(tt, A, B) -> U102(isBoolKind(A), A, B)
   U102(tt, A, B) -> U103(isBool(B), A, B)
   U103(tt, A, B) -> U104(isBoolKind(B), A, B)
   U104(tt, A, B) -> _xor_(_and_(A, B), _xor_(A, B))
   U11(tt, A) -> U12(isBoolKind(A), A)
   U111(tt, A) -> U112(isBoolKind(A))
   U112(tt) -> false
   U12(tt, A) -> A
   U121(tt, A) -> U122(isBoolKind(A), A)
   U122(tt, A) -> A
   U131(tt, B, U', U) -> U132(isBoolKind(B), B, U', U)
   U132(tt, B, U', U) -> U133(isS(U'), B, U', U)
   U133(tt, B, U', U) -> U134(isSKind(U'), B, U', U)
   U134(tt, B, U', U) -> U135(isS(U), B, U', U)
   U135(tt, B, U', U) -> U136(isSKind(U), B, U')
   U136(tt, B, U') -> U137(equal(_isNotEqualTo_(B, true), true), U')
   U137(tt, U') -> U'
   U141(tt, U', U) -> U142(isSKind(U'), U)
   U142(tt, U) -> U143(isS(U), U)
   U143(tt, U) -> U144(isSKind(U), U)
   U144(tt, U) -> U
   U151(tt, V1, V2) -> U152(isBoolKind(V1), V1, V2)
   U152(tt, V1, V2) -> U153(isBoolKind(V2), V1, V2)
   U153(tt, V1, V2) -> U154(isBoolKind(V2), V1, V2)
   U154(tt, V1, V2) -> U155(isBool(V1), V2)
   U155(tt, V2) -> U156(isBool(V2))
   U156(tt) -> tt
   U161(tt, V1, V2) -> U162(isBoolKind(V1), V1, V2)
   U162(tt, V1, V2) -> U163(isBoolKind(V2), V1, V2)
   U163(tt, V1, V2) -> U164(isBoolKind(V2), V1, V2)

popout

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

job log

popout

actions all output return to TRS Equat 89423