↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n020.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:02:19 PM UTC 2026

% Result   : Theorem 2.79s 1.36s
% Output   : Refutation 2.79s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   16 (   6 unt;   0 def)
%            Number of atoms       :   36 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   40 (  20   ~;  14   |;   5   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   23 (  21   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f29,axiom,
    ! [X0,X1,X2] :
      ( ( leq(X1,X0)
        & leq(X0,X2) )
     => completion_compatible(X0,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',completion_compat) ).

fof(f37,axiom,
    ! [X0] : leq(ninf,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',h_inf_lb) ).

fof(f38,axiom,
    ! [X0] : leq(X0,nsup),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',h_sup_ub) ).

fof(f40,conjecture,
    ? [X0] :
      ( leq(ninf,X0)
      & leq(X0,nsup)
      & completion_compatible(X0,ninf,nsup) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown_sound_compatible) ).

fof(f41,negated_conjecture,
    ~ ? [X0] :
        ( leq(ninf,X0)
        & leq(X0,nsup)
        & completion_compatible(X0,ninf,nsup) ),
    inference(negated_conjecture,[status(cth)],[f40]) ).

fof(f69,plain,
    ! [X0,X1,X2] :
      ( completion_compatible(X0,X1,X2)
      | ~ leq(X1,X0)
      | ~ leq(X0,X2) ),
    inference(ennf_transformation,[],[f29]) ).

fof(f70,plain,
    ! [X0,X1,X2] :
      ( completion_compatible(X0,X1,X2)
      | ~ leq(X1,X0)
      | ~ leq(X0,X2) ),
    inference(flattening,[],[f69]) ).

fof(f76,plain,
    ! [X0] :
      ( ~ leq(ninf,X0)
      | ~ leq(X0,nsup)
      | ~ completion_compatible(X0,ninf,nsup) ),
    inference(ennf_transformation,[],[f41]) ).

fof(f120,plain,
    ! [X2,X0,X1] :
      ( completion_compatible(X0,X1,X2)
      | ~ leq(X1,X0)
      | ~ leq(X0,X2) ),
    inference(cnf_transformation,[],[f70]) ).

fof(f126,plain,
    ! [X0] : leq(ninf,X0),
    inference(cnf_transformation,[],[f37]) ).

fof(f127,plain,
    ! [X0] : leq(X0,nsup),
    inference(cnf_transformation,[],[f38]) ).

fof(f129,plain,
    ! [X0] :
      ( ~ completion_compatible(X0,ninf,nsup)
      | ~ leq(X0,nsup)
      | ~ leq(ninf,X0) ),
    inference(cnf_transformation,[],[f76]) ).

fof(f210,plain,
    ! [X0] :
      ( ~ leq(ninf,X0)
      | ~ leq(X0,nsup)
      | ~ leq(X0,nsup)
      | ~ leq(ninf,X0) ),
    inference(resolution,[],[f120,f129]) ).

fof(f211,plain,
    ! [X0] :
      ( ~ leq(ninf,X0)
      | ~ leq(X0,nsup) ),
    inference(duplicate_literal_removal,[],[f210]) ).

fof(f212,plain,
    ! [X0] : ~ leq(X0,nsup),
    inference(forward_subsumption_resolution,[],[f211,f126]) ).

fof(f213,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f212,f127]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT070+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37  % Computer : n020.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sun Sep 27 17:34:19 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40  Running first-order theorem proving
% 0.10/0.40  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.79/1.36  % (3634445)Detected formulas, will run a generic FOF schedule.
% 2.79/1.36  % (3634455)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3530942338:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.79/1.36  % (3634455)First to succeed.
% 2.79/1.36  % (3634455)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3634445"
% 2.79/1.36  % (3634450)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=375133535:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.79/1.36  % (3634452)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=62541995:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.79/1.36  % (3634456)dis-21_1_sil=8000:lcm=predicate:random_seed=217844797:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.79/1.36  % (3634451)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3219504626:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.79/1.36  % (3634453)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3136491935:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.79/1.36  % (3634454)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=108850206:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.79/1.36  % (3634453)Also succeeded, but the first one will report.
% 2.79/1.36  % (3634454)Also succeeded, but the first one will report.
% 2.79/1.36  % (3634456)Also succeeded, but the first one will report.
% 2.79/1.36  % (3634455)Refutation found. Thanks to Tanya!
% 2.79/1.36  % SZS status Theorem for theBenchmark
% 2.79/1.36  % SZS output start Proof for theBenchmark
% See solution above
% 2.79/1.36  % (3634455)------------------------------
% 2.79/1.36  % (3634455)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.79/1.36  % (3634455)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.79/1.36  % (3634455)CaDiCaL version: 2.1.3
% 2.79/1.36  % (3634455)Termination reason: Refutation
% 2.79/1.36  % (3634455)Time elapsed: 0.003 s
% 2.79/1.36  % (3634455)Peak memory usage: 89 MB
% 2.79/1.36  % (3634455)Instructions burned: 4 (million)
% 2.79/1.36  % (3634455)------------------------------
% 2.79/1.36  % (3634455)------------------------------
% 2.79/1.36  % (3634445)Success in time 0.311 s
% 2.79/1.36  % Vampire exiting
%------------------------------------------------------------------------------