details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	14.4856 seconds
cpu usage	24.037
user time	23.2429
system time	0.794035
max virtual memory	1.83454E7
max residence set size	2177368.0

stage attributes

key	value
starexec-result	YES

output

23.76/14.39 YES 23.76/14.40 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 23.76/14.40 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 23.76/14.40 23.76/14.40 23.76/14.40 Termination of the given ETRS could be proven: 23.76/14.40 23.76/14.40 (0) ETRS 23.76/14.40 (1) EquationalDependencyPairsProof [EQUIVALENT, 200 ms] 23.76/14.40 (2) EDP 23.76/14.40 (3) EDependencyGraphProof [EQUIVALENT, 0 ms] 23.76/14.40 (4) AND 23.76/14.40 (5) EDP 23.76/14.40 (6) ESharpUsableEquationsProof [EQUIVALENT, 0 ms] 23.76/14.40 (7) EDP 23.76/14.40 (8) EUsableRulesReductionPairsProof [EQUIVALENT, 55 ms] 23.76/14.40 (9) EDP 23.76/14.40 (10) ERuleRemovalProof [EQUIVALENT, 7 ms] 23.76/14.40 (11) EDP 23.76/14.40 (12) PisEmptyProof [EQUIVALENT, 0 ms] 23.76/14.40 (13) YES 23.76/14.40 (14) EDP 23.76/14.40 (15) ESharpUsableEquationsProof [EQUIVALENT, 0 ms] 23.76/14.40 (16) EDP 23.76/14.40 (17) EDPPoloProof [EQUIVALENT, 3631 ms] 23.76/14.40 (18) EDP 23.76/14.40 (19) PisEmptyProof [EQUIVALENT, 0 ms] 23.76/14.40 (20) YES 23.76/14.40 (21) EDP 23.76/14.40 (22) ESharpUsableEquationsProof [EQUIVALENT, 5 ms] 23.76/14.40 (23) EDP 23.76/14.40 (24) EUsableRulesReductionPairsProof [EQUIVALENT, 0 ms] 23.76/14.40 (25) EDP 23.76/14.40 (26) PisEmptyProof [EQUIVALENT, 0 ms] 23.76/14.40 (27) YES 23.76/14.40 (28) EDP 23.76/14.40 (29) ESharpUsableEquationsProof [EQUIVALENT, 0 ms] 23.76/14.40 (30) EDP 23.76/14.40 (31) EUsableRulesReductionPairsProof [EQUIVALENT, 9 ms] 23.76/14.40 (32) EDP 23.76/14.40 (33) PisEmptyProof [EQUIVALENT, 0 ms] 23.76/14.40 (34) YES 23.76/14.40 (35) EDP 23.76/14.40 (36) ESharpUsableEquationsProof [EQUIVALENT, 0 ms] 23.76/14.40 (37) EDP 23.76/14.40 (38) EDPPoloProof [EQUIVALENT, 0 ms] 23.76/14.40 (39) EDP 23.76/14.40 (40) EUsableRulesReductionPairsProof [EQUIVALENT, 0 ms] 23.76/14.40 (41) EDP 23.76/14.40 (42) PisEmptyProof [EQUIVALENT, 0 ms] 23.76/14.40 (43) YES 23.76/14.40 (44) EDP 23.76/14.40 (45) ESharpUsableEquationsProof [EQUIVALENT, 0 ms] 23.76/14.40 (46) EDP 23.76/14.40 (47) EDPPoloProof [EQUIVALENT, 0 ms] 23.76/14.40 (48) EDP 23.76/14.40 (49) PisEmptyProof [EQUIVALENT, 0 ms] 23.76/14.40 (50) YES 23.76/14.40 23.76/14.40 23.76/14.40 ---------------------------------------- 23.76/14.40 23.76/14.40 (0) 23.76/14.40 Obligation: 23.76/14.40 Equational rewrite system: 23.76/14.40 The TRS R consists of the following rules: 23.76/14.40 23.76/14.40 substt(ef(x), y) -> ef(substt(x, y)) 23.76/14.40 substf(Pe(x), y) -> Pe(substt(x, y)) 23.76/14.40 substf(neg(f), s) -> neg(substf(f, s)) 23.76/14.40 substf(and(f, g), s) -> and(substf(f, s), substf(g, s)) 23.76/14.40 substf(or(f, g), s) -> or(substf(f, s), substf(g, s)) 23.76/14.40 substf(imp(f, g), s) -> imp(substf(f, s), substf(g, s)) 23.76/14.40 substf(forall(f), s) -> forall(substf(f, .(1, ron(s, shift)))) 23.76/14.40 substf(exists(f), s) -> exists(substf(f, .(1, ron(s, shift)))) 23.76/14.40 substt(x, id) -> x 23.76/14.40 substf(f, id) -> f 23.76/14.40 substt(substt(x, s), t) -> substt(x, ron(s, t)) 23.76/14.40 substf(substf(f, s), t) -> substf(f, ron(s, t)) 23.76/14.40 substt(1, .(x, s)) -> x 23.76/14.40 ron(id, s) -> s 23.76/14.40 ron(shift, .(x, s)) -> s 23.76/14.40 ron(ron(s, t), u) -> ron(s, ron(t, u)) 23.76/14.40 ron(.(x, s), t) -> .(substt(x, t), ron(s, t)) 23.76/14.40 ron(s, id) -> s 23.76/14.40 .(1, shift) -> id 23.76/14.40 .(substt(1, s), ron(shift, s)) -> s 23.76/14.40 virg(emptyfset, a) -> a 23.76/14.40 virg(a, a) -> a 23.76/14.40 *(emptysset, a) -> a 23.76/14.40 *(a, a) -> a 23.76/14.40 neg(neg(f)) -> f 23.76/14.40 and(f, f) -> f 23.76/14.40 or(f, f) -> f 23.76/14.40 imp(f, g) -> or(neg(f), g) 23.76/14.40 exists(f) -> neg(forall(neg(f))) 23.76/14.40 sequent(virg(convf(neg(f)), a), b) -> sequent(a, virg(convf(f), b)) 23.76/14.40 sequent(convf(neg(f)), b) -> sequent(emptyfset, virg(convf(f), b)) 23.76/14.40 sequent(a, virg(convf(neg(f)), b)) -> sequent(virg(convf(f), a), b) 23.76/14.40 sequent(a, convf(neg(f))) -> sequent(virg(convf(f), a), emptyfset) 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