Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516963957
details
property
value
status
complete
benchmark
LPAR_intlist.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n066.star.cs.uiowa.edu
space
AProVE_04
run statistics
property
value
solver
NTI_22
configuration
default
runtime (wallclock)
9.37781405449 seconds
cpu usage
10.346421858
max memory
4.96013312E8
stage attributes
key
value
output-size
2356
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES ** BEGIN proof argument ** All the DP problems were proved finite. As all the involved DP processors are sound, the TRS under analysis terminates. ** END proof argument ** ** BEGIN proof description ** ## Searching for a generalized rewrite rule (a rule whose right-hand side contains a variable that does not occur in the left-hand side)... No generalized rewrite rule found! ## Applying the DP framework... ## 2 initial DP problems to solve. ## First, we try to decompose these problems into smaller problems. ## Round 1 [2 DP problems]: ## DP problem: Dependency pairs = [int^#(s(_0),s(_1)) -> int^#(_0,_1), int^#(0,s(_0)) -> int^#(s(0),s(_0))] TRS = {intlist(nil) -> nil, int(s(_0),0) -> nil, int(_0,_0) -> cons(_0,nil), intlist(cons(_0,_1)) -> cons(s(_0),intlist(_1)), int(s(_0),s(_1)) -> intlist(int(_0,_1)), int(0,s(_0)) -> cons(0,int(s(0),s(_0))), intlist(cons(_0,nil)) -> cons(s(_0),nil)} ## Trying with homeomorphic embeddings... Failed! ## Trying with polynomial interpretations... Failed! ## Trying with lexicographic path orders... The constraints are satisfied by the lexicographic path order using the argument filtering: {int:[0, 1], cons:[0], s:[0], intlist:[0], int^#:[1]} and the precedence: int > [cons, s, nil, intlist, int^#], cons > [s, nil, int^#], s > [nil, int^#], intlist > [cons, s, nil, int^#] This DP problem is finite. ## DP problem: Dependency pairs = [intlist^#(cons(_0,_1)) -> intlist^#(_1)] TRS = {intlist(nil) -> nil, int(s(_0),0) -> nil, int(_0,_0) -> cons(_0,nil), intlist(cons(_0,_1)) -> cons(s(_0),intlist(_1)), int(s(_0),s(_1)) -> intlist(int(_0,_1)), int(0,s(_0)) -> cons(0,int(s(0),s(_0))), intlist(cons(_0,nil)) -> cons(s(_0),nil)} ## Trying with homeomorphic embeddings... Success! This DP problem is finite. ## All the DP problems were proved finite. As all the involved DP processors are sound, the TRS under analysis terminates. Proof run on Linux version 3.10.0-1160.25.1.el7.x86_64 for amd64 using Java version 1.8.0_292 ** END proof description ** Total number of generated unfolded rules = 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard