Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Inner 89993 pair #381734047
details
property
value
status
complete
benchmark
Ex5_Zan97_iGM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n192.star.cs.uiowa.edu
space
Transformed_CSR_innermost_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.36152887344 seconds
cpu usage
6.134599556
max memory
4.21060608E8
stage attributes
key
value
output-size
21751
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 73 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 18 ms] (4) QTRS (5) DependencyPairsProof [EQUIVALENT, 0 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) AND (9) QDP (10) UsableRulesProof [EQUIVALENT, 0 ms] (11) QDP (12) QReductionProof [EQUIVALENT, 0 ms] (13) QDP (14) QDPSizeChangeProof [EQUIVALENT, 0 ms] (15) YES (16) QDP (17) UsableRulesProof [EQUIVALENT, 0 ms] (18) QDP (19) QReductionProof [EQUIVALENT, 0 ms] (20) QDP (21) QDPSizeChangeProof [EQUIVALENT, 0 ms] (22) YES (23) QDP (24) MRRProof [EQUIVALENT, 0 ms] (25) QDP (26) QDPOrderProof [EQUIVALENT, 17 ms] (27) QDP (28) DependencyGraphProof [EQUIVALENT, 0 ms] (29) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: active(f(X)) -> mark(if(X, c, f(true))) active(if(true, X, Y)) -> mark(X) active(if(false, X, Y)) -> mark(Y) mark(f(X)) -> active(f(mark(X))) mark(if(X1, X2, X3)) -> active(if(mark(X1), mark(X2), X3)) mark(c) -> active(c) mark(true) -> active(true) mark(false) -> active(false) f(mark(X)) -> f(X) f(active(X)) -> f(X) if(mark(X1), X2, X3) -> if(X1, X2, X3) if(X1, mark(X2), X3) -> if(X1, X2, X3) if(X1, X2, mark(X3)) -> if(X1, X2, X3) if(active(X1), X2, X3) -> if(X1, X2, X3) if(X1, active(X2), X3) -> if(X1, X2, X3) if(X1, X2, active(X3)) -> if(X1, X2, X3) The set Q consists of the following terms: active(f(x0)) active(if(true, x0, x1)) active(if(false, x0, x1)) mark(f(x0)) mark(if(x0, x1, x2)) mark(c) mark(true) mark(false) f(mark(x0)) f(active(x0)) if(mark(x0), x1, x2) if(x0, mark(x1), x2) if(x0, x1, mark(x2)) if(active(x0), x1, x2) if(x0, active(x1), x2) if(x0, x1, active(x2)) ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(active(x_1)) = x_1 POL(c) = 0 POL(f(x_1)) = x_1 POL(false) = 1 POL(if(x_1, x_2, x_3)) = x_1 + x_2 + x_3
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Inner 89993