%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : MGT017+1 : TPTP v9.3.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 8 06:20:05 AM UTC 2026
% Result : Theorem 0.10s 0.40s
% Output : Proof 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 33 ( 14 unt; 0 def)
% Number of atoms : 199 ( 0 equ)
% Maximal formula atoms : 18 ( 6 avg)
% Number of connectives : 233 ( 67 ~; 62 |; 95 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 134 ( 0 sgn 89 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
fof(a13_FOL,hypothesis,
! [X1,X4,X12,X5,X8,X9,X13,X14,X15] :
( ( organization(X1,X13)
& organization(X4,X13)
& organization(X4,X15)
& class(X1,X5,X13)
& class(X4,X5,X13)
& reorganization(X1,X13,X14)
& reorganization(X4,X13,X15)
& reorganization_type(X1,X12,X13)
& reorganization_type(X4,X12,X13)
& inertia(X1,X8,X13)
& inertia(X4,X9,X13)
& greater(X9,X8) )
=> greater(X15,X14) ),
file('theBenchmark.p',a13_FOL) ).
% FOF SIMPLE INFERENCE
fof(a13_FOL_elimTB,hypothesis,
! [X1,X2,X3,X4,X5,X6,X7,X8,X9] :
( ( organization(X1,X7)
& organization(X2,X7)
& organization(X2,X9)
& class(X1,X4,X7)
& class(X2,X4,X7)
& reorganization(X1,X7,X8)
& reorganization(X2,X7,X9)
& reorganization_type(X1,X3,X7)
& reorganization_type(X2,X3,X7)
& inertia(X1,X5,X7)
& inertia(X2,X6,X7)
& greater(X6,X5) )
=> greater(X9,X8) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[a13_FOL])]) ).
% FOF SIMPLE INFERENCE
fof(a13_FOL_elimImpEquivPushNegMiniScope,hypothesis,
! [X1,X2,X3,X4,X5,X6,X7,X8,X9] :
( ~ organization(X1,X7)
| ~ organization(X2,X7)
| ~ organization(X2,X9)
| ~ class(X1,X4,X7)
| ~ class(X2,X4,X7)
| ~ reorganization(X1,X7,X8)
| ~ reorganization(X2,X7,X9)
| ~ reorganization_type(X1,X3,X7)
| ~ reorganization_type(X2,X3,X7)
| ~ inertia(X1,X5,X7)
| ~ inertia(X2,X6,X7)
| ~ greater(X6,X5)
| greater(X9,X8) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[a13_FOL_elimTB]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_3,plain,
( ~ organization(X0,X1)
| ~ organization(X2,X1)
| ~ organization(X2,X3)
| ~ class(X0,X4,X1)
| ~ class(X2,X4,X1)
| ~ reorganization(X0,X1,X5)
| ~ reorganization(X2,X1,X3)
| ~ reorganization_type(X0,X6,X1)
| ~ reorganization_type(X2,X6,X1)
| ~ inertia(X0,X7,X1)
| ~ inertia(X2,X8,X1)
| ~ greater(X8,X7)
| greater(X3,X5) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[a13_FOL_elimImpEquivPushNegMiniScope])]) ).
% FILE RECORD
fof(a5_FOL,hypothesis,
! [X1,X4,X5,X6,X7,X8,X9,X10,X11] :
( ( organization(X1,X10)
& organization(X4,X11)
& class(X1,X5,X10)
& class(X4,X5,X11)
& size(X1,X6,X10)
& size(X4,X7,X11)
& inertia(X1,X8,X10)
& inertia(X4,X9,X11)
& greater(X7,X6) )
=> greater(X9,X8) ),
file('theBenchmark.p',a5_FOL) ).
% FOF SIMPLE INFERENCE
fof(a5_FOL_elimTB,hypothesis,
! [X1,X2,X3,X4,X5,X6,X7,X8,X9] :
( ( organization(X1,X8)
& organization(X2,X9)
& class(X1,X3,X8)
& class(X2,X3,X9)
& size(X1,X4,X8)
& size(X2,X5,X9)
& inertia(X1,X6,X8)
& inertia(X2,X7,X9)
& greater(X5,X4) )
=> greater(X7,X6) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[a5_FOL])]) ).
% FOF SIMPLE INFERENCE
fof(a5_FOL_elimImpEquivPushNegMiniScope,hypothesis,
! [X1,X2,X3,X4,X5,X6,X7] :
( ! [X8,X9] :
( ~ organization(X1,X8)
| ~ organization(X2,X9)
| ~ class(X1,X3,X8)
| ~ class(X2,X3,X9)
| ~ size(X1,X4,X8)
| ~ size(X2,X5,X9)
| ~ inertia(X1,X6,X8)
| ~ inertia(X2,X7,X9)
| ~ greater(X5,X4) )
| greater(X7,X6) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[a5_FOL_elimTB]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_2,plain,
( ~ organization(X0,X1)
| ~ organization(X2,X3)
| ~ class(X0,X4,X1)
| ~ class(X2,X4,X3)
| ~ size(X0,X5,X1)
| ~ size(X2,X6,X3)
| ~ inertia(X0,X7,X1)
| ~ inertia(X2,X8,X3)
| ~ greater(X6,X5)
| greater(X8,X7) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[a5_FOL_elimImpEquivPushNegMiniScope])]) ).
% FILE RECORD
fof(mp5,axiom,
! [X1,X2] :
( organization(X1,X2)
=> ? [X3] : inertia(X1,X3,X2) ),
file('theBenchmark.p',mp5) ).
% FOF SIMPLE INFERENCE
fof(mp5_elimTB,axiom,
! [X1,X2] :
( organization(X1,X2)
=> ? [X3] : inertia(X1,X3,X2) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[mp5])]) ).
% FOF SIMPLE INFERENCE
fof(mp5_elimImpEquivPushNegMiniScope,axiom,
! [X1,X2] :
( ~ organization(X1,X2)
| ? [X3] : inertia(X1,X3,X2) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[mp5_elimTB]) ).
% FOF SKOLEM INFERENCE. WIP!!
fof(mp5_skol,axiom,
! [X1,X2] :
( ~ organization(X1,X2)
| inertia(X1,skf1(X1,X2),X2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[skf1]),skolemize(X3,skf1(X1,X2))],[mp5_elimImpEquivPushNegMiniScope]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_1,plain,
( ~ organization(X0,X1)
| inertia(X0,skf1(X0,X1),X1) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[mp5_skol])]) ).
% CNF SPASS RESOLUTION.
cnf(c_18,plain,
( ~ organization(X2,X1)
| ~ organization(X2,X3)
| ~ class(X0,X4,X1)
| ~ class(X2,X4,X1)
| ~ reorganization(X0,X1,X5)
| ~ reorganization(X2,X1,X3)
| ~ reorganization_type(X0,X6,X1)
| ~ reorganization_type(X2,X6,X1)
| ~ inertia(X2,X7,X1)
| ~ organization(X8,X9)
| ~ class(X0,X10,X1)
| ~ class(X8,X10,X9)
| ~ size(X0,X11,X1)
| ~ size(X8,X12,X9)
| ~ inertia(X8,X7,X9)
| ~ greater(X12,X11)
| ~ organization(X0,X1)
| greater(X3,X5) ),
inference(resolution,[status(thm)],[c_3,c_2,c_1]) ).
% FILE RECORD
fof(t17_FOL,conjecture,
! [X1,X4,X12,X5,X6,X7,X13,X14,X15] :
( ( organization(X1,X13)
& organization(X4,X13)
& organization(X4,X15)
& class(X1,X5,X13)
& class(X4,X5,X13)
& reorganization(X1,X13,X14)
& reorganization(X4,X13,X15)
& reorganization_type(X1,X12,X13)
& reorganization_type(X4,X12,X13)
& size(X1,X6,X13)
& size(X4,X7,X13)
& greater(X7,X6) )
=> greater(X15,X14) ),
file('theBenchmark.p',t17_FOL) ).
% NEGATING CONJECTURE
fof(t17_FOL_nc,negated_conjecture,
~ ! [X1,X4,X12,X5,X6,X7,X13,X14,X15] :
( ( organization(X1,X13)
& organization(X4,X13)
& organization(X4,X15)
& class(X1,X5,X13)
& class(X4,X5,X13)
& reorganization(X1,X13,X14)
& reorganization(X4,X13,X15)
& reorganization_type(X1,X12,X13)
& reorganization_type(X4,X12,X13)
& size(X1,X6,X13)
& size(X4,X7,X13)
& greater(X7,X6) )
=> greater(X15,X14) ),
inference(negating_conjecture,[status(cth)],[t17_FOL]) ).
% FOF SIMPLE INFERENCE
fof(t17_FOL_nc_elimTB,negated_conjecture,
~ ! [X1,X2,X3,X4,X5,X6,X7,X8,X9] :
( ( organization(X1,X7)
& organization(X2,X7)
& organization(X2,X9)
& class(X1,X4,X7)
& class(X2,X4,X7)
& reorganization(X1,X7,X8)
& reorganization(X2,X7,X9)
& reorganization_type(X1,X3,X7)
& reorganization_type(X2,X3,X7)
& size(X1,X5,X7)
& size(X2,X6,X7)
& greater(X6,X5) )
=> greater(X9,X8) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[t17_FOL_nc])]) ).
% FOF SIMPLE INFERENCE
fof(t17_FOL_nc_elimImpEquivPushNegMiniScope,negated_conjecture,
? [X1,X2,X3,X4,X5,X6,X7,X8,X9] :
( organization(X1,X7)
& organization(X2,X7)
& organization(X2,X9)
& class(X1,X4,X7)
& class(X2,X4,X7)
& reorganization(X1,X7,X8)
& reorganization(X2,X7,X9)
& reorganization_type(X1,X3,X7)
& reorganization_type(X2,X3,X7)
& size(X1,X5,X7)
& size(X2,X6,X7)
& greater(X6,X5)
& ~ greater(X9,X8) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[t17_FOL_nc_elimTB]) ).
% FOF SKOLEM INFERENCE. WIP!!
fof(t17_FOL_nc_skol,negated_conjecture,
( organization(skc2,skc8)
& organization(skc3,skc8)
& organization(skc3,skc10)
& class(skc2,skc5,skc8)
& class(skc3,skc5,skc8)
& reorganization(skc2,skc8,skc9)
& reorganization(skc3,skc8,skc10)
& reorganization_type(skc2,skc4,skc8)
& reorganization_type(skc3,skc4,skc8)
& size(skc2,skc6,skc8)
& size(skc3,skc7,skc8)
& greater(skc7,skc6)
& ~ greater(skc10,skc9) ),
inference(skolemize,[status(esa),new_symbols(skolem,[skc2,skc3,skc4,skc5,skc6,skc7,skc8,skc9,skc10]),skolemize(X1,skc2),skolemize(X2,skc3),skolemize(X3,skc4),skolemize(X4,skc5),skolemize(X5,skc6),skolemize(X6,skc7),skolemize(X7,skc8),skolemize(X8,skc9),skolemize(X9,skc10)],[t17_FOL_nc_elimImpEquivPushNegMiniScope]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_9,plain,
reorganization(skc2,skc8,skc9),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t17_FOL_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_10,plain,
reorganization(skc3,skc8,skc10),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t17_FOL_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_11,plain,
reorganization_type(skc2,skc4,skc8),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t17_FOL_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_12,plain,
reorganization_type(skc3,skc4,skc8),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t17_FOL_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_7,plain,
class(skc2,skc5,skc8),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t17_FOL_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_8,plain,
class(skc3,skc5,skc8),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t17_FOL_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_13,plain,
size(skc2,skc6,skc8),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t17_FOL_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_14,plain,
size(skc3,skc7,skc8),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t17_FOL_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_16,plain,
~ greater(skc10,skc9),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t17_FOL_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_4,plain,
organization(skc2,skc8),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t17_FOL_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_5,plain,
organization(skc3,skc8),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t17_FOL_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_6,plain,
organization(skc3,skc10),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t17_FOL_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_15,plain,
greater(skc7,skc6),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t17_FOL_nc_skol])]) ).
% CNF SPASS RESOLUTION.
cnf(c_19,plain,
$false,
inference(resolution,[status(thm)],[c_18,c_1,c_9,c_10,c_11,c_12,c_7,c_8,c_13,c_14,c_16,c_4,c_5,c_6,c_15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT017+1 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n018.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 7 11:58:52 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.40
% 0.10/0.40 % Input Clauses:
% 0.10/0.40 % 1:2:2:INP:TopTop: organization(x0,x1) -> inertia(x0,skf1(x0,x1),x1)
% 0.10/0.40 % 2:10:9:INP:TopTopTopTopTopTopTopTopTop: organization(x0,x1),organization(x2,x3),class(x0,x4,x1),class(x2,x4,x3),size(x0,x5,x1),size(x2,x6,x3),inertia(x0,x7,x1),inertia(x2,x8,x3),greater(x6,x5) -> greater(x8,x7)
% 0.10/0.40 % 3:13:9:INP:TopTopTopTopTopTopTopTopTop: organization(x0,x1),organization(x2,x1),organization(x2,x3),class(x0,x4,x1),class(x2,x4,x1),reorganization(x0,x1,x5),reorganization(x2,x1,x3),reorganization_type(x0,x6,x1),reorganization_type(x2,x6,x1),inertia(x0,x7,x1),inertia(x2,x8,x1),greater(x8,x7) -> greater(x3,x5)
% 0.10/0.40 % 4:1:0:INP:: -> organization(skc2,skc8)
% 0.10/0.40 % 5:1:0:INP:: -> organization(skc3,skc8)
% 0.10/0.40 % 6:1:0:INP:: -> organization(skc3,skc10)
% 0.10/0.40 % 7:1:0:INP:: -> class(skc2,skc5,skc8)
% 0.10/0.40 % 8:1:0:INP:: -> class(skc3,skc5,skc8)
% 0.10/0.40 % 9:1:0:INP:: -> reorganization(skc2,skc8,skc9)
% 0.10/0.40 % 10:1:0:INP:: -> reorganization(skc3,skc8,skc10)
% 0.10/0.40 % 11:1:0:INP:: -> reorganization_type(skc2,skc4,skc8)
% 0.10/0.40 % 12:1:0:INP:: -> reorganization_type(skc3,skc4,skc8)
% 0.10/0.40 % 13:1:0:INP:: -> size(skc2,skc6,skc8)
% 0.10/0.40 % 14:1:0:INP:: -> size(skc3,skc7,skc8)
% 0.10/0.40 % 15:1:0:INP:: -> greater(skc7,skc6)
% 0.10/0.40 % 16:1:0:INP:: greater(skc10,skc9) ->
% 0.10/0.40
% 0.10/0.40 % Predicates: organization inertia class size greater reorganization reorganization_type
% 0.10/0.40 % Fol Constants: skc2 skc3 skc4 skc5 skc6 skc7 skc8 skc9 skc10
% 0.10/0.40 % Fol Functions: skf1
% 0.10/0.40 % Problem Properties:
% 0.10/0.40 % This is a full first-order problem without equality. The Problem is non-linear.
% 0.10/0.40
% 0.10/0.40
% 0.10/0.40 % Reduced Input Axiom Clauses:
% 0.10/0.40 % 1:2:2:INP:TopTop: organization(x0,x1) -> inertia(x0,skf1(x0,x1),x1)
% 0.10/0.40
% 0.10/0.40 % Reduced Input Conjecture Clauses:
% 0.10/0.40 % 2:10:9:INP:TopTopTopTopTopTopTopTopTop: organization(x0,x1),organization(x2,x3),class(x0,x4,x1),class(x2,x4,x3),size(x0,x5,x1),size(x2,x6,x3),inertia(x0,x7,x1),inertia(x2,x8,x3),greater(x6,x5) -> greater(x8,x7)
% 0.10/0.40 % 3:13:9:INP:TopTopTopTopTopTopTopTopTop: organization(x0,x1),organization(x2,x1),organization(x2,x3),class(x0,x4,x1),class(x2,x4,x1),reorganization(x0,x1,x5),reorganization(x2,x1,x3),reorganization_type(x0,x6,x1),reorganization_type(x2,x6,x1),inertia(x0,x7,x1),inertia(x2,x8,x1),greater(x8,x7) -> greater(x3,x5)
% 0.10/0.40 % 4:1:0:INP:: -> organization(skc2,skc8)
% 0.10/0.40 % 5:1:0:INP:: -> organization(skc3,skc8)
% 0.10/0.40 % 6:1:0:INP:: -> organization(skc3,skc10)
% 0.10/0.40 % 7:1:0:INP:: -> class(skc2,skc5,skc8)
% 0.10/0.40 % 8:1:0:INP:: -> class(skc3,skc5,skc8)
% 0.10/0.40 % 9:1:0:INP:: -> reorganization(skc2,skc8,skc9)
% 0.10/0.40 % 10:1:0:INP:: -> reorganization(skc3,skc8,skc10)
% 0.10/0.40 % 11:1:0:INP:: -> reorganization_type(skc2,skc4,skc8)
% 0.10/0.40 % 12:1:0:INP:: -> reorganization_type(skc3,skc4,skc8)
% 0.10/0.40 % 13:1:0:INP:: -> size(skc2,skc6,skc8)
% 0.10/0.40 % 14:1:0:INP:: -> size(skc3,skc7,skc8)
% 0.10/0.40 % 15:1:0:INP:: -> greater(skc7,skc6)
% 0.10/0.40 % 16:1:0:INP:: greater(skc10,skc9) ->
% 0.10/0.40
% 0.10/0.40
% 0.10/0.40 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 38 atoms initially. Used heuristic: lmodel_grow ===
% 0.10/0.40
% 0.10/0.40
% 0.10/0.40
% 0.10/0.40 % SZS status Theorem
% 0.10/0.40 % Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.40
% 0.10/0.40 % SPASS-SCL-FOL Statistics:
% 0.10/0.40 % Number of learned clauses: 2
% 0.10/0.40 % Number of propagations: 39
% 0.10/0.40 % Number of decisions: 34
% 0.10/0.40 % Number of resolutions: 17
% 0.10/0.40 % Number of condensations: 0
% 0.10/0.40 % Number of sub resolutions: 0
% 0.10/0.40
% 0.10/0.40 % Solver is done. Empty clause found
% 0.10/0.40
% 0.10/0.40 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.10/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.40 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.10/0.40
% 0.10/0.40
% 0.10/0.40 % Needed: 0:00:00.03
% 0.10/0.40
% 0.10/0.40 % ###
% 0.10/0.40 % ### Pagesize: 8192
% 0.10/0.40 % ### Marksize: 0
% 0.10/0.40 % ### Memory demanded: 1382 KBytes
% 0.10/0.40 % ### Memory freed: 1382 KBytes
% 0.10/0.40 % ### Memory remaining: 0 Bytes
% 0.10/0.40 % ### Pages allocated: 258 Pages
% 0.10/0.40 % ###
%------------------------------------------------------------------------------