Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516962870
details
property
value
status
complete
benchmark
Ex1_Zan97_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n169.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE21
configuration
standard
runtime (wallclock)
6.1484131813 seconds
cpu usage
12.351843474
max memory
1.20492032E9
stage attributes
key
value
output-size
7672
starexec-result
NO
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be disproven: (0) QTRS (1) QTRS Reverse [EQUIVALENT, 0 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 19 ms] (4) QTRS (5) AAECC Innermost [EQUIVALENT, 0 ms] (6) QTRS (7) DependencyPairsProof [EQUIVALENT, 0 ms] (8) QDP (9) DependencyGraphProof [EQUIVALENT, 0 ms] (10) QDP (11) UsableRulesProof [EQUIVALENT, 0 ms] (12) QDP (13) QReductionProof [EQUIVALENT, 0 ms] (14) QDP (15) MNOCProof [EQUIVALENT, 0 ms] (16) QDP (17) NonTerminationLoopProof [COMPLETE, 0 ms] (18) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: g(X) -> h(activate(X)) c -> d h(n__d) -> g(n__c) d -> n__d c -> n__c activate(n__d) -> d activate(n__c) -> c activate(X) -> X Q is empty. ---------------------------------------- (1) QTRS Reverse (EQUIVALENT) We applied the QTRS Reverse Processor [REVERSE]. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: g(X) -> activate(h(X)) c'(x) -> d'(x) n__d'(h(x)) -> n__c'(g(x)) d'(x) -> n__d'(x) c'(x) -> n__c'(x) n__d'(activate(x)) -> d'(x) n__c'(activate(x)) -> c'(x) activate(X) -> X Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(activate(x_1)) = 1 + x_1 POL(c'(x_1)) = 1 + x_1 POL(d'(x_1)) = 1 + x_1 POL(g(x_1)) = 1 + x_1 POL(h(x_1)) = x_1 POL(n__c'(x_1)) = x_1 POL(n__d'(x_1)) = 1 + x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: c'(x) -> n__c'(x) n__d'(activate(x)) -> d'(x) activate(X) -> X ---------------------------------------- (4) Obligation:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard