↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : MGT011-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 : n004.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:01:59 PM UTC 2026

% Result   : Unsatisfiable 3.51s 1.38s
% Output   : Refutation 3.51s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   65 (  18 unt;   4 def)
%            Number of atoms       :  184 (   8 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :  242 ( 123   ~; 115   |;   0   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   12 (  10 usr;   5 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   73 (   0 sgn  73   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( inertia(X0,sk1(X1,X0),X1)
      | ~ organization(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp5_20) ).

fof(f3,axiom,
    ! [X0,X1] :
      ( ~ greater(X1,X0)
      | ~ greater(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp6_2_22) ).

fof(f4,axiom,
    ! [X0,X1] :
      ( class(X0,sk2(X1,X0),X1)
      | ~ organization(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp9_23) ).

fof(f5,axiom,
    ! [X2,X3,X0,X1,X4] :
      ( ~ reorganization_free(X0,X1,X2)
      | ~ organization(X0,X2)
      | ~ organization(X0,X1)
      | ~ class(X0,X3,X1)
      | ~ class(X0,X4,X2)
      | X3 = X4 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp10_24) ).

fof(f6,axiom,
    ! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
      ( ~ size(X2,X6,X3)
      | ~ organization(X2,X3)
      | ~ class(X0,X4,X1)
      | ~ class(X2,X4,X3)
      | ~ size(X0,X5,X1)
      | ~ organization(X0,X1)
      | ~ inertia(X0,X7,X1)
      | ~ inertia(X2,X8,X3)
      | ~ greater(X6,X5)
      | greater(X8,X7) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a5_FOL_25) ).

fof(f7,axiom,
    ! [X2,X3,X0,X1,X4] :
      ( ~ reorganization_free(X0,X1,X2)
      | ~ organization(X0,X2)
      | ~ organization(X0,X1)
      | ~ inertia(X0,X3,X1)
      | ~ inertia(X0,X4,X2)
      | ~ greater(X2,X1)
      | greater(X4,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL_26) ).

fof(f8,negated_conjecture,
    organization(sk3,sk6),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t11_FOL_27) ).

fof(f9,negated_conjecture,
    organization(sk3,sk7),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t11_FOL_28) ).

fof(f10,negated_conjecture,
    reorganization_free(sk3,sk6,sk7),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t11_FOL_29) ).

fof(f11,negated_conjecture,
    size(sk3,sk4,sk6),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t11_FOL_30) ).

fof(f12,negated_conjecture,
    size(sk3,sk5,sk7),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t11_FOL_31) ).

fof(f13,negated_conjecture,
    greater(sk7,sk6),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t11_FOL_32) ).

fof(f14,negated_conjecture,
    greater(sk4,sk5),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t11_FOL_33) ).

fof(f18,plain,
    ! [X0,X1] :
      ( ~ organization(sk3,sk7)
      | ~ organization(sk3,sk6)
      | ~ class(sk3,X0,sk6)
      | ~ class(sk3,X1,sk7)
      | X0 = X1 ),
    inference(resolution,[],[f5,f10]) ).

fof(f19,plain,
    ! [X0,X1] :
      ( ~ organization(sk3,sk6)
      | ~ class(sk3,X0,sk6)
      | ~ class(sk3,X1,sk7)
      | X0 = X1 ),
    inference(forward_subsumption_resolution,[],[f18,f9]) ).

fof(f20,plain,
    ! [X0,X1] :
      ( ~ class(sk3,X1,sk7)
      | ~ class(sk3,X0,sk6)
      | X0 = X1 ),
    inference(forward_subsumption_resolution,[],[f19,f8]) ).

fof(f21,plain,
    ! [X0] :
      ( ~ class(sk3,X0,sk6)
      | sk2(sk7,sk3) = X0
      | ~ organization(sk3,sk7) ),
    inference(resolution,[],[f20,f4]) ).

fof(f22,plain,
    ! [X0] :
      ( ~ class(sk3,X0,sk6)
      | sk2(sk7,sk3) = X0 ),
    inference(forward_subsumption_resolution,[],[f21,f9]) ).

fof(f23,plain,
    ! [X0,X1] :
      ( ~ organization(sk3,sk7)
      | ~ organization(sk3,sk6)
      | ~ inertia(sk3,X0,sk6)
      | ~ inertia(sk3,X1,sk7)
      | ~ greater(sk7,sk6)
      | greater(X1,X0) ),
    inference(resolution,[],[f7,f10]) ).

