↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : MGT078+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 : 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:02:20 PM UTC 2026

% Result   : Theorem 3.51s 1.48s
% Output   : Refutation 3.51s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   28 (  10 unt;   0 def)
%            Number of atoms       :   73 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   70 (  25   ~;  16   |;  25   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;  10 con; 0-0 aty)
%            Number of variables   :   50 (  41   !;   9   ?)

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

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

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(f54,axiom,
    less(v600,v1200),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v600_v1200) ).

fof(f57,conjecture,
    ~ ? [X0,X1,X2] :
        ( in_lopen(X0,v0,v600)
        & leq(v1200,X0)
        & in_lopen(X1,v0,v800)
        & leq(v200,X1)
        & in_lopen(X2,v0,v32)
        & leq(v8,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl341) ).

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

fof(f59,plain,
    ? [X0,X1,X2] :
      ( in_lopen(X0,v0,v600)
      & leq(v1200,X0)
      & in_lopen(X1,v0,v800)
      & leq(v200,X1)
      & in_lopen(X2,v0,v32)
      & leq(v8,X2) ),
    inference(flattening,[],[f58]) ).

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

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

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

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

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

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

fof(f73,plain,
    ( in_lopen(sK0,v0,v600)
    & leq(v1200,sK0)
    & in_lopen(sK1,v0,v800)
    & leq(v200,sK1)
    & in_lopen(sK2,v0,v32)
    & leq(v8,sK2) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f59]) ).

fof(f80,plain,
    leq(v1200,sK0),
    inference(cnf_transformation,[],[f73]) ).

fof(f81,plain,
    in_lopen(sK0,v0,v600),
    inference(cnf_transformation,[],[f73]) ).

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

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

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

fof(f131,plain,
    less(v600,v1200),
    inference(cnf_transformation,[],[f54]) ).

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

fof(f140,plain,
    leq(sK0,v600),
    inference(resolution,[],[f90,f81]) ).

fof(f144,plain,
    ! [X0,X1] :
      ( ~ leq(X1,X0)
      | ~ less(X0,X1) ),
    inference(resolution,[],[f83,f135]) ).

fof(f176,plain,
    ~ less(sK0,v1200),
    inference(resolution,[],[f144,f80]) ).

fof(f193,plain,
    ! [X0] :
      ( ~ leq(sK0,X0)
      | ~ less(X0,v1200) ),
    inference(resolution,[],[f176,f84]) ).

fof(f367,plain,
    ~ less(v600,v1200),
    inference(resolution,[],[f193,f140]) ).

fof(f371,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f367,f131]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT078+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.39  % Computer : n007.cluster.edu
% 0.13/0.39  % Model    : x86_64 x86_64
% 0.13/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39  % Memory   : 8046.5625MB
% 0.13/0.39  % OS       : Linux 6.8.0-71-generic
% 0.13/0.39  % CPULimit : 300
% 0.13/0.39  % WCLimit  : 300
% 0.13/0.39  % DateTime : Sun Sep 27 17:32:26 UTC 2026
% 0.13/0.40  % CPUTime  : 
% 0.13/0.40  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.43  Running first-order theorem proving
% 0.13/0.43  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
% 3.51/1.48  % (1681281)Detected formulas, will run a generic FOF schedule.
% 3.51/1.48  % (1681287)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=2610732439:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.51/1.48  % (1681289)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=385825307:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.51/1.48  % (1681286)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=3780408605:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.51/1.48  % (1681292)dis-21_1_sil=8000:lcm=predicate:random_seed=146305566: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)
% 3.51/1.48  % (1681288)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=886012676:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.51/1.48  % (1681290)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1907422299:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.51/1.48  % (1681290)First to succeed.
% 3.51/1.48  % (1681290)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1681281"
% 3.51/1.48  % (1681289)Refutation not found, incomplete strategy
% 3.51/1.48  % (1681289)------------------------------
% 3.51/1.48  % (1681289)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.51/1.48  % (1681289)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.51/1.48  % (1681289)CaDiCaL version: 2.1.3
% 3.51/1.48  % (1681289)Termination reason: Refutation not found, incomplete strategy
% 3.51/1.48  % (1681289)Time elapsed: 0.007 s
% 3.51/1.48  % (1681289)Peak memory usage: 88 MB
% 3.51/1.48  % (1681289)Instructions burned: 8 (million)
% 3.51/1.48  % (1681292)Also succeeded, but the first one will report.
% 3.51/1.48  % (1681291)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2405361453:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.51/1.48  % (1681291)Also succeeded, but the first one will report.
% 3.51/1.48  % (1681289)------------------------------
% 3.51/1.48  % (1681289)------------------------------
% 3.51/1.48  % (1681290)Refutation found. Thanks to Tanya!
% 3.51/1.48  % SZS status Theorem for theBenchmark
% 3.51/1.48  % SZS output start Proof for theBenchmark
% See solution above
% 3.51/1.48  % (1681290)------------------------------
% 3.51/1.48  % (1681290)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.51/1.48  % (1681290)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.51/1.48  % (1681290)CaDiCaL version: 2.1.3
% 3.51/1.48  % (1681290)Termination reason: Refutation
% 3.51/1.48  % (1681290)Time elapsed: 0.007 s
% 3.51/1.48  % (1681290)Peak memory usage: 88 MB
% 3.51/1.48  % (1681290)Instructions burned: 9 (million)
% 3.51/1.48  % (1681290)------------------------------
% 3.51/1.48  % (1681290)------------------------------
% 3.51/1.48  % (1681281)Success in time 0.416 s
% 3.51/1.48  % Vampire exiting
%------------------------------------------------------------------------------