Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381716562
details
property
value
status
complete
benchmark
Ex6_GM04_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n109.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
3.06798100471 seconds
cpu usage
8.638389532
max memory
7.0631424E8
stage attributes
key
value
output-size
5709
starexec-result
NO
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination w.r.t. Q of the given QTRS could be disproven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 41 ms] (2) QTRS (3) Overlay + Local Confluence [EQUIVALENT, 4 ms] (4) QTRS (5) DependencyPairsProof [EQUIVALENT, 24 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) QDP (9) UsableRulesProof [EQUIVALENT, 0 ms] (10) QDP (11) QReductionProof [EQUIVALENT, 0 ms] (12) QDP (13) NonTerminationLoopProof [COMPLETE, 6 ms] (14) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: c -> f(n__g(n__c)) f(n__g(X)) -> g(activate(X)) g(X) -> n__g(X) c -> n__c activate(n__g(X)) -> g(X) activate(n__c) -> c activate(X) -> X Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(activate(x_1)) = 1 + x_1 POL(c) = 1 POL(f(x_1)) = 1 + x_1 POL(g(x_1)) = x_1 POL(n__c) = 0 POL(n__g(x_1)) = x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: c -> n__c activate(n__g(X)) -> g(X) activate(X) -> X ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: c -> f(n__g(n__c)) f(n__g(X)) -> g(activate(X)) g(X) -> n__g(X) activate(n__c) -> c Q is empty. ---------------------------------------- (3) Overlay + Local Confluence (EQUIVALENT) The TRS is overlay and locally confluent. By [NOC] we can switch to innermost. ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: c -> f(n__g(n__c)) f(n__g(X)) -> g(activate(X)) g(X) -> n__g(X) activate(n__c) -> c The set Q consists of the following terms:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472