fof(f24,plain,
    ! [X0,X1] :
      ( ~ organization(sk3,sk6)
      | ~ inertia(sk3,X0,sk6)
      | ~ inertia(sk3,X1,sk7)
      | ~ greater(sk7,sk6)
      | greater(X1,X0) ),
    inference(forward_subsumption_resolution,[],[f23,f9]) ).

fof(f25,plain,
    ! [X0,X1] :
      ( ~ inertia(sk3,X0,sk6)
      | ~ inertia(sk3,X1,sk7)
      | ~ greater(sk7,sk6)
      | greater(X1,X0) ),
    inference(forward_subsumption_resolution,[],[f24,f8]) ).

fof(f26,plain,
    ! [X0,X1] :
      ( ~ inertia(sk3,X1,sk7)
      | ~ inertia(sk3,X0,sk6)
      | greater(X1,X0) ),
    inference(forward_subsumption_resolution,[],[f25,f13]) ).

fof(f27,plain,
    ( sk2(sk7,sk3) = sk2(sk6,sk3)
    | ~ organization(sk3,sk6) ),
    inference(resolution,[],[f22,f4]) ).

fof(f28,plain,
    sk2(sk7,sk3) = sk2(sk6,sk3),
    inference(forward_subsumption_resolution,[],[f27,f8]) ).

fof(f29,plain,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ organization(sk3,sk6)
      | ~ class(X0,X1,X2)
      | ~ class(sk3,X1,sk6)
      | ~ size(X0,X3,X2)
      | ~ organization(X0,X2)
      | ~ inertia(X0,X4,X2)
      | ~ inertia(sk3,X5,sk6)
      | ~ greater(sk4,X3)
      | greater(X5,X4) ),
    inference(resolution,[],[f6,f11]) ).

fof(f32,plain,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ size(X0,X3,X2)
      | ~ class(sk3,X1,sk6)
      | ~ class(X0,X1,X2)
      | ~ organization(X0,X2)
      | ~ inertia(X0,X4,X2)
      | ~ inertia(sk3,X5,sk6)
      | ~ greater(sk4,X3)
      | greater(X5,X4) ),
    inference(forward_subsumption_resolution,[],[f29,f8]) ).

fof(f33,plain,
    ( class(sk3,sk2(sk6,sk3),sk7)
    | ~ organization(sk3,sk7) ),
    inference(superposition,[],[f4,f28]) ).

fof(f34,plain,
    class(sk3,sk2(sk6,sk3),sk7),
    inference(forward_subsumption_resolution,[],[f33,f9]) ).

fof(f35,plain,
    ! [X0] :
      ( ~ inertia(sk3,X0,sk6)
      | greater(sk1(sk7,sk3),X0)
      | ~ organization(sk3,sk7) ),
    inference(resolution,[],[f26,f1]) ).

fof(f36,plain,
    ! [X0] :
      ( greater(sk1(sk7,sk3),X0)
      | ~ inertia(sk3,X0,sk6) ),
    inference(forward_subsumption_resolution,[],[f35,f9]) ).

fof(f42,plain,
    ! [X0] :
      ( ~ greater(X0,sk1(sk7,sk3))
      | ~ inertia(sk3,X0,sk6) ),
    inference(resolution,[],[f36,f3]) ).

fof(f44,plain,
    ! [X2,X0,X1] :
      ( ~ class(sk3,X0,sk6)
      | ~ class(sk3,X0,sk7)
      | ~ organization(sk3,sk7)
      | ~ inertia(sk3,X1,sk7)
      | ~ inertia(sk3,X2,sk6)
      | ~ greater(sk4,sk5)
      | greater(X2,X1) ),
    inference(resolution,[],[f32,f12]) ).

fof(f46,plain,
    ! [X2,X0,X1] :
      ( ~ class(sk3,X0,sk6)
      | ~ class(sk3,X0,sk7)
      | ~ inertia(sk3,X1,sk7)
      | ~ inertia(sk3,X2,sk6)
      | ~ greater(sk4,sk5)
      | greater(X2,X1) ),
    inference(forward_subsumption_resolution,[],[f44,f9]) ).

