Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487068190
details
property
value
status
complete
benchmark
2.37.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n175.star.cs.uiowa.edu
space
SK90
run statistics
property
value
solver
NTI-TC20-firstrun
configuration
Default 200
runtime (wallclock)
0.205771 seconds
cpu usage
0.298795
user time
0.250377
system time
0.048418
max virtual memory
113188.0
max residence set size
59204.0
stage attributes
key
value
starexec-result
DONT KNOW
output
DON'T KNOW Prover = TRS(tech=PATTERN_RULES, nb_unfoldings=unlimited, max_nb_unfolded_rules=200) ** 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... ## Round 1: ## DP problem: Dependency pairs = [and^#(not(not(_0)),_1,not(_2)) -> and^#(_1,band(_0,_2),_0)] TRS = {and(not(not(_0)),_1,not(_2)) -> and(_1,band(_0,_2),_0)} ## Trying with homeomorphic embeddings... Failed! ## Trying with polynomial interpretations... Too many coefficients (15)! Aborting! ## Trying with lexicographic path orders... Failed! ## Trying to prove nontermination by unfolding the dependency pairs with the rules of the TRS # Iteration 0: nontermination not detected, 1 unfolded rule generated. # Iteration 1: nontermination not detected, 1 unfolded rule generated. # Iteration 2: nontermination not detected, 0 unfolded rule generated. Nontermination not detected! Don't know whether this DP problem is finite. Could not solve the following DP problems: 1: Dependency pairs = [and^#(not(not(_0)),_1,not(_2)) -> and^#(_1,band(_0,_2),_0)] TRS = {and(not(not(_0)),_1,not(_2)) -> and(_1,band(_0,_2),_0)} Hence, could not prove (non)termination of the TRS under analysis. ** END proof description ** Proof stopped at iteration 2 Number of unfolded rules generated by this proof = 2 Number of unfolded rules generated by all the parallel proofs = 18
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard