↑ 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  : MGT077+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 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 12:04:30 PM UTC 2026

% Result   : Theorem 0.16s 0.47s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   39 (  18 unt;   2 def)
%            Number of atoms       :   77 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   75 (  37   ~;  26   |;   8   &)
%                                         (   3 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   3 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   29 (   0 sgn  25   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f14,axiom,
    ! [X0,X1,X2] :
      ( in_open(X0,X1,X2)
    <=> ( less(X1,X0)
        & less(X0,X2) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',in_open) ).

fof(f35,axiom,
    less(v0,v200),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v0_v200) ).

fof(f36,axiom,
    less(v0,v500),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v0_v500) ).

fof(f38,axiom,
    less(v100,v200),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v100_v200) ).

fof(f41,axiom,
    less(v200,v500),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v200_v500) ).

fof(f43,axiom,
    less(v500,v800),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v500_v800) ).

fof(f45,conjecture,
    ? [X0,X1] :
      ( less(v200,X0)
      & in_open(X0,v0,v800)
      & less(v100,X1)
      & in_open(X1,v0,v500) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl327) ).

fof(f46,negated_conjecture,
    ~ ? [X0,X1] :
        ( less(v200,X0)
        & in_open(X0,v0,v800)
        & less(v100,X1)
        & in_open(X1,v0,v500) ),
    inference(negated_conjecture,[status(cth)],[f45]) ).

fof(f47,plain,
    ! [X0,X1,X2] :
      ( ( less(X1,X0)
        & less(X0,X2) )
     => in_open(X0,X1,X2) ),
    inference(unused_predicate_definition_removal,[],[f14]) ).

fof(f65,plain,
    ! [X0,X1,X2] :
      ( in_open(X0,X1,X2)
      | ~ less(X1,X0)
      | ~ less(X0,X2) ),
    inference(ennf_transformation,[],[f47]) ).

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

fof(f77,plain,
    ! [X0,X1] :
      ( ~ less(v200,X0)
      | ~ in_open(X0,v0,v800)
      | ~ less(v100,X1)
      | ~ in_open(X1,v0,v500) ),
    inference(ennf_transformation,[],[f46]) ).

fof(f94,plain,
    ! [X2,X0,X1] :
      ( ~ less(X1,X0)
      | in_open(X0,X1,X2)
      | ~ less(X0,X2) ),
    inference(cnf_transformation,[],[f66]) ).

fof(f109,plain,
    less(v0,v200),
    inference(cnf_transformation,[],[f35]) ).

fof(f110,plain,
    less(v0,v500),
    inference(cnf_transformation,[],[f36]) ).

fof(f112,plain,
    less(v100,v200),
    inference(cnf_transformation,[],[f38]) ).

fof(f115,plain,
    less(v200,v500),
    inference(cnf_transformation,[],[f41]) ).

fof(f117,plain,
    less(v500,v800),
    inference(cnf_transformation,[],[f43]) ).

fof(f128,plain,
    ! [X0,X1] :
      ( ~ less(v200,X0)
      | ~ in_open(X0,v0,v800)
      | ~ less(v100,X1)
      | ~ in_open(X1,v0,v500) ),
    inference(cnf_transformation,[],[f77]) ).

fof(f130,definition,
    ( spl1_1
  <=> ! [X1] :
        ( ~ less(v100,X1)
        | ~ in_open(X1,v0,v500) ) ),
    introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition]) ).

fof(f131,plain,
    ( ! [X1] :
        ( ~ less(v100,X1)
        | ~ in_open(X1,v0,v500) )
    | ~ spl1_1 ),
    inference(avatar_component_clause,[],[f130]) ).

fof(f133,definition,
    ( spl1_2
  <=> ! [X0] :
        ( ~ less(v200,X0)
        | ~ in_open(X0,v0,v800) ) ),
    introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).

fof(f134,plain,
    ( ! [X0] :
        ( ~ less(v200,X0)
        | ~ in_open(X0,v0,v800) )
    | ~ spl1_2 ),
    inference(avatar_component_clause,[],[f133]) ).