fof(f47,plain,
    ! [X2,X0,X1] :
      ( ~ class(sk3,X0,sk6)
      | ~ class(sk3,X0,sk7)
      | ~ inertia(sk3,X1,sk7)
      | ~ inertia(sk3,X2,sk6)
      | greater(X2,X1) ),
    inference(forward_subsumption_resolution,[],[f46,f14]) ).

fof(f49,definition,
    ( spl0_1
  <=> ! [X2,X1] :
        ( ~ inertia(sk3,X1,sk7)
        | ~ inertia(sk3,X2,sk6)
        | greater(X2,X1) ) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f50,plain,
    ( ! [X2,X1] :
        ( ~ inertia(sk3,X2,sk6)
        | ~ inertia(sk3,X1,sk7)
        | greater(X2,X1) )
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f49]) ).

fof(f52,definition,
    ( spl0_2
  <=> ! [X0] :
        ( ~ class(sk3,X0,sk6)
        | ~ class(sk3,X0,sk7) ) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f53,plain,
    ( ! [X0] :
        ( ~ class(sk3,X0,sk7)
        | ~ class(sk3,X0,sk6) )
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f52]) ).

fof(f54,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f47,f52,f49]) ).

fof(f55,plain,
    ( ~ class(sk3,sk2(sk6,sk3),sk6)
    | ~ spl0_2 ),
    inference(resolution,[],[f53,f34]) ).

fof(f59,plain,
    ( ~ organization(sk3,sk6)
    | ~ spl0_2 ),
    inference(resolution,[],[f55,f4]) ).

fof(f60,plain,
    ( $false
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f59,f8]) ).

fof(f61,plain,
    ~ spl0_2,
    inference(avatar_contradiction_clause,[],[f60]) ).

fof(f62,plain,
    ( ! [X0] :
        ( ~ inertia(sk3,X0,sk7)
        | greater(sk1(sk6,sk3),X0)
        | ~ organization(sk3,sk6) )
    | ~ spl0_1 ),
    inference(resolution,[],[f50,f1]) ).

fof(f63,plain,
    ( ! [X0] :
        ( greater(sk1(sk6,sk3),X0)
        | ~ inertia(sk3,X0,sk7) )
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[],[f62,f8]) ).

fof(f68,plain,
    ( ~ inertia(sk3,sk1(sk7,sk3),sk7)
    | ~ inertia(sk3,sk1(sk6,sk3),sk6)
    | ~ spl0_1 ),
    inference(resolution,[],[f63,f42]) ).

fof(f70,definition,
    ( spl0_3
  <=> inertia(sk3,sk1(sk6,sk3),sk6) ),
    introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).

fof(f72,plain,
    ( ~ inertia(sk3,sk1(sk6,sk3),sk6)
    | spl0_3 ),
    inference(avatar_component_clause,[],[f70]) ).

