↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : LCL047-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n015.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 11:57:30 AM UTC 2026

% Result   : Unsatisfiable 1.65s 0.76s
% Output   : Refutation 1.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   23
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   40 (  10 unt;   0 def)
%            Number of atoms       :   80 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   81 (  41   ~;  40   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   6 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :  113 ( 113   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(X0,X1))
      | ~ is_a_theorem(X0)
      | is_a_theorem(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).

fof(f2,axiom,
    ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_1) ).

fof(f3,axiom,
    ! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_2) ).

fof(f4,axiom,
    ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_3) ).

fof(f5,negated_conjecture,
    ~ is_a_theorem(implies(a,implies(b,a))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_18) ).

fof(f23,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(implies(implies(X1,X2),implies(X0,X2)))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[],[f2,f1]) ).

fof(f24,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(X1,X2))
      | ~ is_a_theorem(implies(X0,X1))
      | is_a_theorem(implies(X0,X2)) ),
    inference(resolution,[],[f23,f1]) ).

fof(f25,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(X0,implies(not(X1),X1)))
      | is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[],[f24,f3]) ).

fof(f27,plain,
    ! [X2,X3,X0,X1] :
      ( ~ is_a_theorem(implies(X3,X1))
      | is_a_theorem(implies(X0,implies(X3,X2)))
      | ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
    inference(resolution,[],[f24,f23]) ).

fof(f28,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(implies(X0,implies(not(X1),X2)))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[],[f24,f4]) ).

fof(f36,plain,
    ! [X2,X3,X0,X1] :
      ( ~ is_a_theorem(implies(X2,X0))
      | ~ is_a_theorem(implies(X0,X1))
      | is_a_theorem(implies(X2,implies(not(X1),X3))) ),
    inference(resolution,[],[f28,f24]) ).

fof(f37,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(X0,X1))
      | ~ is_a_theorem(X0)
      | is_a_theorem(implies(not(X1),X2)) ),
    inference(resolution,[],[f28,f1]) ).

fof(f52,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(implies(not(implies(not(X0),X1)),X2))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f37,f4]) ).

fof(f206,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(implies(implies(not(X0),X0),implies(not(X1),X2)))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[],[f36,f3]) ).

fof(f222,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(implies(not(X0),X0),X1))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[],[f206,f25]) ).

fof(f235,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(not(X0),X0))
      | ~ is_a_theorem(implies(X0,X1))
      | is_a_theorem(X1) ),
    inference(resolution,[],[f222,f1]) ).

fof(f241,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(implies(not(X0),X1),X2))
      | is_a_theorem(X2)
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f235,f52]) ).

fof(f248,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(implies(implies(X0,X1),implies(not(X2),X1)))
      | ~ is_a_theorem(X2) ),
    inference(resolution,[],[f241,f2]) ).

fof(f261,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(implies(X1,X0),X0))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f248,f25]) ).

fof(f274,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(X1,implies(X2,X0)))
      | ~ is_a_theorem(X0)
      | is_a_theorem(implies(X1,X0)) ),
    inference(resolution,[],[f261,f24]) ).

fof(f289,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(X1,X0))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f274,f4]) ).

fof(f301,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(not(X0),X0))
      | is_a_theorem(implies(X1,X0)) ),
    inference(resolution,[],[f289,f25]) ).

fof(f328,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(X1)
      | is_a_theorem(implies(X0,implies(not(X1),X2))) ),
    inference(resolution,[],[f301,f52]) ).

fof(f373,plain,
    ! [X2,X3,X0,X1] :
      ( is_a_theorem(implies(X0,implies(not(implies(X1,X2)),X3)))
      | ~ is_a_theorem(X2) ),
    inference(resolution,[],[f328,f289]) ).

fof(f655,plain,
    ! [X2,X3,X0,X1] :
      ( ~ is_a_theorem(implies(X0,implies(implies(not(X1),X3),X2)))
      | is_a_theorem(implies(X0,implies(X1,X2))) ),
    inference(resolution,[],[f27,f4]) ).

fof(f681,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(implies(X1,implies(X2,X0)))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f373,f25]) ).

fof(f715,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(implies(X1,X0),X2))
      | ~ is_a_theorem(X0)
      | is_a_theorem(X2) ),
    inference(resolution,[],[f681,f235]) ).

fof(f747,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(implies(implies(X0,X1),implies(X2,X1)))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f715,f2]) ).

fof(f765,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(implies(X0,X1),X1))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f747,f25]) ).

fof(f777,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(X1,implies(X0,X2)))
      | ~ is_a_theorem(X0)
      | is_a_theorem(implies(X1,X2)) ),
    inference(resolution,[],[f765,f24]) ).

fof(f2606,plain,
    ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,not(X1)),implies(X1,implies(X0,X2)))),
    inference(resolution,[],[f655,f2]) ).

fof(f2649,plain,
    ! [X2,X3,X0,X1] :
      ( ~ is_a_theorem(implies(implies(not(X1),X3),X2))
      | is_a_theorem(implies(X0,implies(X1,X2))) ),
    inference(resolution,[],[f655,f289]) ).

fof(f5747,plain,
    ! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,implies(not(X1),X3))))),
    inference(resolution,[],[f2649,f2606]) ).

fof(f5830,plain,
    ! [X2,X3,X0,X1] :
      ( ~ is_a_theorem(implies(implies(X0,implies(X1,implies(not(X0),X2))),X3))
      | is_a_theorem(X3) ),
    inference(resolution,[],[f5747,f235]) ).

fof(f6112,plain,
    ! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(X0,implies(not(X1),X2)),X3),implies(X1,X3))),
    inference(resolution,[],[f5830,f2]) ).

fof(f6788,plain,
    ! [X2,X3,X0,X1] :
      ( ~ is_a_theorem(implies(implies(X0,implies(not(X1),X2)),X3))
      | is_a_theorem(implies(X1,X3)) ),
    inference(resolution,[],[f6112,f1]) ).

fof(f7596,plain,
    ! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(implies(implies(not(X0),X1),X2),implies(X3,X2)))),
    inference(resolution,[],[f6788,f2]) ).

fof(f8207,plain,
    ! [X2,X3,X0,X1] :
      ( ~ is_a_theorem(implies(implies(not(X0),X1),X2))
      | is_a_theorem(implies(X0,implies(X3,X2))) ),
    inference(resolution,[],[f7596,f777]) ).

fof(f11553,plain,
    ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
    inference(resolution,[],[f8207,f3]) ).

fof(f11712,plain,
    $false,
    inference(resolution,[],[f11553,f5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL047-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39  % Computer : n015.cluster.edu
% 0.11/0.39  % Model    : x86_64 x86_64
% 0.11/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39  % Memory   : 8046.5625MB
% 0.11/0.39  % OS       : Linux 6.8.0-71-generic
% 0.11/0.39  % CPULimit : 300
% 0.11/0.39  % WCLimit  : 300
% 0.11/0.39  % DateTime : Sun Sep 27 15:22:16 UTC 2026
% 0.11/0.39  % CPUTime  : 
% 0.11/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42  Running first-order model finding
% 0.11/0.42  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
% 1.65/0.76  % (1772998)Will run a generic schedule for satisfiability detection.
% 1.65/0.76  % (1773009)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1869945072:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.65/0.76  % (1773004)% WARNING: option uhcvi not known.
% 1.65/0.76  % (1773005)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2123305305:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.65/0.76  % (1773003)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3584933692_2999 on theBenchmark for (2999ds/0Mi)
% 1.65/0.76  % (1773004)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=346165922:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.65/0.76  % (1773006)dis+10_1_sil=32000:sp=arity:random_seed=382330455:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.65/0.76  % (1773007)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1678499846:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.65/0.76  % (1773008)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=532829236:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.65/0.76  % TRYING [1]
% 1.65/0.76  % TRYING [2]
% 1.65/0.76  % TRYING [3]
% 1.65/0.76  % TRYING [4]
% 1.65/0.76  % (1773009)Instruction limit reached! 
% 1.65/0.76  % (1773009)------------------------------
% 1.65/0.76  % (1773009)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.65/0.76  % (1773009)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.65/0.76  % (1773009)CaDiCaL version: 2.1.3
% 1.65/0.76  % (1773009)Termination reason: Instruction limit
% 1.65/0.76  % (1773009)Termination phase: Saturation
% 1.65/0.76  % (1773009)Time elapsed: 0.052 s
% 1.65/0.76  % (1773009)Peak memory usage: 12 MB
% 1.65/0.76  % (1773009)Instructions burned: 159 (million)
% 1.65/0.76  % TRYING [5]
% 1.65/0.76  % (1773017)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2724852302:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.65/0.76  % TRYING [1]
% 1.65/0.76  % TRYING [2]
% 1.65/0.76  % TRYING [3]
% 1.65/0.76  % TRYING [4]
% 1.65/0.76  % (1773006)Instruction limit reached! 
% 1.65/0.76  % (1773006)------------------------------
% 1.65/0.76  % (1773006)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.65/0.76  % (1773006)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.65/0.76  % (1773006)CaDiCaL version: 2.1.3
% 1.65/0.76  % (1773006)Termination reason: Instruction limit
% 1.65/0.76  % (1773006)Termination phase: Saturation
% 1.65/0.76  % (1773006)Time elapsed: 0.063 s
% 1.65/0.76  % (1773006)Peak memory usage: 12 MB
% 1.65/0.76  % (1773006)Instructions burned: 103 (million)
% 1.65/0.76  % (1773007)Instruction limit reached! 
% 1.65/0.76  % (1773007)------------------------------
% 1.65/0.76  % (1773007)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.65/0.76  % (1773007)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.65/0.76  % (1773007)CaDiCaL version: 2.1.3
% 1.65/0.76  % (1773007)Termination reason: Instruction limit
% 1.65/0.76  % (1773007)Termination phase: Saturation
% 1.65/0.76  % (1773007)Time elapsed: 0.070 s
% 1.65/0.76  % (1773007)Peak memory usage: 11 MB
% 1.65/0.76  % (1773007)Instructions burned: 117 (million)
% 1.65/0.76  % (1773008)Instruction limit reached! 
% 1.65/0.76  % (1773008)------------------------------
% 1.65/0.76  % (1773008)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.65/0.76  % (1773008)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.65/0.76  % (1773008)CaDiCaL version: 2.1.3
% 1.65/0.76  % (1773008)Termination reason: Instruction limit
% 1.65/0.76  % (1773008)Termination phase: Saturation
% 1.65/0.76  % (1773008)Time elapsed: 0.082 s
% 1.65/0.76  % (1773008)Peak memory usage: 13 MB
% 1.65/0.76  % (1773008)Instructions burned: 132 (million)
% 1.65/0.76  % (1773019)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1779303514:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.65/0.76  % TRYING [5]
% 1.65/0.76  % (1773020)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=2668981527:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.65/0.76  % (1773022)ott-21_1_sil=16000:fs=off:random_seed=3305834697:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.65/0.76  % (1773019)Instruction limit reached! 
% 1.65/0.76  % (1773019)------------------------------
% 1.65/0.76  % (1773019)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.65/0.76  % (1773019)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.65/0.76  % (1773019)CaDiCaL version: 2.1.3
% 1.65/0.76  % (1773019)Termination reason: Instruction limit
% 1.65/0.76  % (1773019)Termination phase: Saturation
% 1.65/0.76  % (1773019)Time elapsed: 0.078 s
% 1.65/0.76  % (1773019)Peak memory usage: 12 MB
% 1.65/0.76  % (1773019)Instructions burned: 132 (million)
% 1.65/0.76  % (1773025)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2734409104:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 1.65/0.76  % (1773022)Instruction limit reached! 
% 1.65/0.76  % (1773022)------------------------------
% 1.65/0.76  % (1773022)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.65/0.76  % (1773022)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.65/0.76  % (1773022)CaDiCaL version: 2.1.3
% 1.65/0.76  % (1773022)Termination reason: Instruction limit
% 1.65/0.76  % (1773022)Termination phase: Saturation
% 1.65/0.76  % (1773022)Time elapsed: 0.092 s
% 1.65/0.76  % (1773022)Peak memory usage: 13 MB
% 1.65/0.76  % (1773022)Instructions burned: 182 (million)
% 1.65/0.76  % (1773027)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2157776575:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 1.65/0.76  % TRYING [1]
% 1.65/0.76  % TRYING [2]
% 1.65/0.76  % TRYING [3]
% 1.65/0.76  % TRYING [4]
% 1.65/0.76  % TRYING [5]
% 1.65/0.76  % TRYING [6]
% 1.65/0.76  % (1773017)Instruction limit reached! 
% 1.65/0.76  % (1773017)------------------------------
% 1.65/0.76  % (1773017)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.65/0.76  % (1773017)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.65/0.76  % (1773017)CaDiCaL version: 2.1.3
% 1.65/0.76  % (1773017)Termination reason: Instruction limit
% 1.65/0.76  % (1773017)Termination phase: Finite model building SAT solving
% 1.65/0.76  % (1773017)Time elapsed: 0.223 s
% 1.65/0.76  % (1773017)Peak memory usage: 14 MB
% 1.65/0.76  % (1773017)Instructions burned: 717 (million)
% 1.65/0.76  % (1773029)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3183819913:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 1.65/0.76  % (1773020) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1772998-1773020"...
% 1.65/0.76  % (1773020)...printing done.
% 1.65/0.76  % (1773020)Refutation found. Thanks to Tanya!
% 1.65/0.76  % SZS status Unsatisfiable for theBenchmark
% 1.65/0.76  % SZS output start Proof for theBenchmark
% See solution above
% 1.65/0.76  % (1773020)------------------------------
% 1.65/0.76  % (1773020)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.65/0.76  % (1773020)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.65/0.76  % (1773020)CaDiCaL version: 2.1.3
% 1.65/0.76  % (1773020)Termination reason: Refutation
% 1.65/0.76  % (1773020)Time elapsed: 0.204 s
% 1.65/0.76  % (1773020)Peak memory usage: 15 MB
% 1.65/0.76  % (1773020)Instructions burned: 345 (million)
% 1.65/0.76  % (1772998)Success in time 0.329 s
% 1.65/0.76  % Vampire exiting
%------------------------------------------------------------------------------