details

property	value
status	complete
benchmark	Ex14_Luc06_L.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n134.star.cs.uiowa.edu
space	Transformed_CSR_04

run statistics

property	value
solver	AProVE23
configuration	standard
runtime (wallclock)	3.57645392418 seconds
cpu usage	11.107880719
max memory	8.93054976E8

stage attributes

key	value
output-size	4479
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: 363435ff5b19173ec8a83b45cfdec073678dabcc jan-christoph 20230815 unpublished Termination w.r.t. Q of the given QTRS could be disproven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 55 ms] (2) QTRS (3) AAECC Innermost [EQUIVALENT, 0 ms] (4) QTRS (5) DependencyPairsProof [EQUIVALENT, 9 ms] (6) QDP (7) UsableRulesProof [EQUIVALENT, 0 ms] (8) QDP (9) QReductionProof [EQUIVALENT, 0 ms] (10) QDP (11) NonTerminationLoopProof [COMPLETE, 5 ms] (12) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: h(X) -> g(X) g(a) -> f(b) f(X) -> h(a) a -> b Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(a) = 1 POL(b) = 0 POL(f(x_1)) = 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: a -> b ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: h(X) -> g(X) g(a) -> f(b) f(X) -> h(a) Q is empty. ---------------------------------------- (3) AAECC Innermost (EQUIVALENT) We have applied [NOC,AAECCNOC] to switch to innermost. The TRS R 1 is none The TRS R 2 is h(X) -> g(X) g(a) -> f(b) f(X) -> h(a) The signature Sigma is {h_1, g_1, f_1} ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: h(X) -> g(X) g(a) -> f(b) f(X) -> h(a) The set Q consists of the following terms: h(x0) g(a) f(x0) popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Standard