fof(f74,definition,
    ( spl0_4
  <=> inertia(sk3,sk1(sk7,sk3),sk7) ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f76,plain,
    ( ~ inertia(sk3,sk1(sk7,sk3),sk7)
    | spl0_4 ),
    inference(avatar_component_clause,[],[f74]) ).

fof(f77,plain,
    ( ~ spl0_3
    | ~ spl0_4
    | ~ spl0_1 ),
    inference(avatar_split_clause,[],[f68,f49,f74,f70]) ).

fof(f78,plain,
    ( ~ organization(sk3,sk6)
    | spl0_3 ),
    inference(resolution,[],[f72,f1]) ).

fof(f79,plain,
    ( $false
    | spl0_3 ),
    inference(forward_subsumption_resolution,[],[f78,f8]) ).

fof(f80,plain,
    spl0_3,
    inference(avatar_contradiction_clause,[],[f79]) ).

fof(f82,plain,
    ( ~ organization(sk3,sk7)
    | spl0_4 ),
    inference(resolution,[],[f76,f1]) ).

fof(f83,plain,
    ( $false
    | spl0_4 ),
    inference(forward_subsumption_resolution,[],[f82,f9]) ).

fof(f84,plain,
    spl0_4,
    inference(avatar_contradiction_clause,[],[f83]) ).

cnf(s1,plain,
    ( spl0_1
    | spl0_2 ),
    inference(sat_conversion,[],[f54]) ).

cnf(s2,plain,
    ~ spl0_2,
    inference(sat_conversion,[],[f61]) ).

cnf(s3,plain,
    ( ~ spl0_1
    | ~ spl0_3
    | ~ spl0_4 ),
    inference(sat_conversion,[],[f77]) ).

cnf(s4,plain,
    spl0_3,
    inference(sat_conversion,[],[f80]) ).

cnf(s5,plain,
    spl0_4,
    inference(sat_conversion,[],[f84]) ).

cnf(s6,plain,
    ~ spl0_1,
    inference(rat,[],[s3,s5,s4]) ).

cnf(s7,plain,
    $false,
    inference(rat,[],[s1,s2,s6]) ).

fof(f85,plain,
    $false,
    inference(avatar_sat_refutation,[],[s7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT011-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.38  % Computer : n004.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.39  % CPULimit : 300
% 0.10/0.39  % WCLimit  : 300
% 0.10/0.39  % DateTime : Sun Sep 27 17:16:07 UTC 2026
% 0.10/0.39  % CPUTime  : 
% 0.10/0.39  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41  Running first-order theorem proving
% 0.10/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.51/1.38  % (3767214)Input is clausal, will run a generic CNF schedule.
% 3.51/1.38  % (3767221)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3378255789:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.51/1.38  % (3767220)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=194311257:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.51/1.38  % (3767219)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=498949415:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.51/1.38  % (3767224)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3961498829:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.51/1.38  % (3767222)lrs+10_1_sil=8000:sp=occurrence:random_seed=1625976007:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.51/1.38  % (3767225)dis-21_1_sil=8000:lcm=predicate:random_seed=1891985580:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 3.51/1.38  % (3767223)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=953785164:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.51/1.38  % (3767223)Refutation not found, incomplete strategy
% 3.51/1.38  % (3767223)------------------------------
% 3.51/1.38  % (3767223)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.51/1.38  % (3767223)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.51/1.38  % (3767223)CaDiCaL version: 2.1.3
% 3.51/1.38  % (3767223)Termination reason: Refutation not found, incomplete strategy
% 3.51/1.38  % (3767223)Time elapsed: 0.001 s
% 3.51/1.38  % (3767223)Peak memory usage: 87 MB
% 3.51/1.38  % (3767222)First to succeed.
% 3.51/1.38  % (3767225)Refutation not found, incomplete strategy
% 3.51/1.38  % (3767225)------------------------------
% 3.51/1.38  % (3767225)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.51/1.38  % (3767225)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.51/1.38  % (3767225)CaDiCaL version: 2.1.3
% 3.51/1.38  % (3767225)Termination reason: Refutation not found, incomplete strategy
% 3.51/1.38  % (3767225)Time elapsed: 0.004 s
% 3.51/1.38  % (3767225)Peak memory usage: 88 MB
% 3.51/1.38  % (3767225)Instructions burned: 5 (million)
% 3.51/1.38  % (3767222)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3767214"
% 3.51/1.38  % (3767224)Also succeeded, but the first one will report.
% 3.51/1.38  % (3767225)------------------------------
% 3.51/1.38  % (3767225)------------------------------
% 3.51/1.38  % (3767223)------------------------------
% 3.51/1.38  % (3767223)------------------------------
% 3.51/1.38  % (3767222)Refutation found. Thanks to Tanya!
% 3.51/1.38  % SZS status Unsatisfiable for theBenchmark
% 3.51/1.38  % SZS output start Proof for theBenchmark
% See solution above
% 3.51/1.38  % (3767222)------------------------------
% 3.51/1.38  % (3767222)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.51/1.38  % (3767222)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.51/1.38  % (3767222)CaDiCaL version: 2.1.3
% 3.51/1.38  % (3767222)Termination reason: Refutation
% 3.51/1.38  % (3767222)Time elapsed: 0.004 s
% 3.51/1.38  % (3767222)Peak memory usage: 89 MB
% 3.51/1.38  % (3767222)Instructions burned: 4 (million)
% 3.51/1.38  % (3767222)------------------------------
% 3.51/1.38  % (3767222)------------------------------
% 3.51/1.38  % (3767214)Success in time 0.432 s
% 3.51/1.38  % Vampire exiting
%------------------------------------------------------------------------------