/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


./ttt2: line 3, character 10: unexpected ' '
expecting '=' or 't'
'g' is used with incorrect arity
YES

Check SN using AProVE (RWTH Aachen University)
proof of tmp62511.trs
# AProVE Commit ID: 240871ee8d33536d563834eff18151406a8bc3fe ffrohn 20170821 unpublished


Termination w.r.t. Q of the given QTRS could be proven:

(0) QTRS
(1) RFCMatchBoundsTRSProof [EQUIVALENT, 0 ms]
(2) YES


----------------------------------------

(0)
Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:

   f(g) -> f(g(%X))

Q is empty.

----------------------------------------

(1) RFCMatchBoundsTRSProof (EQUIVALENT)
Termination of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 0. This implies Q-termination of R.
The following rules were used to construct the certificate:

   f(g) -> f(g(%X))

The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
1, 2, 5, 6

Node 1 is start node and node 2 is final node.

Those nodes are connected through the following edges:

* 1 to 5 labelled f_1(0)* 2 to 2 labelled #_1(0)* 5 to 6 labelled g_1(0)* 6 to 2 labelled %X(0)


----------------------------------------

(2)
YES

...
proof of tmp62511.trs
# AProVE Commit ID: 240871ee8d33536d563834eff18151406a8bc3fe ffrohn 20170821 unpublished


Termination w.r.t. Q of the given QTRS could be proven:

(0) QTRS
(1) RFCMatchBoundsTRSProof [EQUIVALENT, 0 ms]
(2) YES


----------------------------------------

(0)
Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:

   f(g) -> f(g(%X))

Q is empty.

----------------------------------------

(1) RFCMatchBoundsTRSProof (EQUIVALENT)
Termination of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 0. This implies Q-termination of R.
The following rules were used to construct the certificate:

   f(g) -> f(g(%X))

The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
1, 2, 5, 6

Node 1 is start node and node 2 is final node.

Those nodes are connected through the following edges:

* 1 to 5 labelled f_1(0)* 2 to 2 labelled #_1(0)* 5 to 6 labelled g_1(0)* 6 to 2 labelled %X(0)


----------------------------------------

(2)
YES

******** Signature ********
 f : (o -> o) -> o
 g : o -> o
******** Computation Rules ********
 (1)  f(g) => f(%X.g(%X))

YES