fof(f135,plain,
    ( spl1_1
    | spl1_2 ),
    inference(avatar_split_clause,[],[f128,f133,f130]) ).

fof(f136,plain,
    ( ~ in_open(v500,v0,v800)
    | ~ spl1_2 ),
    inference(resolution,[],[f115,f134]) ).

fof(f248,plain,
    ! [X0] :
      ( ~ less(v200,X0)
      | in_open(v200,v0,X0) ),
    inference(resolution,[],[f94,f109]) ).

fof(f249,plain,
    ! [X0] :
      ( ~ less(v500,X0)
      | in_open(v500,v0,X0) ),
    inference(resolution,[],[f94,f110]) ).

fof(f615,plain,
    in_open(v200,v0,v500),
    inference(resolution,[],[f248,f115]) ).

fof(f621,plain,
    in_open(v500,v0,v800),
    inference(resolution,[],[f249,f117]) ).

fof(f625,plain,
    ( $false
    | ~ spl1_2 ),
    inference(forward_subsumption_resolution,[],[f621,f136]) ).

fof(f626,plain,
    ~ spl1_2,
    inference(avatar_contradiction_clause,[],[f625]) ).

fof(f627,plain,
    ( ~ in_open(v200,v0,v500)
    | ~ spl1_1 ),
    inference(resolution,[],[f131,f112]) ).

fof(f635,plain,
    ( $false
    | ~ spl1_1 ),
    inference(forward_subsumption_resolution,[],[f627,f615]) ).

fof(f636,plain,
    ~ spl1_1,
    inference(avatar_contradiction_clause,[],[f635]) ).

cnf(s1,plain,
    ( spl1_1
    | spl1_2 ),
    inference(sat_conversion,[],[f135]) ).

cnf(s13,plain,
    ~ spl1_2,
    inference(sat_conversion,[],[f626]) ).

cnf(s14,plain,
    ~ spl1_1,
    inference(sat_conversion,[],[f636]) ).

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

fof(f637,plain,
    $false,
    inference(avatar_sat_refutation,[],[s15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT077+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.39  % Computer : n015.cluster.edu
% 0.10/0.39  % Model    : x86_64 x86_64
% 0.10/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.39  % Memory   : 8046.5625MB
% 0.10/0.39  % OS       : Linux 6.8.0-71-generic
% 0.10/0.39  % CPULimit : 300
% 0.10/0.39  % WCLimit  : 300
% 0.10/0.39  % DateTime : Sun Sep 27 17:37:46 UTC 2026
% 0.10/0.39  % CPUTime  : 
% 0.10/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42  Running first-order model finding
% 0.10/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
% 0.16/0.47  % (1891341)Will run a generic schedule for satisfiability detection.
% 0.16/0.47  % (1891351)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1464995813:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.47  % (1891347)% WARNING: option uhcvi not known.
% 0.16/0.47  % (1891351) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1891341-1891351"...
% 0.16/0.47  % (1891347)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4276330050:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.47  % (1891346)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1094356656_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.47  % (1891348)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3376817138:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.47  % (1891349)dis+10_1_sil=32000:sp=arity:random_seed=1443874706:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.47  % (1891351)...printing done.
% 0.16/0.47  % (1891350)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=467692618:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.47  % (1891352)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2118141409:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.47  % (1891351)Refutation found. Thanks to Tanya!
% 0.16/0.47  % SZS status Theorem for theBenchmark
% 0.16/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.47  % (1891351)------------------------------
% 0.16/0.47  % (1891351)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.47  % (1891351)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.47  % (1891351)CaDiCaL version: 2.1.3
% 0.16/0.47  % (1891351)Termination reason: Refutation
% 0.16/0.47  % (1891351)Time elapsed: 0.006 s
% 0.16/0.47  % (1891351)Peak memory usage: 12 MB
% 0.16/0.47  % (1891351)Instructions burned: 14 (million)
% 0.16/0.47  % (1891341)Success in time 0.038 s
% 0.16/0.47  % Vampire exiting
%------------------------------------------------------------------------------