↑ 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  : MGT088+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 : n007.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:31 PM UTC 2026

% Result   : Theorem 0.09s 0.45s
% Output   : Refutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   22 (   8 unt;   0 def)
%            Number of atoms       :   50 (   6 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   48 (  20   ~;  17   |;   8   &)
%                                         (   2 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   30 (  28   !;   2   ?)

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

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

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

fof(f36,axiom,
    less(v200,v400),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v200_v400) ).

fof(f40,conjecture,
    ? [X0] :
      ( less(v200,X0)
      & in_lopen(X0,v0,v400) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl509) ).

fof(f41,negated_conjecture,
    ~ ? [X0] :
        ( less(v200,X0)
        & in_lopen(X0,v0,v400) ),
    inference(negated_conjecture,[status(cth)],[f40]) ).

fof(f42,plain,
    ! [X0,X1,X2] :
      ( ( less(X1,X0)
        & leq(X0,X2) )
     => in_lopen(X0,X1,X2) ),
    inference(unused_predicate_definition_removal,[],[f12]) ).

fof(f59,plain,
    ! [X0,X1,X2] :
      ( in_lopen(X0,X1,X2)
      | ~ less(X1,X0)
      | ~ leq(X0,X2) ),
    inference(ennf_transformation,[],[f42]) ).

fof(f60,plain,
    ! [X0,X1,X2] :
      ( in_lopen(X0,X1,X2)
      | ~ less(X1,X0)
      | ~ leq(X0,X2) ),
    inference(flattening,[],[f59]) ).

fof(f71,plain,
    ! [X0] :
      ( ~ less(v200,X0)
      | ~ in_lopen(X0,v0,v400) ),
    inference(ennf_transformation,[],[f41]) ).

fof(f72,plain,
    ! [X0,X1] :
      ( ( leq(X0,X1)
        | ( ~ less(X0,X1)
          & X0 != X1 ) )
      & ( less(X0,X1)
        | X0 = X1
        | ~ leq(X0,X1) ) ),
    inference(nnf_transformation,[],[f4]) ).

fof(f73,plain,
    ! [X0,X1] :
      ( ( leq(X0,X1)
        | ( ~ less(X0,X1)
          & X0 != X1 ) )
      & ( less(X0,X1)
        | X0 = X1
        | ~ leq(X0,X1) ) ),
    inference(flattening,[],[f72]) ).

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

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

fof(f103,plain,
    less(v0,v400),
    inference(cnf_transformation,[],[f34]) ).

fof(f105,plain,
    less(v200,v400),
    inference(cnf_transformation,[],[f36]) ).

fof(f114,plain,
    ! [X0] :
      ( ~ less(v200,X0)
      | ~ in_lopen(X0,v0,v400) ),
    inference(cnf_transformation,[],[f71]) ).

fof(f115,plain,
    ~ in_lopen(v400,v0,v400),
    inference(resolution,[],[f105,f114]) ).

fof(f117,plain,
    ! [X0] : leq(X0,X0),
    inference(equality_resolution,[],[f79]) ).

fof(f196,plain,
    ! [X0,X1] :
      ( ~ less(X0,X1)
      | in_lopen(X1,X0,X1) ),
    inference(resolution,[],[f88,f117]) ).

fof(f672,plain,
    in_lopen(v400,v0,v400),
    inference(resolution,[],[f196,f103]) ).

fof(f694,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f672,f115]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT088+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.09/0.38  % Computer : n007.cluster.edu
% 0.09/0.38  % Model    : x86_64 x86_64
% 0.09/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.38  % Memory   : 8046.5625MB
% 0.09/0.38  % OS       : Linux 6.8.0-71-generic
% 0.09/0.38  % CPULimit : 300
% 0.09/0.38  % WCLimit  : 300
% 0.09/0.38  % DateTime : Sun Sep 27 17:32:55 UTC 2026
% 0.09/0.38  % CPUTime  : 
% 0.09/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.41  Running first-order model finding
% 0.09/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.09/0.45  % (1682531)Will run a generic schedule for satisfiability detection.
% 0.09/0.45  % (1682541)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1802560258:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.45  % (1682537)% WARNING: option uhcvi not known.
% 0.09/0.45  % (1682541) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1682531-1682541"...
% 0.09/0.45  % (1682537)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1059070014:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.45  % (1682536)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=556760937_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.45  % (1682540)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2192522200:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.45  % (1682541)...printing done.
% 0.09/0.45  % (1682538)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1349975219:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.45  % (1682539)dis+10_1_sil=32000:sp=arity:random_seed=3711670306:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.45  % (1682542)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3569803872:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.45  % (1682541)Refutation found. Thanks to Tanya!
% 0.09/0.45  % SZS status Theorem for theBenchmark
% 0.09/0.45  % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.45  % (1682541)------------------------------
% 0.09/0.45  % (1682541)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.45  % (1682541)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.45  % (1682541)CaDiCaL version: 2.1.3
% 0.09/0.45  % (1682541)Termination reason: Refutation
% 0.09/0.45  % (1682541)Time elapsed: 0.007 s
% 0.09/0.45  % (1682541)Peak memory usage: 12 MB
% 0.09/0.45  % (1682541)Instructions burned: 18 (million)
% 0.09/0.45  % (1682531)Success in time 0.033 s
% 0.09/0.45  % Vampire exiting
%------------------------------------------------------------------------------