↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : MGT092+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/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:22 PM UTC 2026

% Result   : Theorem 2.63s 1.35s
% Output   : Refutation 2.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   31 (  13 unt;   0 def)
%            Number of atoms       :   69 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   81 (  43   ~;  31   |;   4   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-4 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   35 (  35   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [X0,X1,X2] :
      ( ( less(X0,X1)
        & less(X1,X2) )
     => less(X0,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitive) ).

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

fof(f13,axiom,
    ! [X0,X1,X2,X3] :
      ( ( leq(X2,X0)
        & leq(X0,X3)
        & less(X0,X1)
        & leq(X1,X3) )
     => completion_conflict(X0,X1,X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sharpness_conflict) ).

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

fof(f39,axiom,
    less(v400,v800),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v400_v800) ).

fof(f40,axiom,
    less(v800,v1200),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v800_v1200) ).

fof(f42,conjecture,
    completion_conflict(v400,v800,v0,v1200),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl633) ).

fof(f43,negated_conjecture,
    ~ completion_conflict(v400,v800,v0,v1200),
    inference(negated_conjecture,[status(cth)],[f42]) ).

fof(f44,plain,
    ~ completion_conflict(v400,v800,v0,v1200),
    inference(flattening,[],[f43]) ).

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

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

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

fof(f54,plain,
    ! [X0,X1,X2] :
      ( less(X0,X2)
      | ~ less(X0,X1)
      | ~ less(X1,X2) ),
    inference(flattening,[],[f53]) ).

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

fof(f66,plain,
    ~ completion_conflict(v400,v800,v0,v1200),
    inference(cnf_transformation,[],[f44]) ).

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

fof(f75,plain,
    less(v0,v400),
    inference(cnf_transformation,[],[f38]) ).

fof(f76,plain,
    less(v400,v800),
    inference(cnf_transformation,[],[f39]) ).

fof(f77,plain,
    less(v800,v1200),
    inference(cnf_transformation,[],[f40]) ).

fof(f78,plain,
    ! [X2,X0,X1] :
      ( less(X0,X2)
      | ~ less(X0,X1)
      | ~ less(X1,X2) ),
    inference(cnf_transformation,[],[f54]) ).

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

fof(f141,plain,
    ( ~ leq(v0,v400)
    | ~ leq(v400,v1200)
    | ~ less(v400,v800)
    | ~ leq(v800,v1200) ),
    inference(resolution,[],[f67,f66]) ).

fof(f142,plain,
    ( ~ leq(v800,v1200)
    | ~ leq(v400,v1200)
    | ~ leq(v0,v400) ),
    inference(forward_subsumption_resolution,[],[f141,f76]) ).

fof(f144,plain,
    ( ~ leq(v400,v1200)
    | ~ leq(v0,v400)
    | ~ less(v800,v1200) ),
    inference(resolution,[],[f142,f83]) ).

fof(f145,plain,
    ( ~ leq(v400,v1200)
    | ~ leq(v0,v400) ),
    inference(forward_subsumption_resolution,[],[f144,f77]) ).

fof(f147,plain,
    ( ~ leq(v0,v400)
    | ~ less(v400,v1200) ),
    inference(resolution,[],[f145,f83]) ).

fof(f149,plain,
    ( ~ less(v400,v1200)
    | ~ less(v0,v400) ),
    inference(resolution,[],[f147,f83]) ).

fof(f150,plain,
    ~ less(v400,v1200),
    inference(forward_subsumption_resolution,[],[f149,f75]) ).

fof(f162,plain,
    ! [X0] :
      ( ~ less(v400,X0)
      | ~ less(X0,v1200) ),
    inference(resolution,[],[f150,f78]) ).

fof(f190,plain,
    ~ less(v800,v1200),
    inference(resolution,[],[f162,f76]) ).

fof(f196,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f190,f77]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT092+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.38  % Computer : n020.cluster.edu
% 0.13/0.38  % Model    : x86_64 x86_64
% 0.13/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38  % Memory   : 8046.5625MB
% 0.13/0.38  % OS       : Linux 6.8.0-71-generic
% 0.13/0.38  % CPULimit : 300
% 0.13/0.38  % WCLimit  : 300
% 0.13/0.38  % DateTime : Sun Sep 27 17:37:19 UTC 2026
% 0.13/0.38  % CPUTime  : 
% 0.13/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.42  Running first-order theorem proving
% 0.13/0.42  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.63/1.35  % (3637850)Detected formulas, will run a generic FOF schedule.
% 2.63/1.35  % (3637859)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3159038358:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.63/1.35  % (3637859)First to succeed.
% 2.63/1.35  % (3637859)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3637850"
% 2.63/1.35  % (3637857)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=744127134:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.63/1.35  % (3637855)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=4057507972:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.63/1.35  % (3637861)dis-21_1_sil=8000:lcm=predicate:random_seed=3119990668: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.63/1.35  % (3637856)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=387141622:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.63/1.35  % (3637858)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=905756756:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.63/1.35  % (3637860)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=848548347:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.63/1.35  % (3637858)Refutation not found, incomplete strategy
% 2.63/1.35  % (3637858)------------------------------
% 2.63/1.35  % (3637858)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.63/1.35  % (3637858)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.63/1.35  % (3637858)CaDiCaL version: 2.1.3
% 2.63/1.35  % (3637858)Termination reason: Refutation not found, incomplete strategy
% 2.63/1.35  % (3637858)Time elapsed: 0.001 s
% 2.63/1.35  % (3637858)Peak memory usage: 87 MB
% 2.63/1.35  % (3637860)Also succeeded, but the first one will report.
% 2.63/1.35  % (3637861)Also succeeded, but the first one will report.
% 2.63/1.35  % (3637859)Refutation found. Thanks to Tanya!
% 2.63/1.35  % SZS status Theorem for theBenchmark
% 2.63/1.35  % SZS output start Proof for theBenchmark
% See solution above
% 2.63/1.35  % (3637859)------------------------------
% 2.63/1.35  % (3637859)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.63/1.35  % (3637859)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.63/1.35  % (3637859)CaDiCaL version: 2.1.3
% 2.63/1.35  % (3637859)Termination reason: Refutation
% 2.63/1.35  % (3637859)Time elapsed: 0.002 s
% 2.63/1.35  % (3637859)Peak memory usage: 88 MB
% 2.63/1.35  % (3637859)Instructions burned: 4 (million)
% 2.63/1.35  % (3637859)------------------------------
% 2.63/1.35  % (3637859)------------------------------
% 2.63/1.35  % (3637850)Success in time 0.289 s
% 2.63/1.35  % Vampire exiting
%------------------------------------------------------------------------------