details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	9.68208694458 seconds
cpu usage	16.094888652
max memory	1.243803648E9

stage attributes

key	value
output-size	3265
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRS Reverse [EQUIVALENT, 0 ms] (2) QTRS (3) FlatCCProof [EQUIVALENT, 0 ms] (4) QTRS (5) RootLabelingProof [EQUIVALENT, 0 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 28 ms] (8) QTRS (9) RisEmptyProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(f(x)) -> g(f(x)) g(g(x)) -> f(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: f(f(x)) -> f(g(x)) g(g(x)) -> f(x) Q is empty. ---------------------------------------- (3) FlatCCProof (EQUIVALENT) We used flat context closure [ROOTLAB] As Q is empty the flat context closure was sound AND complete. ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(f(x)) -> f(g(x)) f(g(g(x))) -> f(f(x)) g(g(g(x))) -> g(f(x)) Q is empty. ---------------------------------------- (5) RootLabelingProof (EQUIVALENT) We used plain root labeling [ROOTLAB] with the following heuristic: LabelAll: All function symbols get labeled As Q is empty the root labeling was sound AND complete. ---------------------------------------- (6) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f_{f_1}(f_{f_1}(x)) -> f_{g_1}(g_{f_1}(x)) f_{f_1}(f_{g_1}(x)) -> f_{g_1}(g_{g_1}(x)) f_{g_1}(g_{g_1}(g_{f_1}(x))) -> f_{f_1}(f_{f_1}(x)) f_{g_1}(g_{g_1}(g_{g_1}(x))) -> f_{f_1}(f_{g_1}(x)) g_{g_1}(g_{g_1}(g_{f_1}(x))) -> g_{f_1}(f_{f_1}(x)) g_{g_1}(g_{g_1}(g_{g_1}(x))) -> g_{f_1}(f_{g_1}(x)) Q is empty. ---------------------------------------- (7) QTRSRRRProof (EQUIVALENT) popout

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

job log

popout

actions

all output return to TRS Standard