↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n017.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:21 PM UTC 2026

% Result   : Theorem 2.61s 1.39s
% Output   : Refutation 2.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   42 (  11 unt;   0 def)
%            Number of atoms       :  127 (   6 equ)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :  158 (  73   ~;  62   |;  19   &)
%                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   70 (  66   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : ~ less(X0,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',irreflexive) ).

fof(f4,axiom,
    ! [X0,X1] :
      ( leq(X0,X1)
    <=> ( less(X0,X1)
        | X0 = X1 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_def) ).

fof(f6,axiom,
    ! [X0,X1] :
      ( less(X0,X1)
     => leq(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_implies_leq) ).

fof(f8,axiom,
    ! [X0,X1,X2] :
      ( ( less(X0,X1)
        & leq(X1,X2) )
     => less(X0,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_leq_trans) ).

fof(f11,axiom,
    ! [X0,X1,X2] :
      ( in_lopen(X0,X1,X2)
    <=> ( less(X1,X0)
        & leq(X0,X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',in_lopen) ).

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

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

fof(f42,axiom,
    less(v600,v800),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v600_v800) ).

fof(f44,conjecture,
    ? [X0,X1] :
      ( leq(v800,X0)
      & in_lopen(X1,v0,v200)
      & ( ( in_lopen(X0,v0,v600)
          & ~ in_lopen(X1,v0,v400) )
        | ( ~ in_lopen(X0,v0,v600)
          & in_lopen(X1,v0,v400) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl462) ).

fof(f45,negated_conjecture,
    ~ ? [X0,X1] :
        ( leq(v800,X0)
        & in_lopen(X1,v0,v200)
        & ( ( in_lopen(X0,v0,v600)
            & ~ in_lopen(X1,v0,v400) )
          | ( ~ in_lopen(X0,v0,v600)
            & in_lopen(X1,v0,v400) ) ) ),
    inference(negated_conjecture,[status(cth)],[f44]) ).

fof(f46,plain,
    ! [X0,X1] :
      ( ~ leq(v800,X0)
      | ~ in_lopen(X1,v0,v200)
      | ( ( ~ in_lopen(X0,v0,v600)
          | in_lopen(X1,v0,v400) )
        & ( in_lopen(X0,v0,v600)
          | ~ in_lopen(X1,v0,v400) ) ) ),
    inference(ennf_transformation,[],[f45]) ).

fof(f49,plain,
    ! [X0,X1,X2] :
      ( less(X0,X2)
      | ~ less(X0,X1)
      | ~ leq(X1,X2) ),
    inference(ennf_transformation,[],[f8]) ).

fof(f50,plain,
    ! [X0,X1,X2] :
      ( less(X0,X2)
      | ~ less(X0,X1)
      | ~ leq(X1,X2) ),
    inference(flattening,[],[f49]) ).

fof(f53,plain,
    ! [X0,X1] :
      ( leq(X0,X1)
      | ~ less(X0,X1) ),
    inference(ennf_transformation,[],[f6]) ).

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

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

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

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

fof(f62,plain,
    ! [X0,X1] :
      ( in_lopen(X0,v0,v600)
      | ~ in_lopen(X1,v0,v200)
      | ~ leq(v800,X0)
      | ~ in_lopen(X1,v0,v400) ),
    inference(cnf_transformation,[],[f46]) ).

fof(f65,plain,
    ! [X2,X0,X1] :
      ( less(X0,X2)
      | ~ less(X0,X1)
      | ~ leq(X1,X2) ),
    inference(cnf_transformation,[],[f50]) ).

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

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

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

fof(f73,plain,
    ! [X2,X0,X1] :
      ( ~ in_lopen(X0,X1,X2)
      | less(X1,X0) ),
    inference(cnf_transformation,[],[f61]) ).

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

fof(f88,plain,
    less(v0,v200),
    inference(cnf_transformation,[],[f33]) ).

fof(f91,plain,
    less(v200,v400),
    inference(cnf_transformation,[],[f37]) ).

fof(f94,plain,
    less(v600,v800),
    inference(cnf_transformation,[],[f42]) ).

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

fof(f98,plain,
    ! [X1] : leq(X1,X1),
    inference(equality_resolution,[],[f70]) ).

fof(f99,plain,
    ! [X0,X1] :
      ( ~ in_lopen(X1,v0,v400)
      | ~ in_lopen(X1,v0,v200)
      | ~ leq(v800,X0)
      | leq(X0,v600) ),
    inference(resolution,[],[f72,f62]) ).

fof(f111,plain,
    ! [X0,X1] :
      ( ~ leq(X1,X0)
      | ~ less(X0,X1) ),
    inference(resolution,[],[f65,f96]) ).

fof(f171,plain,
    ! [X0,X1] :
      ( ~ less(v0,X0)
      | ~ leq(X0,v400)
      | ~ in_lopen(X0,v0,v200)
      | ~ leq(v800,X1)
      | leq(X1,v600) ),
    inference(resolution,[],[f74,f99]) ).

fof(f175,plain,
    ! [X0,X1] :
      ( ~ in_lopen(X0,v0,v200)
      | ~ leq(X0,v400)
      | ~ leq(v800,X1)
      | leq(X1,v600) ),
    inference(forward_subsumption_resolution,[],[f171,f73]) ).

fof(f178,plain,
    ! [X0,X1] :
      ( leq(X1,v600)
      | ~ leq(v800,X1)
      | ~ leq(X0,v400)
      | ~ less(v0,X0)
      | ~ leq(X0,v200) ),
    inference(resolution,[],[f175,f74]) ).

fof(f189,plain,
    ! [X0,X1] :
      ( ~ leq(v800,X0)
      | ~ leq(X1,v400)
      | ~ less(v0,X1)
      | ~ leq(X1,v200)
      | ~ less(v600,X0) ),
    inference(resolution,[],[f178,f111]) ).

fof(f200,plain,
    ! [X0] :
      ( ~ leq(X0,v400)
      | ~ less(v0,X0)
      | ~ leq(X0,v200)
      | ~ less(v600,v800) ),
    inference(resolution,[],[f189,f98]) ).

fof(f208,plain,
    ! [X0] :
      ( ~ leq(X0,v400)
      | ~ less(v0,X0)
      | ~ leq(X0,v200) ),
    inference(forward_subsumption_resolution,[],[f200,f94]) ).

fof(f223,plain,
    ! [X0] :
      ( ~ leq(X0,v200)
      | ~ less(v0,X0)
      | ~ less(X0,v400) ),
    inference(resolution,[],[f208,f67]) ).

fof(f325,plain,
    ( ~ less(v0,v200)
    | ~ less(v200,v400) ),
    inference(resolution,[],[f223,f98]) ).

fof(f328,plain,
    ~ less(v200,v400),
    inference(forward_subsumption_resolution,[],[f325,f88]) ).

fof(f329,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f328,f91]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT086+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.43  % Computer : n017.cluster.edu
% 0.13/0.43  % Model    : x86_64 x86_64
% 0.13/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.43  % Memory   : 8046.5625MB
% 0.13/0.43  % OS       : Linux 6.8.0-71-generic
% 0.13/0.43  % CPULimit : 300
% 0.13/0.43  % WCLimit  : 300
% 0.13/0.43  % DateTime : Sun Sep 27 17:30:36 UTC 2026
% 0.13/0.43  % CPUTime  : 
% 0.13/0.43  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.47  Running first-order theorem proving
% 0.17/0.47  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.61/1.39  % (2827214)Detected formulas, will run a generic FOF schedule.
% 2.61/1.39  % (2827223)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4030404194:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.61/1.39  % (2827223)First to succeed.
% 2.61/1.39  % (2827223)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2827214"
% 2.61/1.39  % (2827219)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=2782704458:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.61/1.39  % (2827221)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=2568775940:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.61/1.39  % (2827220)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=2127933312:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.61/1.39  % (2827222)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3084350446:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.61/1.39  % (2827225)dis-21_1_sil=8000:lcm=predicate:random_seed=277541919: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.61/1.39  % (2827222)Refutation not found, incomplete strategy
% 2.61/1.39  % (2827222)------------------------------
% 2.61/1.39  % (2827222)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.61/1.39  % (2827222)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.61/1.39  % (2827222)CaDiCaL version: 2.1.3
% 2.61/1.39  % (2827222)Termination reason: Refutation not found, incomplete strategy
% 2.61/1.39  % (2827222)Time elapsed: 0.002 s
% 2.61/1.39  % (2827222)Peak memory usage: 88 MB
% 2.61/1.39  % (2827222)Instructions burned: 2 (million)
% 2.61/1.39  % (2827225)Also succeeded, but the first one will report.
% 2.61/1.39  % (2827224)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=446772252:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.61/1.39  % (2827224)Also succeeded, but the first one will report.
% 2.61/1.39  % (2827223)Refutation found. Thanks to Tanya!
% 2.61/1.39  % SZS status Theorem for theBenchmark
% 2.61/1.39  % SZS output start Proof for theBenchmark
% See solution above
% 2.61/1.40  % (2827223)------------------------------
% 2.61/1.40  % (2827223)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.61/1.40  % (2827223)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.61/1.40  % (2827223)CaDiCaL version: 2.1.3
% 2.61/1.40  % (2827223)Termination reason: Refutation
% 2.61/1.40  % (2827223)Time elapsed: 0.004 s
% 2.61/1.40  % (2827223)Peak memory usage: 88 MB
% 2.61/1.40  % (2827223)Instructions burned: 10 (million)
% 2.61/1.40  % (2827223)------------------------------
% 2.61/1.40  % (2827223)------------------------------
% 2.61/1.40  % (2827214)Success in time 0.294 s
% 2.61/1.40  % Vampire exiting
%------------------------------------------------------------------------------