Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Innermost pair #516979051
details
property
value
status
complete
benchmark
Ex14_Luc06_iGM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n056.star.cs.uiowa.edu
space
Transformed_CSR_innermost_04
run statistics
property
value
solver
AProVE21
configuration
standard
runtime (wallclock)
3.1309530735 seconds
cpu usage
8.654287828
max memory
5.99195648E8
stage attributes
key
value
output-size
39984
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) DependencyPairsProof [EQUIVALENT, 3 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 0 ms] (4) AND (5) QDP (6) UsableRulesProof [EQUIVALENT, 0 ms] (7) QDP (8) QReductionProof [EQUIVALENT, 0 ms] (9) QDP (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] (11) YES (12) QDP (13) UsableRulesProof [EQUIVALENT, 0 ms] (14) QDP (15) QReductionProof [EQUIVALENT, 0 ms] (16) QDP (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] (18) YES (19) QDP (20) UsableRulesProof [EQUIVALENT, 0 ms] (21) QDP (22) QReductionProof [EQUIVALENT, 0 ms] (23) QDP (24) QDPSizeChangeProof [EQUIVALENT, 0 ms] (25) YES (26) QDP (27) MRRProof [EQUIVALENT, 26 ms] (28) QDP (29) TransformationProof [EQUIVALENT, 0 ms] (30) QDP (31) TransformationProof [EQUIVALENT, 0 ms] (32) QDP (33) TransformationProof [EQUIVALENT, 0 ms] (34) QDP (35) TransformationProof [EQUIVALENT, 0 ms] (36) QDP (37) TransformationProof [EQUIVALENT, 0 ms] (38) QDP (39) TransformationProof [EQUIVALENT, 5 ms] (40) QDP (41) TransformationProof [EQUIVALENT, 0 ms] (42) QDP (43) TransformationProof [EQUIVALENT, 0 ms] (44) QDP (45) QDPQMonotonicMRRProof [EQUIVALENT, 60 ms] (46) QDP (47) DependencyGraphProof [EQUIVALENT, 0 ms] (48) QDP (49) QDPOrderProof [EQUIVALENT, 0 ms] (50) QDP (51) PisEmptyProof [EQUIVALENT, 0 ms] (52) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: active(h(X)) -> mark(g(X, X)) active(g(a, X)) -> mark(f(b, X)) active(f(X, X)) -> mark(h(a)) active(a) -> mark(b) mark(h(X)) -> active(h(mark(X))) mark(g(X1, X2)) -> active(g(mark(X1), X2)) mark(a) -> active(a) mark(f(X1, X2)) -> active(f(mark(X1), X2)) mark(b) -> active(b) h(mark(X)) -> h(X) h(active(X)) -> h(X) g(mark(X1), X2) -> g(X1, X2) g(X1, mark(X2)) -> g(X1, X2) g(active(X1), X2) -> g(X1, X2) g(X1, active(X2)) -> g(X1, X2) f(mark(X1), X2) -> f(X1, X2) f(X1, mark(X2)) -> f(X1, X2) f(active(X1), X2) -> f(X1, X2) f(X1, active(X2)) -> f(X1, X2) The set Q consists of the following terms: active(h(x0)) active(g(a, x0)) active(f(x0, x0))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Innermost