TSTP Solution File: CSR133^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR133^1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 19:16:37 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 37 ( 8 unt; 9 typ; 0 def)
% Number of atoms : 101 ( 14 equ; 0 cnn)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 294 ( 45 ~; 41 |; 20 &; 188 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 31 ( 31 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 25 ( 4 ^ 15 !; 6 ?; 25 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
thf(decl_23,type,
lAnna_THFTYPE_i: $i ).
thf(decl_25,type,
lBill_THFTYPE_i: $i ).
thf(decl_26,type,
lBob_THFTYPE_i: $i ).
thf(decl_27,type,
lMary_THFTYPE_i: $i ).
thf(decl_28,type,
lSue_THFTYPE_i: $i ).
thf(decl_29,type,
lYearFn_THFTYPE_IiiI: $i > $i ).
thf(decl_30,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_31,type,
n2009_THFTYPE_i: $i ).
thf(con,conjecture,
? [X1: $i > $i > $o,X2: $i > $i > $o,X3: $i] :
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( X2 @ X3 @ lBill_THFTYPE_i )
& ( X1 @ X3 @ lAnna_THFTYPE_i )
& ( X2 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
thf(ax_004,axiom,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_004) ).
thf(ax_003,axiom,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_003) ).
thf(ax_009,axiom,
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_009) ).
thf(c_0_4,negated_conjecture,
~ ? [X1: $i > $i > $o,X2: $i > $i > $o,X3: $i] :
( ( ~ ( ( X2 @ X3 @ lBill_THFTYPE_i )
& ( X1 @ X3 @ lAnna_THFTYPE_i )
& ( X2 != X1 ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( ( X2 @ X3 @ lBill_THFTYPE_i )
& ( X1 @ X3 @ lAnna_THFTYPE_i )
& ( X2 != X1 ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[con])])]) ).
thf(c_0_5,axiom,
( ( ~ ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax_004]) ).
thf(c_0_6,negated_conjecture,
! [X7: $i > $i > $o,X8: $i > $i > $o,X9: $i] :
( ( ~ ( X8 @ X9 @ lBill_THFTYPE_i )
| ~ ( X7 @ X9 @ lAnna_THFTYPE_i )
| ( X8 = X7 )
| ( X8 @ X9 @ lBill_THFTYPE_i ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( X8 @ X9 @ lBill_THFTYPE_i ) )
& ( ~ ( X8 @ X9 @ lBill_THFTYPE_i )
| ~ ( X7 @ X9 @ lAnna_THFTYPE_i )
| ( X8 = X7 )
| ( X7 @ X9 @ lAnna_THFTYPE_i ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( X7 @ X9 @ lAnna_THFTYPE_i ) )
& ( ~ ( X8 @ X9 @ lBill_THFTYPE_i )
| ~ ( X7 @ X9 @ lAnna_THFTYPE_i )
| ( X8 = X7 )
| ( X8 != X7 ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( X8 != X7 ) )
& ( ~ ( X8 @ X9 @ lBill_THFTYPE_i )
| ~ ( X7 @ X9 @ lAnna_THFTYPE_i )
| ( X8 = X7 )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
thf(c_0_7,plain,
( ( ~ ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i > $i > $o,X2: $i > $i > $o] :
( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ( X1 != X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,plain,
( ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ),
inference(er,[status(thm)],[c_0_8]) ).
thf(c_0_11,plain,
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true )
| ~ ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_12,plain,
likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i,
inference(sr,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_13,axiom,
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax_003]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i > $i > $o,X2: $i > $i > $o,X3: $i] :
( ( X1 = X2 )
| ~ ( X1 @ X3 @ lBill_THFTYPE_i )
| ~ ( X2 @ X3 @ lAnna_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_15,plain,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]) ).
thf(c_0_16,plain,
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_13]) ).
thf(c_0_17,plain,
( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax_009])]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i > $i > $o,X2: $i > $i > $o,X3: $i] :
( ( X1 = X2 )
| ~ ( X2 @ X3 @ lAnna_THFTYPE_i )
| ~ ( X1 @ X3 @ lBill_THFTYPE_i ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).
thf(c_0_19,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_20,plain,
( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_17]) ).
thf(c_0_21,negated_conjecture,
! [X1: $i > $i > $o,X3: $i] :
( ( X1
= ( ^ [Z0: $i,Z1: $i] : $true ) )
| ~ ( X1 @ X3 @ lBill_THFTYPE_i ) ),
inference(primitive_enumeration,[status(thm)],[c_0_18]) ).
thf(c_0_22,plain,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
inference(sr,[status(thm)],[c_0_19,c_0_10]) ).
thf(c_0_23,plain,
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_24,negated_conjecture,
( ( ^ [Z0: $i,Z1: $i] : $true )
= likes_THFTYPE_IiioI ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
thf(c_0_25,plain,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
inference(sr,[status(thm)],[c_0_23,c_0_10]) ).
thf(c_0_26,negated_conjecture,
! [X3: $i,X6: $i] : ( likes_THFTYPE_IiioI @ X3 @ X6 ),
inference(arg_cong,[status(thm)],[c_0_24]) ).
thf(c_0_27,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : CSR133^1 : TPTP v8.2.0. Released v4.1.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 02:28:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.49 # Version: 3.1.0-ho
% 0.20/0.49 # Preprocessing class: HSMSSMSSSSSNSSN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_11 with 1500s (5) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # Starting new_ho_9 with 300s (1) cores
% 0.20/0.49 # Starting ho_unfolding_4 with 300s (1) cores
% 0.20/0.49 # new_ho_11 with pid 29390 completed with status 0
% 0.20/0.49 # Result found by new_ho_11
% 0.20/0.49 # Preprocessing class: HSMSSMSSSSSNSSN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_11 with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HGHSF-FFSM11-SSSFFSBN
% 0.20/0.49 # partial match(1): HGHSF-FFSF11-SSSFFSBN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting ehoh_best2_full_lfho with 811s (1) cores
% 0.20/0.49 # Starting new_ho_11 with 151s (1) cores
% 0.20/0.49 # Starting sh2lt with 136s (1) cores
% 0.20/0.49 # Starting sh2l with 136s (1) cores
% 0.20/0.49 # Starting lpo1_def_fix with 136s (1) cores
% 0.20/0.49 # lpo1_def_fix with pid 29401 completed with status 0
% 0.20/0.49 # Result found by lpo1_def_fix
% 0.20/0.49 # Preprocessing class: HSMSSMSSSSSNSSN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_11 with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HGHSF-FFSM11-SSSFFSBN
% 0.20/0.49 # partial match(1): HGHSF-FFSF11-SSSFFSBN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting ehoh_best2_full_lfho with 811s (1) cores
% 0.20/0.49 # Starting new_ho_11 with 151s (1) cores
% 0.20/0.49 # Starting sh2lt with 136s (1) cores
% 0.20/0.49 # Starting sh2l with 136s (1) cores
% 0.20/0.49 # Starting lpo1_def_fix with 136s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 23
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 40
% 0.20/0.49 # Removed in clause preprocessing : 15
% 0.20/0.49 # Initial clauses in saturation : 25
% 0.20/0.49 # Processed clauses : 43
% 0.20/0.49 # ...of these trivial : 2
% 0.20/0.49 # ...subsumed : 2
% 0.20/0.49 # ...remaining for further processing : 39
% 0.20/0.49 # Other redundant clauses eliminated : 5
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 1
% 0.20/0.49 # Backward-rewritten : 13
% 0.20/0.49 # Generated clauses : 30
% 0.20/0.49 # ...of the previous two non-redundant : 24
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 6
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 5
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 16
% 0.20/0.49 # ...of those cached : 9
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 11
% 0.20/0.49 # Positive orientable unit clauses : 7
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 3
% 0.20/0.49 # Non-unit-clauses : 1
% 0.20/0.49 # Current number of unprocessed clauses: 17
% 0.20/0.49 # ...number of literals in the above : 39
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 27
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 27
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 27
% 0.20/0.49 # Non-unit clause-clause subsumptions : 0
% 0.20/0.49 # Unit Clause-clause subsumption calls : 6
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 8
% 0.20/0.49 # BW rewrite match successes : 7
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 1957
% 0.20/0.49 # Search garbage collected termcells : 145
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.004 s
% 0.20/0.49 # System time : 0.003 s
% 0.20/0.49 # Total time : 0.008 s
% 0.20/0.49 # Maximum resident set size: 1800 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.018 s
% 0.20/0.49 # System time : 0.010 s
% 0.20/0.49 # Total time : 0.028 s
% 0.20/0.49 # Maximum resident set size: 1736 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------