%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC098+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n006.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 29 01:04:39 PM UTC 2026
% Result : Theorem 0.18s 0.46s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 7
% Syntax : Number of formulae : 83 ( 10 unt; 6 def)
% Number of atoms : 349 ( 95 equ)
% Maximal formula atoms : 24 ( 4 avg)
% Number of connectives : 446 ( 180 ~; 187 |; 61 &)
% ( 6 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 7 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn 30 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ? [X4] :
( ssItem(X4)
& cons(X4,nil) = X0
& ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X1,X5)
| ~ leq(X4,X5)
| X4 = X5 ) )
& memberP(X1,X4) )
| ( nil = X1
& nil = X0 )
| ( ! [X6] :
( ssItem(X6)
=> ( cons(X6,nil) != X2
| ~ memberP(X3,X6)
| ? [X7] :
( ssItem(X7)
& X6 != X7
& memberP(X3,X7)
& leq(X6,X7) ) ) )
& ( nil != X3
| nil != X2 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ? [X4] :
( ssItem(X4)
& cons(X4,nil) = X0
& ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X1,X5)
| ~ leq(X4,X5)
| X4 = X5 ) )
& memberP(X1,X4) )
| ( nil = X1
& nil = X0 )
| ( ! [X6] :
( ssItem(X6)
=> ( cons(X6,nil) != X2
| ~ memberP(X3,X6)
| ? [X7] :
( ssItem(X7)
& X6 != X7
& memberP(X3,X7)
& leq(X6,X7) ) ) )
& ( nil != X3
| nil != X2 ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssItem(X4)
| cons(X4,nil) != X0
| ? [X5] :
( memberP(X1,X5)
& leq(X4,X5)
& X4 != X5
& ssItem(X5) )
| ~ memberP(X1,X4) )
& ( nil != X1
| nil != X0 )
& ( ? [X6] :
( cons(X6,nil) = X2
& memberP(X3,X6)
& ! [X7] :
( ~ ssItem(X7)
| X6 = X7
| ~ memberP(X3,X7)
| ~ leq(X6,X7) )
& ssItem(X6) )
| ( nil = X3
& nil = X2 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssItem(X4)
| cons(X4,nil) != X0
| ? [X5] :
( memberP(X1,X5)
& leq(X4,X5)
& X4 != X5
& ssItem(X5) )
| ~ memberP(X1,X4) )
& ( nil != X1
| nil != X0 )
& ( ? [X6] :
( cons(X6,nil) = X2
& memberP(X3,X6)
& ! [X7] :
( ~ ssItem(X7)
| X6 = X7
| ~ memberP(X3,X7)
| ~ leq(X6,X7) )
& ssItem(X6) )
| ( nil = X3
& nil = X2 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f296,plain,
( sK54 = sK56
& sK53 = sK55
& ! [X4] :
( ~ ssItem(X4)
| cons(X4,nil) != sK53
| ( memberP(sK54,sK57(X4))
& leq(X4,sK57(X4))
& sK57(X4) != X4
& ssItem(sK57(X4)) )
| ~ memberP(sK54,X4) )
& ( nil != sK54
| nil != sK53 )
& ( ( sK55 = cons(sK58,nil)
& memberP(sK56,sK58)
& ! [X7] :
( ~ ssItem(X7)
| sK58 = X7
| ~ memberP(sK56,X7)
| ~ leq(sK58,X7) )
& ssItem(sK58) )
| ( nil = sK56
& nil = sK55 ) )
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57,sK58]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X5,sK57(X4)),skolemize(X6,sK58)],[f222]) ).
fof(f500,plain,
( ssItem(sK58)
| nil = sK55 ),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
( ssItem(sK58)
| nil = sK56 ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
! [X7] :
( ~ ssItem(X7)
| sK58 = X7
| ~ memberP(sK56,X7)
| ~ leq(sK58,X7)
| nil = sK55 ),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
! [X7] :
( ~ ssItem(X7)
| sK58 = X7
| ~ memberP(sK56,X7)
| ~ leq(sK58,X7)
| nil = sK56 ),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
( memberP(sK56,sK58)
| nil = sK55 ),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
( memberP(sK56,sK58)
| nil = sK56 ),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
( sK55 = cons(sK58,nil)
| nil = sK55 ),
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
( sK55 = cons(sK58,nil)
| nil = sK56 ),
inference(cnf_transformation,[],[f296]) ).
fof(f508,plain,
( nil != sK54
| nil != sK53 ),
inference(cnf_transformation,[],[f296]) ).
fof(f509,plain,
! [X4] :
( ~ ssItem(X4)
| cons(X4,nil) != sK53
| ssItem(sK57(X4))
| ~ memberP(sK54,X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f510,plain,
! [X4] :
( ~ ssItem(X4)
| cons(X4,nil) != sK53
| sK57(X4) != X4
| ~ memberP(sK54,X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f511,plain,
! [X4] :
( ~ ssItem(X4)
| cons(X4,nil) != sK53
| leq(X4,sK57(X4))
| ~ memberP(sK54,X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f512,plain,
! [X4] :
( ~ ssItem(X4)
| cons(X4,nil) != sK53
| memberP(sK54,sK57(X4))
| ~ memberP(sK54,X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f513,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f514,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f515,plain,
! [X4] :
( cons(X4,nil) != sK55
| ~ ssItem(X4)
| memberP(sK56,sK57(X4))
| ~ memberP(sK56,X4) ),
inference(definition_unfolding,[],[f512,f513,f514,f514]) ).
fof(f516,plain,
! [X4] :
( cons(X4,nil) != sK55
| ~ ssItem(X4)
| leq(X4,sK57(X4))
| ~ memberP(sK56,X4) ),
inference(definition_unfolding,[],[f511,f513,f514]) ).
fof(f517,plain,
! [X4] :
( cons(X4,nil) != sK55
| ~ ssItem(X4)
| sK57(X4) != X4
| ~ memberP(sK56,X4) ),
inference(definition_unfolding,[],[f510,f513,f514]) ).
fof(f518,plain,
! [X4] :
( cons(X4,nil) != sK55
| ~ ssItem(X4)
| ssItem(sK57(X4))
| ~ memberP(sK56,X4) ),
inference(definition_unfolding,[],[f509,f513,f514]) ).
fof(f519,plain,
( nil != sK56
| nil != sK55 ),
inference(definition_unfolding,[],[f508,f514,f513]) ).
fof(f557,definition,
( spl59_1
<=> nil = sK55 ),
introduced(definition,[new_symbols(definition,[spl59_1])],[avatar_definition]) ).
fof(f561,definition,
( spl59_2
<=> ssItem(sK58) ),
introduced(definition,[new_symbols(definition,[spl59_2])],[avatar_definition]) ).
fof(f563,plain,
( ssItem(sK58)
| ~ spl59_2 ),
inference(avatar_component_clause,[],[f561]) ).
fof(f564,plain,
( spl59_1
| spl59_2 ),
inference(avatar_split_clause,[],[f500,f561,f557]) ).
fof(f566,definition,
( spl59_3
<=> nil = sK56 ),
introduced(definition,[new_symbols(definition,[spl59_3])],[avatar_definition]) ).
fof(f569,plain,
( spl59_3
| spl59_2 ),
inference(avatar_split_clause,[],[f501,f561,f566]) ).
fof(f571,definition,
( spl59_4
<=> ! [X7] :
( ~ ssItem(X7)
| ~ leq(sK58,X7)
| ~ memberP(sK56,X7)
| sK58 = X7 ) ),
introduced(definition,[new_symbols(definition,[spl59_4])],[avatar_definition]) ).
fof(f572,plain,
( ! [X7] :
( ~ leq(sK58,X7)
| ~ ssItem(X7)
| ~ memberP(sK56,X7)
| sK58 = X7 )
| ~ spl59_4 ),
inference(avatar_component_clause,[],[f571]) ).
fof(f573,plain,
( spl59_1
| spl59_4 ),
inference(avatar_split_clause,[],[f502,f571,f557]) ).
fof(f574,plain,
( spl59_3
| spl59_4 ),
inference(avatar_split_clause,[],[f503,f571,f566]) ).
fof(f576,definition,
( spl59_5
<=> memberP(sK56,sK58) ),
introduced(definition,[new_symbols(definition,[spl59_5])],[avatar_definition]) ).
fof(f578,plain,
( memberP(sK56,sK58)
| ~ spl59_5 ),
inference(avatar_component_clause,[],[f576]) ).
fof(f579,plain,
( spl59_1
| spl59_5 ),
inference(avatar_split_clause,[],[f504,f576,f557]) ).
fof(f580,plain,
( spl59_3
| spl59_5 ),
inference(avatar_split_clause,[],[f505,f576,f566]) ).
fof(f582,definition,
( spl59_6
<=> sK55 = cons(sK58,nil) ),
introduced(definition,[new_symbols(definition,[spl59_6])],[avatar_definition]) ).
fof(f584,plain,
( sK55 = cons(sK58,nil)
| ~ spl59_6 ),
inference(avatar_component_clause,[],[f582]) ).
fof(f585,plain,
( spl59_1
| spl59_6 ),
inference(avatar_split_clause,[],[f506,f582,f557]) ).
fof(f586,plain,
( spl59_3
| spl59_6 ),
inference(avatar_split_clause,[],[f507,f582,f566]) ).
fof(f587,plain,
( ~ spl59_1
| ~ spl59_3 ),
inference(avatar_split_clause,[],[f519,f566,f557]) ).
fof(f623,plain,
( sK55 != sK55
| ~ ssItem(sK58)
| ssItem(sK57(sK58))
| ~ memberP(sK56,sK58)
| ~ spl59_6 ),
inference(superposition,[],[f518,f584]) ).
fof(f624,plain,
( ~ ssItem(sK58)
| ssItem(sK57(sK58))
| ~ memberP(sK56,sK58)
| ~ spl59_6 ),
inference(trivial_inequality_removal,[],[f623]) ).
fof(f625,plain,
( ssItem(sK57(sK58))
| ~ memberP(sK56,sK58)
| ~ spl59_2
| ~ spl59_6 ),
inference(forward_subsumption_resolution,[],[f624,f563]) ).
fof(f626,plain,
( ssItem(sK57(sK58))
| ~ spl59_2
| ~ spl59_5
| ~ spl59_6 ),
inference(forward_subsumption_resolution,[],[f625,f578]) ).
fof(f627,plain,
( sK55 != sK55
| ~ ssItem(sK58)
| memberP(sK56,sK57(sK58))
| ~ memberP(sK56,sK58)
| ~ spl59_6 ),
inference(superposition,[],[f515,f584]) ).
fof(f628,plain,
( ~ ssItem(sK58)
| memberP(sK56,sK57(sK58))
| ~ memberP(sK56,sK58)
| ~ spl59_6 ),
inference(trivial_inequality_removal,[],[f627]) ).
fof(f629,plain,
( memberP(sK56,sK57(sK58))
| ~ memberP(sK56,sK58)
| ~ spl59_2
| ~ spl59_6 ),
inference(forward_subsumption_resolution,[],[f628,f563]) ).
fof(f630,plain,
( memberP(sK56,sK57(sK58))
| ~ spl59_2
| ~ spl59_5
| ~ spl59_6 ),
inference(forward_subsumption_resolution,[],[f629,f578]) ).
fof(f631,plain,
( sK55 != sK55
| ~ ssItem(sK58)
| leq(sK58,sK57(sK58))
| ~ memberP(sK56,sK58)
| ~ spl59_6 ),
inference(superposition,[],[f516,f584]) ).
fof(f632,plain,
( ~ ssItem(sK58)
| leq(sK58,sK57(sK58))
| ~ memberP(sK56,sK58)
| ~ spl59_6 ),
inference(trivial_inequality_removal,[],[f631]) ).
fof(f633,plain,
( leq(sK58,sK57(sK58))
| ~ memberP(sK56,sK58)
| ~ spl59_2
| ~ spl59_6 ),
inference(forward_subsumption_resolution,[],[f632,f563]) ).
fof(f634,plain,
( leq(sK58,sK57(sK58))
| ~ spl59_2
| ~ spl59_5
| ~ spl59_6 ),
inference(forward_subsumption_resolution,[],[f633,f578]) ).
fof(f635,plain,
( ~ ssItem(sK57(sK58))
| ~ memberP(sK56,sK57(sK58))
| sK58 = sK57(sK58)
| ~ spl59_2
| ~ spl59_4
| ~ spl59_5
| ~ spl59_6 ),
inference(resolution,[],[f634,f572]) ).
fof(f636,plain,
( ~ memberP(sK56,sK57(sK58))
| sK58 = sK57(sK58)
| ~ spl59_2
| ~ spl59_4
| ~ spl59_5
| ~ spl59_6 ),
inference(forward_subsumption_resolution,[],[f635,f626]) ).
fof(f637,plain,
( sK58 = sK57(sK58)
| ~ spl59_2
| ~ spl59_4
| ~ spl59_5
| ~ spl59_6 ),
inference(forward_subsumption_resolution,[],[f636,f630]) ).
fof(f638,plain,
( sK55 != sK55
| ~ ssItem(sK58)
| sK58 != sK57(sK58)
| ~ memberP(sK56,sK58)
| ~ spl59_6 ),
inference(superposition,[],[f517,f584]) ).
fof(f639,plain,
( ~ ssItem(sK58)
| sK58 != sK57(sK58)
| ~ memberP(sK56,sK58)
| ~ spl59_6 ),
inference(trivial_inequality_removal,[],[f638]) ).
fof(f640,plain,
( sK58 != sK57(sK58)
| ~ memberP(sK56,sK58)
| ~ spl59_2
| ~ spl59_6 ),
inference(forward_subsumption_resolution,[],[f639,f563]) ).
fof(f641,plain,
( sK58 != sK57(sK58)
| ~ spl59_2
| ~ spl59_5
| ~ spl59_6 ),
inference(forward_subsumption_resolution,[],[f640,f578]) ).
fof(f642,plain,
( $false
| ~ spl59_2
| ~ spl59_4
| ~ spl59_5
| ~ spl59_6 ),
inference(forward_subsumption_resolution,[],[f637,f641]) ).
fof(f643,plain,
( ~ spl59_2
| ~ spl59_4
| ~ spl59_5
| ~ spl59_6 ),
inference(avatar_contradiction_clause,[],[f642]) ).
cnf(s1,plain,
( spl59_1
| spl59_2 ),
inference(sat_conversion,[],[f564]) ).
cnf(s2,plain,
( spl59_2
| spl59_3 ),
inference(sat_conversion,[],[f569]) ).
cnf(s3,plain,
( spl59_1
| spl59_4 ),
inference(sat_conversion,[],[f573]) ).
cnf(s4,plain,
( spl59_3
| spl59_4 ),
inference(sat_conversion,[],[f574]) ).
cnf(s5,plain,
( spl59_1
| spl59_5 ),
inference(sat_conversion,[],[f579]) ).
cnf(s6,plain,
( spl59_3
| spl59_5 ),
inference(sat_conversion,[],[f580]) ).
cnf(s7,plain,
( spl59_1
| spl59_6 ),
inference(sat_conversion,[],[f585]) ).
cnf(s8,plain,
( spl59_3
| spl59_6 ),
inference(sat_conversion,[],[f586]) ).
cnf(s9,plain,
( ~ spl59_1
| ~ spl59_3 ),
inference(sat_conversion,[],[f587]) ).
cnf(s19,plain,
( ~ spl59_2
| ~ spl59_4
| ~ spl59_5
| ~ spl59_6 ),
inference(sat_conversion,[],[f643]) ).
cnf(s24,plain,
spl59_1,
inference(rat,[],[s19,s1,s3,s5,s7]) ).
cnf(s25,plain,
~ spl59_3,
inference(rat,[],[s9,s24]) ).
cnf(s26,plain,
spl59_6,
inference(rat,[],[s8,s25]) ).
cnf(s27,plain,
spl59_5,
inference(rat,[],[s6,s25]) ).
cnf(s28,plain,
spl59_4,
inference(rat,[],[s4,s25]) ).
cnf(s29,plain,
spl59_2,
inference(rat,[],[s2,s25]) ).
cnf(s30,plain,
$false,
inference(rat,[],[s19,s26,s27,s28,s29]) ).
fof(f644,plain,
$false,
inference(avatar_sat_refutation,[],[s30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC098+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n006.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 28 07:51:41 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.46 % (3809097)Will run a generic schedule for satisfiability detection.
% 0.18/0.46 % (3809102)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2963093540_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.46 % (3809103)% WARNING: option uhcvi not known.
% 0.18/0.46 % (3809103)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=726489871:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.46 % (3809106)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3113645983:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.46 % (3809104)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=251092242:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.46 % (3809105)dis+10_1_sil=32000:sp=arity:random_seed=2966305936:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.46 % TRYING [1]
% 0.18/0.46 % (3809108)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2290564194:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.46 % (3809107)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3680789658:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.46 % TRYING [2]
% 0.18/0.46 % TRYING [3]
% 0.18/0.46 % (3809105) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3809097-3809105"...
% 0.18/0.46 % (3809103) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3809097-3809103"...
% 0.18/0.46 % (3809105)...printing done.
% 0.18/0.46 % (3809105)Refutation found. Thanks to Tanya!
% 0.18/0.46 % SZS status Theorem for theBenchmark
% 0.18/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.46 % (3809105)------------------------------
% 0.18/0.46 % (3809105)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.46 % (3809105)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.46 % (3809105)CaDiCaL version: 2.1.3
% 0.18/0.46 % (3809105)Termination reason: Refutation
% 0.18/0.46 % (3809105)Time elapsed: 0.008 s
% 0.18/0.46 % (3809105)Peak memory usage: 12 MB
% 0.18/0.46 % (3809105)Instructions burned: 12 (million)
% 0.18/0.46 % (3809097)Success in time 0.043 s
% 0.18/0.46 % Vampire exiting
%------------------------------------------------------------------------------