Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381715058
details
property
value
status
complete
benchmark
Ex5_Zan97_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n074.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.70040106773 seconds
cpu usage
3.941650595
max memory
2.40795648E8
stage attributes
key
value
output-size
3418
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 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, 8 ms] (6) QTRS (7) RisEmptyProof [EQUIVALENT, 0 ms] (8) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(X) -> if(X, c, n__f(n__true)) if(true, X, Y) -> X if(false, X, Y) -> activate(Y) f(X) -> n__f(X) true -> n__true activate(n__f(X)) -> f(activate(X)) activate(n__true) -> true activate(X) -> X Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(activate(x_1)) = x_1 POL(c) = 0 POL(f(x_1)) = 2*x_1 POL(false) = 1 POL(if(x_1, x_2, x_3)) = x_1 + x_2 + 2*x_3 POL(n__f(x_1)) = 2*x_1 POL(n__true) = 0 POL(true) = 0 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: if(false, X, Y) -> activate(Y) ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(X) -> if(X, c, n__f(n__true)) if(true, X, Y) -> X f(X) -> n__f(X) true -> n__true activate(n__f(X)) -> f(activate(X)) activate(n__true) -> true activate(X) -> X Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(activate(x_1)) = 2 + 2*x_1 POL(c) = 0 POL(f(x_1)) = 2 + 2*x_1 POL(if(x_1, x_2, x_3)) = x_1 + x_2 + x_3 POL(n__f(x_1)) = 2 + 2*x_1 POL(n__true) = 0 POL(true) = 1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: if(true, X, Y) -> X true -> n__true activate(n__true) -> true activate(X) -> X
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472