↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n009.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:12 PM UTC 2026

% Result   : Theorem 3.61s 1.48s
% Output   : Refutation 3.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   32 (   7 unt;   0 def)
%            Number of atoms       :   97 (  16 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  112 (  47   ~;  36   |;  19   &)
%                                         (   1 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   56 (  50   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( smaller_or_equal(X0,X1)
    <=> ( smaller(X0,X1)
        | X0 = X1 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_smaller_or_equal) ).

fof(f7,axiom,
    ! [X0,X1,X2] :
      ( organization(X0)
     => ( ( ( greater(stock_of_knowledge(X0,X2),stock_of_knowledge(X0,X1))
            & smaller_or_equal(internal_friction(X0,X2),internal_friction(X0,X1)) )
         => greater(capability(X0,X2),capability(X0,X1)) )
        & ( ( smaller_or_equal(stock_of_knowledge(X0,X2),stock_of_knowledge(X0,X1))
            & greater(internal_friction(X0,X2),internal_friction(X0,X1)) )
         => smaller(capability(X0,X2),capability(X0,X1)) )
        & ( ( stock_of_knowledge(X0,X2) = stock_of_knowledge(X0,X1)
            & internal_friction(X0,X2) = internal_friction(X0,X1) )
         => capability(X0,X2) = capability(X0,X1) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_5) ).

fof(f8,axiom,
    ! [X0,X1,X2] :
      ( ( organization(X0)
        & greater(age(X0,X2),age(X0,X1)) )
     => greater(stock_of_knowledge(X0,X2),stock_of_knowledge(X0,X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_7) ).

fof(f9,axiom,
    ! [X0,X1,X2] :
      ( organization(X0)
     => internal_friction(X0,X2) = internal_friction(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_9) ).

fof(f10,conjecture,
    ! [X0,X1,X2] :
      ( ( organization(X0)
        & greater(age(X0,X2),age(X0,X1)) )
     => greater(capability(X0,X2),capability(X0,X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_3) ).

fof(f11,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ( organization(X0)
          & greater(age(X0,X2),age(X0,X1)) )
       => greater(capability(X0,X2),capability(X0,X1)) ),
    inference(negated_conjecture,[status(cth)],[f10]) ).

fof(f12,plain,
    ! [X0,X1] :
      ( ( smaller(X0,X1)
        | X0 = X1 )
     => smaller_or_equal(X0,X1) ),
    inference(unused_predicate_definition_removal,[],[f1]) ).

fof(f13,plain,
    ? [X0,X1,X2] :
      ( ~ greater(capability(X0,X2),capability(X0,X1))
      & organization(X0)
      & greater(age(X0,X2),age(X0,X1)) ),
    inference(ennf_transformation,[],[f11]) ).

fof(f14,plain,
    ? [X0,X1,X2] :
      ( ~ greater(capability(X0,X2),capability(X0,X1))
      & organization(X0)
      & greater(age(X0,X2),age(X0,X1)) ),
    inference(flattening,[],[f13]) ).

fof(f15,plain,
    ! [X0,X1,X2] :
      ( ( ( greater(capability(X0,X2),capability(X0,X1))
          | ~ greater(stock_of_knowledge(X0,X2),stock_of_knowledge(X0,X1))
          | ~ smaller_or_equal(internal_friction(X0,X2),internal_friction(X0,X1)) )
        & ( smaller(capability(X0,X2),capability(X0,X1))
          | ~ smaller_or_equal(stock_of_knowledge(X0,X2),stock_of_knowledge(X0,X1))
          | ~ greater(internal_friction(X0,X2),internal_friction(X0,X1)) )
        & ( capability(X0,X2) = capability(X0,X1)
          | stock_of_knowledge(X0,X2) != stock_of_knowledge(X0,X1)
          | internal_friction(X0,X2) != internal_friction(X0,X1) ) )
      | ~ organization(X0) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f16,plain,
    ! [X0,X1,X2] :
      ( ( ( greater(capability(X0,X2),capability(X0,X1))
          | ~ greater(stock_of_knowledge(X0,X2),stock_of_knowledge(X0,X1))
          | ~ smaller_or_equal(internal_friction(X0,X2),internal_friction(X0,X1)) )
        & ( smaller(capability(X0,X2),capability(X0,X1))
          | ~ smaller_or_equal(stock_of_knowledge(X0,X2),stock_of_knowledge(X0,X1))
          | ~ greater(internal_friction(X0,X2),internal_friction(X0,X1)) )
        & ( capability(X0,X2) = capability(X0,X1)
          | stock_of_knowledge(X0,X2) != stock_of_knowledge(X0,X1)
          | internal_friction(X0,X2) != internal_friction(X0,X1) ) )
      | ~ organization(X0) ),
    inference(flattening,[],[f15]) ).

fof(f17,plain,
    ! [X0,X1,X2] :
      ( greater(stock_of_knowledge(X0,X2),stock_of_knowledge(X0,X1))
      | ~ organization(X0)
      | ~ greater(age(X0,X2),age(X0,X1)) ),
    inference(ennf_transformation,[],[f8]) ).

fof(f18,plain,
    ! [X0,X1,X2] :
      ( greater(stock_of_knowledge(X0,X2),stock_of_knowledge(X0,X1))
      | ~ organization(X0)
      | ~ greater(age(X0,X2),age(X0,X1)) ),
    inference(flattening,[],[f17]) ).

fof(f22,plain,
    ! [X0,X1] :
      ( smaller_or_equal(X0,X1)
      | ( ~ smaller(X0,X1)
        & X0 != X1 ) ),
    inference(ennf_transformation,[],[f12]) ).

fof(f23,plain,
    ! [X0,X1,X2] :
      ( internal_friction(X0,X2) = internal_friction(X0,X1)
      | ~ organization(X0) ),
    inference(ennf_transformation,[],[f9]) ).

fof(f24,plain,
    ( ~ greater(capability(sK0,sK2),capability(sK0,sK1))
    & organization(sK0)
    & greater(age(sK0,sK2),age(sK0,sK1)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f14]) ).

fof(f26,plain,
    greater(age(sK0,sK2),age(sK0,sK1)),
    inference(cnf_transformation,[],[f24]) ).

fof(f27,plain,
    organization(sK0),
    inference(cnf_transformation,[],[f24]) ).

fof(f28,plain,
    ~ greater(capability(sK0,sK2),capability(sK0,sK1)),
    inference(cnf_transformation,[],[f24]) ).

fof(f31,plain,
    ! [X2,X0,X1] :
      ( greater(capability(X0,X2),capability(X0,X1))
      | ~ greater(stock_of_knowledge(X0,X2),stock_of_knowledge(X0,X1))
      | ~ smaller_or_equal(internal_friction(X0,X2),internal_friction(X0,X1))
      | ~ organization(X0) ),
    inference(cnf_transformation,[],[f16]) ).

fof(f32,plain,
    ! [X2,X0,X1] :
      ( greater(stock_of_knowledge(X0,X2),stock_of_knowledge(X0,X1))
      | ~ organization(X0)
      | ~ greater(age(X0,X2),age(X0,X1)) ),
    inference(cnf_transformation,[],[f18]) ).

fof(f35,plain,
    ! [X0,X1] :
      ( smaller_or_equal(X0,X1)
      | X0 != X1 ),
    inference(cnf_transformation,[],[f22]) ).

fof(f37,plain,
    ! [X2,X0,X1] :
      ( internal_friction(X0,X2) = internal_friction(X0,X1)
      | ~ organization(X0) ),
    inference(cnf_transformation,[],[f23]) ).

fof(f41,plain,
    ! [X1] : smaller_or_equal(X1,X1),
    inference(equality_resolution,[],[f35]) ).

fof(f108,plain,
    ( ~ greater(stock_of_knowledge(sK0,sK2),stock_of_knowledge(sK0,sK1))
    | ~ smaller_or_equal(internal_friction(sK0,sK2),internal_friction(sK0,sK1))
    | ~ organization(sK0) ),
    inference(resolution,[],[f31,f28]) ).

fof(f119,plain,
    ( ~ greater(stock_of_knowledge(sK0,sK2),stock_of_knowledge(sK0,sK1))
    | ~ smaller_or_equal(internal_friction(sK0,sK2),internal_friction(sK0,sK1)) ),
    inference(forward_subsumption_resolution,[],[f108,f27]) ).

fof(f126,plain,
    ( ~ smaller_or_equal(internal_friction(sK0,sK2),internal_friction(sK0,sK1))
    | ~ organization(sK0)
    | ~ greater(age(sK0,sK2),age(sK0,sK1)) ),
    inference(resolution,[],[f119,f32]) ).

fof(f130,plain,
    ( ~ smaller_or_equal(internal_friction(sK0,sK2),internal_friction(sK0,sK1))
    | ~ greater(age(sK0,sK2),age(sK0,sK1)) ),
    inference(forward_subsumption_resolution,[],[f126,f27]) ).

fof(f131,plain,
    ~ smaller_or_equal(internal_friction(sK0,sK2),internal_friction(sK0,sK1)),
    inference(forward_subsumption_resolution,[],[f130,f26]) ).

fof(f136,plain,
    ! [X0] :
      ( ~ smaller_or_equal(internal_friction(sK0,sK2),internal_friction(sK0,X0))
      | ~ organization(sK0) ),
    inference(superposition,[],[f131,f37]) ).

fof(f137,plain,
    ! [X0] : ~ smaller_or_equal(internal_friction(sK0,sK2),internal_friction(sK0,X0)),
    inference(forward_subsumption_resolution,[],[f136,f27]) ).

fof(f156,plain,
    $false,
    inference(resolution,[],[f137,f41]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MGT044+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38  % Computer : n009.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sun Sep 27 17:26:45 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41  Running first-order theorem proving
% 0.11/0.41  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
% 3.61/1.47  % (2271465)Detected formulas, will run a generic FOF schedule.
% 3.61/1.47  % (2271471)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=38242097:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.61/1.47  % (2271470)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=1318028945:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.61/1.47  % (2271472)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=1918345956:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.61/1.47  % (2271474)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2787440814:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.61/1.47  % (2271473)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2738137229:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.61/1.48  % (2271476)dis-21_1_sil=8000:lcm=predicate:random_seed=3928490844: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.61/1.48  % (2271475)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3833933961:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.61/1.48  % (2271473)Refutation not found, incomplete strategy
% 3.61/1.48  % (2271473)------------------------------
% 3.61/1.48  % (2271473)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.61/1.48  % (2271473)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.61/1.48  % (2271473)CaDiCaL version: 2.1.3
% 3.61/1.48  % (2271473)Termination reason: Refutation not found, incomplete strategy
% 3.61/1.48  % (2271473)Time elapsed: 0.001 s
% 3.61/1.48  % (2271473)Peak memory usage: 88 MB
% 3.61/1.48  % (2271474)First to succeed.
% 3.61/1.48  % (2271475)Also succeeded, but the first one will report.
% 3.61/1.48  % (2271474)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2271465"
% 3.61/1.48  % (2271476)Instruction limit reached! 
% 3.61/1.48  % (2271476)------------------------------
% 3.61/1.48  % (2271476)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.61/1.48  % (2271476)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.61/1.48  % (2271476)CaDiCaL version: 2.1.3
% 3.61/1.48  % (2271476)Termination reason: Instruction limit
% 3.61/1.48  % (2271476)Termination phase: Saturation
% 3.61/1.48  % (2271476)Time elapsed: 0.048 s
% 3.61/1.48  % (2271476)Peak memory usage: 88 MB
% 3.61/1.48  % (2271476)Instructions burned: 130 (million)
% 3.61/1.48  % (2271484)lrs+10_1_sil=8000:sp=occurrence:random_seed=408456954:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.61/1.48  % (2271484)Also succeeded, but the first one will report.
% 3.61/1.48  % (2271473)------------------------------
% 3.61/1.48  % (2271473)------------------------------
% 3.61/1.48  % (2271474)Refutation found. Thanks to Tanya!
% 3.61/1.48  % SZS status Theorem for theBenchmark
% 3.61/1.48  % SZS output start Proof for theBenchmark
% See solution above
% 3.61/1.48  % (2271474)------------------------------
% 3.61/1.48  % (2271474)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.61/1.48  % (2271474)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.61/1.48  % (2271474)CaDiCaL version: 2.1.3
% 3.61/1.48  % (2271474)Termination reason: Refutation
% 3.61/1.48  % (2271474)Time elapsed: 0.005 s
% 3.61/1.48  % (2271474)Peak memory usage: 88 MB
% 3.61/1.48  % (2271474)Instructions burned: 5 (million)
% 3.61/1.48  % (2271474)------------------------------
% 3.61/1.48  % (2271474)------------------------------
% 3.61/1.48  % (2271465)Success in time 0.43 s
% 3.61/1.48  % Vampire exiting
%------------------------------------------------------------------------------