Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487070778
details
property
value
status
complete
benchmark
Ex1_Zan97_L.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n070.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.76404 seconds
cpu usage
7.77279
user time
7.42868
system time
0.344103
max virtual memory
2.0940396E7
max residence set size
820404.0
stage attributes
key
value
starexec-result
NO
output
NO proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty 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, 18 ms] (4) QTRS (5) AAECC Innermost [EQUIVALENT, 0 ms] (6) QTRS (7) DependencyPairsProof [EQUIVALENT, 2 ms] (8) QDP (9) UsableRulesProof [EQUIVALENT, 0 ms] (10) QDP (11) QReductionProof [EQUIVALENT, 0 ms] (12) QDP (13) NonTerminationLoopProof [COMPLETE, 0 ms] (14) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: g -> h c -> d h -> g 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) -> h'(x) c'(x) -> d'(x) h'(x) -> g'(x) Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(c'(x_1)) = 1 + x_1 POL(d'(x_1)) = x_1 POL(g'(x_1)) = x_1 POL(h'(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'(x) -> d'(x) ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: g'(x) -> h'(x) h'(x) -> g'(x) Q is empty. ---------------------------------------- (5) AAECC Innermost (EQUIVALENT) We have applied [NOC,AAECCNOC] to switch to innermost. The TRS R 1 is none The TRS R 2 is g'(x) -> h'(x) h'(x) -> g'(x) The signature Sigma is {g'_1, h'_1} ---------------------------------------- (6) Obligation: Q restricted rewrite system: The TRS R consists of the following rules:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard