↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : MGT079+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n004.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 12:04:30 PM UTC 2026

% Result   : Theorem 0.14s 0.46s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   56 (  21 unt;   3 def)
%            Number of atoms       :  142 (  29 equ)
%            Maximal formula atoms :   21 (   2 avg)
%            Number of connectives :  164 (  78   ~;  46   |;  34   &)
%                                         (   5 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   4 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   7 con; 0-0 aty)
%            Number of variables   :   55 (   0 sgn  49   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : ~ less(X0,X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',irreflexive) ).

fof(f2,axiom,
    ! [X0,X1,X2] :
      ( ( less(X0,X1)
        & less(X1,X2) )
     => less(X0,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',transitive) ).

fof(f4,axiom,
    ! [X0,X1] :
      ( leq(X0,X1)
    <=> ( less(X0,X1)
        | X0 = X1 ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_def) ).

fof(f11,axiom,
    ! [X0,X1,X2] :
      ( in_lopen(X0,X1,X2)
    <=> ( less(X1,X0)
        & leq(X0,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',in_lopen) ).

fof(f36,axiom,
    less(v0,v32),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v0_v32) ).

fof(f37,axiom,
    less(v0,v400),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v0_v400) ).

fof(f38,axiom,
    less(v0,v600),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v0_v600) ).

fof(f41,axiom,
    less(v16,v32),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v16_v32) ).

fof(f56,axiom,
    ( v0 != v16
    & v0 != v32
    & v0 != v400
    & v0 != v600
    & v0 != v800
    & v0 != v1200
    & v16 != v32
    & v16 != v400
    & v16 != v600
    & v16 != v800
    & v16 != v1200
    & v32 != v400
    & v32 != v600
    & v32 != v800
    & v32 != v1200
    & v400 != v600
    & v400 != v800
    & v400 != v1200
    & v600 != v800
    & v600 != v1200
    & v800 != v1200 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distinct) ).

fof(f57,conjecture,
    ? [X0,X1,X2] :
      ( in_lopen(X0,v0,v600)
      & in_lopen(X1,v0,v400)
      & in_lopen(X2,v0,v32)
      & ~ ( in_lopen(X0,v0,v1200)
          & in_lopen(X1,v0,v800)
          & in_lopen(X2,v0,v16) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl350) ).

fof(f58,negated_conjecture,
    ~ ? [X0,X1,X2] :
        ( in_lopen(X0,v0,v600)
        & in_lopen(X1,v0,v400)
        & in_lopen(X2,v0,v32)
        & ~ ( in_lopen(X0,v0,v1200)
            & in_lopen(X1,v0,v800)
            & in_lopen(X2,v0,v16) ) ),
    inference(negated_conjecture,[status(cth)],[f57]) ).

fof(f66,plain,
    ! [X0,X1,X2] :
      ( less(X0,X2)
      | ~ less(X0,X1)
      | ~ less(X1,X2) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f67,plain,
    ! [X0,X1,X2] :
      ( less(X0,X2)
      | ~ less(X0,X1)
      | ~ less(X1,X2) ),
    inference(flattening,[],[f66]) ).

fof(f87,plain,
    ! [X0,X1,X2] :
      ( ~ in_lopen(X0,v0,v600)
      | ~ in_lopen(X1,v0,v400)
      | ~ in_lopen(X2,v0,v32)
      | ( in_lopen(X0,v0,v1200)
        & in_lopen(X1,v0,v800)
        & in_lopen(X2,v0,v16) ) ),
    inference(ennf_transformation,[],[f58]) ).

fof(f88,plain,
    ! [X0] : ~ less(X0,X0),
    inference(cnf_transformation,[],[f1]) ).

fof(f89,plain,
    ! [X2,X0,X1] :
      ( ~ less(X1,X2)
      | ~ less(X0,X1)
      | less(X0,X2) ),
    inference(cnf_transformation,[],[f67]) ).

fof(f91,plain,
    ! [X0,X1] :
      ( ~ leq(X0,X1)
      | less(X0,X1)
      | X0 = X1 ),
    inference(cnf_transformation,[],[f4]) ).

fof(f92,plain,
    ! [X0,X1] :
      ( X0 != X1
      | leq(X0,X1) ),
    inference(cnf_transformation,[],[f4]) ).

fof(f99,plain,
    ! [X2,X0,X1] :
      ( leq(X0,X2)
      | ~ in_lopen(X0,X1,X2) ),
    inference(cnf_transformation,[],[f11]) ).

fof(f101,plain,
    ! [X2,X0,X1] :
      ( ~ leq(X0,X2)
      | ~ less(X1,X0)
      | in_lopen(X0,X1,X2) ),
    inference(cnf_transformation,[],[f11]) ).

fof(f116,plain,
    less(v0,v32),
    inference(cnf_transformation,[],[f36]) ).

fof(f117,plain,
    less(v0,v400),
    inference(cnf_transformation,[],[f37]) ).

fof(f118,plain,
    less(v0,v600),
    inference(cnf_transformation,[],[f38]) ).

fof(f121,plain,
    less(v16,v32),
    inference(cnf_transformation,[],[f41]) ).

fof(f150,plain,
    v16 != v32,
    inference(cnf_transformation,[],[f56]) ).

fof(f157,plain,
    ! [X2,X0,X1] :
      ( in_lopen(X2,v0,v16)
      | ~ in_lopen(X2,v0,v32)
      | ~ in_lopen(X1,v0,v400)
      | ~ in_lopen(X0,v0,v600) ),
    inference(cnf_transformation,[],[f87]) ).

fof(f160,plain,
    ! [X1] : leq(X1,X1),
    inference(equality_resolution,[],[f92]) ).

fof(f169,definition,
    ( spl0_1
  <=> ! [X0] : ~ in_lopen(X0,v0,v600) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f170,plain,
    ( ! [X0] : ~ in_lopen(X0,v0,v600)
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f169]) ).

fof(f172,definition,
    ( spl0_2
  <=> ! [X1] : ~ in_lopen(X1,v0,v400) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f173,plain,
    ( ! [X1] : ~ in_lopen(X1,v0,v400)
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f172]) ).

fof(f175,definition,
    ( spl0_3
  <=> ! [X2] :
        ( in_lopen(X2,v0,v16)
        | ~ in_lopen(X2,v0,v32) ) ),
    introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).

fof(f176,plain,
    ( ! [X2] :
        ( in_lopen(X2,v0,v16)
        | ~ in_lopen(X2,v0,v32) )
    | ~ spl0_3 ),
    inference(avatar_component_clause,[],[f175]) ).

fof(f177,plain,
    ( spl0_1
    | spl0_2
    | spl0_3 ),
    inference(avatar_split_clause,[],[f157,f175,f172,f169]) ).

fof(f259,plain,
    ! [X0] :
      ( less(v16,X0)
      | ~ less(v32,X0) ),
    inference(resolution,[],[f89,f121]) ).

fof(f271,plain,
    ! [X2,X0,X1] :
      ( ~ in_lopen(X0,X2,X1)
      | X0 = X1
      | less(X0,X1) ),
    inference(resolution,[],[f91,f99]) ).

fof(f309,plain,
    ! [X0,X1] :
      ( in_lopen(X1,X0,X1)
      | ~ less(X0,X1) ),
    inference(resolution,[],[f101,f160]) ).

fof(f458,plain,
    ~ less(v32,v16),
    inference(resolution,[],[f259,f88]) ).

fof(f549,plain,
    ( ~ less(v0,v400)
    | ~ spl0_2 ),
    inference(resolution,[],[f309,f173]) ).

fof(f554,plain,
    ( $false
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f549,f117]) ).

fof(f555,plain,
    ~ spl0_2,
    inference(avatar_contradiction_clause,[],[f554]) ).

fof(f641,plain,
    ( ! [X0] :
        ( ~ in_lopen(X0,v0,v32)
        | less(X0,v16)
        | v16 = X0 )
    | ~ spl0_3 ),
    inference(resolution,[],[f271,f176]) ).

fof(f644,plain,
    ( less(v32,v16)
    | v16 = v32
    | ~ less(v0,v32)
    | ~ spl0_3 ),
    inference(resolution,[],[f641,f309]) ).

fof(f645,plain,
    ( v16 = v32
    | ~ less(v0,v32)
    | ~ spl0_3 ),
    inference(forward_subsumption_resolution,[],[f644,f458]) ).

fof(f646,plain,
    ( ~ less(v0,v32)
    | ~ spl0_3 ),
    inference(forward_subsumption_resolution,[],[f645,f150]) ).

fof(f647,plain,
    ( $false
    | ~ spl0_3 ),
    inference(forward_subsumption_resolution,[],[f646,f116]) ).

fof(f648,plain,
    ~ spl0_3,
    inference(avatar_contradiction_clause,[],[f647]) ).

fof(f649,plain,
    ( ~ less(v0,v600)
    | ~ spl0_1 ),
    inference(resolution,[],[f170,f309]) ).

fof(f650,plain,
    ( $false
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[],[f649,f118]) ).

fof(f651,plain,
    ~ spl0_1,
    inference(avatar_contradiction_clause,[],[f650]) ).

cnf(s1,plain,
    ( spl0_1
    | spl0_2
    | spl0_3 ),
    inference(sat_conversion,[],[f177]) ).

cnf(s14,plain,
    ~ spl0_2,
    inference(sat_conversion,[],[f555]) ).

cnf(s15,plain,
    ~ spl0_3,
    inference(sat_conversion,[],[f648]) ).

cnf(s16,plain,
    ~ spl0_1,
    inference(sat_conversion,[],[f651]) ).

cnf(s24,plain,
    $false,
    inference(rat,[],[s1,s15,s14,s16]) ).

fof(f652,plain,
    $false,
    inference(avatar_sat_refutation,[],[s24]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT079+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.38  % Computer : n004.cluster.edu
% 0.14/0.38  % Model    : x86_64 x86_64
% 0.14/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.38  % Memory   : 8046.5625MB
% 0.14/0.38  % OS       : Linux 6.8.0-71-generic
% 0.14/0.38  % CPULimit : 300
% 0.14/0.38  % WCLimit  : 300
% 0.14/0.38  % DateTime : Sun Sep 27 17:34:37 UTC 2026
% 0.14/0.38  % CPUTime  : 
% 0.14/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.42  Running first-order model finding
% 0.14/0.42  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.46  % (3774621)Will run a generic schedule for satisfiability detection.
% 0.14/0.46  % (3774630)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3588281561:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.14/0.46  % (3774627)% WARNING: option uhcvi not known.
% 0.14/0.46  % (3774627)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=62151722:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.14/0.46  % (3774630) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3774621-3774630"...
% 0.14/0.46  % (3774626)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=802459225_2999 on theBenchmark for (2999ds/0Mi)
% 0.14/0.46  % (3774628)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2168794397:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.14/0.46  % (3774629)dis+10_1_sil=32000:sp=arity:random_seed=3850580132:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.14/0.46  % (3774632)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3147012151:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.14/0.46  % (3774630)...printing done.
% 0.14/0.46  % (3774631)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=497500613:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.14/0.46  % (3774630)Refutation found. Thanks to Tanya!
% 0.14/0.46  % SZS status Theorem for theBenchmark
% 0.14/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.46  % (3774630)------------------------------
% 0.14/0.46  % (3774630)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.14/0.46  % (3774630)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.14/0.46  % (3774630)CaDiCaL version: 2.1.3
% 0.14/0.46  % (3774630)Termination reason: Refutation
% 0.14/0.46  % (3774630)Time elapsed: 0.007 s
% 0.14/0.46  % (3774630)Peak memory usage: 12 MB
% 0.14/0.46  % (3774630)Instructions burned: 20 (million)
% 0.14/0.46  % (3774621)Success in time 0.032 s
% 0.14/0.46  % Vampire exiting
%------------------------------------------------------------------------------