Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Innermost pair #487524043
details
property
value
status
complete
benchmark
Ex5_Zan97_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n142.star.cs.uiowa.edu
space
Transformed_CSR_innermost_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.92462420464 seconds
cpu usage
4.542812194
max memory
2.82320896E8
stage attributes
key
value
output-size
7312
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 60 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 0 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 5 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 0 ms] (8) QTRS (9) QTRSRRRProof [EQUIVALENT, 0 ms] (10) QTRS (11) QTRSRRRProof [EQUIVALENT, 3 ms] (12) QTRS (13) RisEmptyProof [EQUIVALENT, 0 ms] (14) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a__f(X) -> a__if(mark(X), c, f(true)) a__if(true, X, Y) -> mark(X) a__if(false, X, Y) -> mark(Y) mark(f(X)) -> a__f(mark(X)) mark(if(X1, X2, X3)) -> a__if(mark(X1), mark(X2), X3) mark(c) -> c mark(true) -> true mark(false) -> false a__f(X) -> f(X) a__if(X1, X2, X3) -> if(X1, X2, X3) The set Q consists of the following terms: a__f(x0) mark(f(x0)) mark(if(x0, x1, x2)) mark(c) mark(true) mark(false) a__if(x0, x1, x2) ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(a__f(x_1)) = 2*x_1 POL(a__if(x_1, x_2, x_3)) = 2*x_1 + x_2 + 2*x_3 POL(c) = 0 POL(f(x_1)) = 2*x_1 POL(false) = 2 POL(if(x_1, x_2, x_3)) = 2*x_1 + x_2 + 2*x_3 POL(mark(x_1)) = x_1 POL(true) = 0 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: a__if(false, X, Y) -> mark(Y) ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a__f(X) -> a__if(mark(X), c, f(true)) a__if(true, X, Y) -> mark(X) mark(f(X)) -> a__f(mark(X)) mark(if(X1, X2, X3)) -> a__if(mark(X1), mark(X2), X3) mark(c) -> c mark(true) -> true mark(false) -> false a__f(X) -> f(X) a__if(X1, X2, X3) -> if(X1, X2, X3) The set Q consists of the following terms: a__f(x0)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Innermost