Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516962715
details
property
value
status
complete
benchmark
Ex2_Luc03b_iGM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n029.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE21
configuration
standard
runtime (wallclock)
3.62321901321 seconds
cpu usage
11.077302386
max memory
7.4938368E8
stage attributes
key
value
output-size
40694
starexec-result
YES
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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) DependencyPairsProof [EQUIVALENT, 64 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 0 ms] (4) AND (5) QDP (6) UsableRulesProof [EQUIVALENT, 0 ms] (7) QDP (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] (9) YES (10) QDP (11) UsableRulesProof [EQUIVALENT, 0 ms] (12) QDP (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] (14) YES (15) QDP (16) UsableRulesProof [EQUIVALENT, 0 ms] (17) QDP (18) QDPSizeChangeProof [EQUIVALENT, 0 ms] (19) YES (20) QDP (21) UsableRulesProof [EQUIVALENT, 0 ms] (22) QDP (23) QDPSizeChangeProof [EQUIVALENT, 0 ms] (24) YES (25) QDP (26) UsableRulesProof [EQUIVALENT, 0 ms] (27) QDP (28) QDPSizeChangeProof [EQUIVALENT, 0 ms] (29) YES (30) QDP (31) UsableRulesProof [EQUIVALENT, 0 ms] (32) QDP (33) QDPSizeChangeProof [EQUIVALENT, 0 ms] (34) YES (35) QDP (36) QDPOrderProof [EQUIVALENT, 77 ms] (37) QDP (38) QDPOrderProof [EQUIVALENT, 25 ms] (39) QDP (40) QDPOrderProof [EQUIVALENT, 39 ms] (41) QDP (42) DependencyGraphProof [EQUIVALENT, 0 ms] (43) QDP (44) UsableRulesProof [EQUIVALENT, 0 ms] (45) QDP (46) QDPSizeChangeProof [EQUIVALENT, 0 ms] (47) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: active(fst(0, Z)) -> mark(nil) active(fst(s(X), cons(Y, Z))) -> mark(cons(Y, fst(X, Z))) active(from(X)) -> mark(cons(X, from(s(X)))) active(add(0, X)) -> mark(X) active(add(s(X), Y)) -> mark(s(add(X, Y))) active(len(nil)) -> mark(0) active(len(cons(X, Z))) -> mark(s(len(Z))) mark(fst(X1, X2)) -> active(fst(mark(X1), mark(X2))) mark(0) -> active(0) mark(nil) -> active(nil) mark(s(X)) -> active(s(X)) mark(cons(X1, X2)) -> active(cons(mark(X1), X2)) mark(from(X)) -> active(from(mark(X))) mark(add(X1, X2)) -> active(add(mark(X1), mark(X2))) mark(len(X)) -> active(len(mark(X))) fst(mark(X1), X2) -> fst(X1, X2) fst(X1, mark(X2)) -> fst(X1, X2) fst(active(X1), X2) -> fst(X1, X2) fst(X1, active(X2)) -> fst(X1, X2) s(mark(X)) -> s(X) s(active(X)) -> s(X) cons(mark(X1), X2) -> cons(X1, X2) cons(X1, mark(X2)) -> cons(X1, X2) cons(active(X1), X2) -> cons(X1, X2) cons(X1, active(X2)) -> cons(X1, X2) from(mark(X)) -> from(X) from(active(X)) -> from(X) add(mark(X1), X2) -> add(X1, X2) add(X1, mark(X2)) -> add(X1, X2) add(active(X1), X2) -> add(X1, X2)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard