↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

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

% Computer : n015.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:30 PM UTC 2026

% Result   : Unsatisfiable 0.13s 0.45s
% Output   : Refutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   21
% Syntax   : Number of formulae    :   61 (  24 unt;   5 def)
%            Number of atoms       :  205 (   0 equ)
%            Maximal formula atoms :   13 (   3 avg)
%            Number of connectives :  285 ( 141   ~; 139   |;   0   &)
%                                         (   5 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   23 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   13 (  12 usr;   6 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   9 con; 0-2 aty)
%            Number of variables   :   83 (   0 sgn  83   !;   0   ?)

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

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

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

fof(f4,negated_conjecture,
    organization(sk2,sk8),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_FOL_4) ).

fof(f5,negated_conjecture,
    organization(sk3,sk8),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_FOL_5) ).

fof(f6,negated_conjecture,
    ~ organization(sk3,sk10),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_FOL_6) ).

fof(f7,negated_conjecture,
    class(sk2,sk5,sk8),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_FOL_7) ).

fof(f8,negated_conjecture,
    class(sk3,sk5,sk8),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_FOL_8) ).

fof(f9,negated_conjecture,
    reorganization(sk2,sk8,sk9),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_FOL_9) ).

fof(f10,negated_conjecture,
    reorganization(sk3,sk8,sk10),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_FOL_10) ).

fof(f11,negated_conjecture,
    reorganization_type(sk2,sk4,sk8),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_FOL_11) ).

fof(f12,negated_conjecture,
    reorganization_type(sk3,sk4,sk8),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_FOL_12) ).

fof(f13,negated_conjecture,
    complexity(sk2,sk6,sk8),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_FOL_13) ).

fof(f14,negated_conjecture,
    complexity(sk3,sk7,sk8),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_FOL_14) ).

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

fof(f16,negated_conjecture,
    ~ greater(sk9,sk10),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_FOL_16) ).

fof(f20,plain,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ complexity(X0,X1,X2)
      | ~ class(X0,X3,X2)
      | ~ class(sk3,X3,sk8)
      | ~ organization(X0,X2)
      | ~ organization(sk3,sk8)
      | ~ inertia(X0,X4,X2)
      | ~ inertia(sk3,X5,sk8)
      | ~ greater(sk7,X1)
      | greater(X5,X4) ),
    inference(resolution,[],[f2,f14]) ).

fof(f21,plain,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ complexity(X0,X1,X2)
      | ~ class(X0,X3,X2)
      | ~ class(sk3,X3,sk8)
      | ~ organization(X0,X2)
      | ~ inertia(X0,X4,X2)
      | ~ inertia(sk3,X5,sk8)
      | ~ greater(sk7,X1)
      | greater(X5,X4) ),
    inference(forward_subsumption_resolution,[],[f20,f5]) ).

fof(f28,plain,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ reorganization_type(X0,sk4,sk8)
      | organization(sk3,X1)
      | ~ class(X0,X2,sk8)
      | ~ class(sk3,X2,sk8)
      | ~ reorganization(X0,sk8,X3)
      | ~ reorganization(sk3,sk8,X1)
      | ~ organization(X0,sk8)
      | ~ organization(sk3,sk8)
      | ~ inertia(X0,X4,sk8)
      | ~ inertia(sk3,X5,sk8)
      | ~ greater(X5,X4)
      | greater(X3,X1) ),
    inference(resolution,[],[f3,f12]) ).

fof(f29,plain,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ reorganization_type(X0,sk4,sk8)
      | organization(sk3,X1)
      | ~ class(X0,X2,sk8)
      | ~ class(sk3,X2,sk8)
      | ~ reorganization(X0,sk8,X3)
      | ~ reorganization(sk3,sk8,X1)
      | ~ organization(X0,sk8)
      | ~ inertia(X0,X4,sk8)
      | ~ inertia(sk3,X5,sk8)
      | ~ greater(X5,X4)
      | greater(X3,X1) ),
    inference(forward_subsumption_resolution,[],[f28,f5]) ).

fof(f33,plain,
    ! [X2,X0,X1] :
      ( ~ class(sk2,X0,sk8)
      | ~ class(sk3,X0,sk8)
      | ~ organization(sk2,sk8)
      | ~ inertia(sk2,X1,sk8)
      | ~ inertia(sk3,X2,sk8)
      | ~ greater(sk7,sk6)
      | greater(X2,X1) ),
    inference(resolution,[],[f21,f13]) ).

fof(f37,plain,
    ! [X2,X0,X1] :
      ( ~ class(sk2,X0,sk8)
      | ~ class(sk3,X0,sk8)
      | ~ inertia(sk2,X1,sk8)
      | ~ inertia(sk3,X2,sk8)
      | ~ greater(sk7,sk6)
      | greater(X2,X1) ),
    inference(forward_subsumption_resolution,[],[f33,f4]) ).

fof(f49,plain,
    ! [X2,X0,X1] :
      ( ~ class(sk2,X0,sk8)
      | ~ class(sk3,X0,sk8)
      | ~ inertia(sk2,X1,sk8)
      | ~ inertia(sk3,X2,sk8)
      | greater(X2,X1) ),
    inference(forward_subsumption_resolution,[],[f37,f15]) ).

fof(f51,definition,
    ( spl0_4
  <=> ! [X2,X1] :
        ( ~ inertia(sk2,X1,sk8)
        | ~ inertia(sk3,X2,sk8)
        | greater(X2,X1) ) ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f52,plain,
    ( ! [X2,X1] :
        ( ~ inertia(sk2,X1,sk8)
        | ~ inertia(sk3,X2,sk8)
        | greater(X2,X1) )
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f51]) ).

fof(f54,definition,
    ( spl0_5
  <=> ! [X0] :
        ( ~ class(sk2,X0,sk8)
        | ~ class(sk3,X0,sk8) ) ),
    introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).

fof(f55,plain,
    ( ! [X0] :
        ( ~ class(sk2,X0,sk8)
        | ~ class(sk3,X0,sk8) )
    | ~ spl0_5 ),
    inference(avatar_component_clause,[],[f54]) ).

fof(f56,plain,
    ( spl0_4
    | spl0_5 ),
    inference(avatar_split_clause,[],[f49,f54,f51]) ).

fof(f87,plain,
    ! [X2,X3,X0,X1,X4] :
      ( organization(sk3,X0)
      | ~ class(sk2,X1,sk8)
      | ~ class(sk3,X1,sk8)
      | ~ reorganization(sk2,sk8,X2)
      | ~ reorganization(sk3,sk8,X0)
      | ~ organization(sk2,sk8)
      | ~ inertia(sk2,X3,sk8)
      | ~ inertia(sk3,X4,sk8)
      | ~ greater(X4,X3)
      | greater(X2,X0) ),
    inference(resolution,[],[f29,f11]) ).

fof(f91,plain,
    ( ! [X2,X3,X0,X1,X4] :
        ( organization(sk3,X0)
        | ~ class(sk2,X1,sk8)
        | ~ class(sk3,X1,sk8)
        | ~ reorganization(sk2,sk8,X2)
        | ~ reorganization(sk3,sk8,X0)
        | ~ organization(sk2,sk8)
        | ~ inertia(sk2,X3,sk8)
        | ~ inertia(sk3,X4,sk8)
        | greater(X2,X0) )
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f87,f52]) ).

fof(f99,plain,
    ( ! [X2,X3,X0,X1,X4] :
        ( organization(sk3,X0)
        | ~ class(sk2,X1,sk8)
        | ~ class(sk3,X1,sk8)
        | ~ reorganization(sk2,sk8,X2)
        | ~ reorganization(sk3,sk8,X0)
        | ~ inertia(sk2,X3,sk8)
        | ~ inertia(sk3,X4,sk8)
        | greater(X2,X0) )
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f91,f4]) ).

fof(f101,definition,
    ( spl0_13
  <=> ! [X4] : ~ inertia(sk3,X4,sk8) ),
    introduced(definition,[new_symbols(definition,[spl0_13])],[avatar_definition]) ).

fof(f102,plain,
    ( ! [X4] : ~ inertia(sk3,X4,sk8)
    | ~ spl0_13 ),
    inference(avatar_component_clause,[],[f101]) ).

fof(f104,definition,
    ( spl0_14
  <=> ! [X3] : ~ inertia(sk2,X3,sk8) ),
    introduced(definition,[new_symbols(definition,[spl0_14])],[avatar_definition]) ).

fof(f105,plain,
    ( ! [X3] : ~ inertia(sk2,X3,sk8)
    | ~ spl0_14 ),
    inference(avatar_component_clause,[],[f104]) ).

fof(f107,definition,
    ( spl0_15
  <=> ! [X2,X0] :
        ( organization(sk3,X0)
        | ~ reorganization(sk3,sk8,X0)
        | ~ reorganization(sk2,sk8,X2)
        | greater(X2,X0) ) ),
    introduced(definition,[new_symbols(definition,[spl0_15])],[avatar_definition]) ).

fof(f108,plain,
    ( ! [X2,X0] :
        ( ~ reorganization(sk3,sk8,X0)
        | ~ reorganization(sk2,sk8,X2)
        | organization(sk3,X0)
        | greater(X2,X0) )
    | ~ spl0_15 ),
    inference(avatar_component_clause,[],[f107]) ).

fof(f109,plain,
    ( spl0_13
    | spl0_14
    | spl0_5
    | spl0_15
    | ~ spl0_4 ),
    inference(avatar_split_clause,[],[f99,f51,f107,f54,f104,f101]) ).

fof(f110,plain,
    ( ~ class(sk3,sk5,sk8)
    | ~ spl0_5 ),
    inference(resolution,[],[f55,f7]) ).

fof(f111,plain,
    ( $false
    | ~ spl0_5 ),
    inference(forward_subsumption_resolution,[],[f110,f8]) ).

fof(f112,plain,
    ~ spl0_5,
    inference(avatar_contradiction_clause,[],[f111]) ).

fof(f159,plain,
    ( ! [X0] :
        ( ~ reorganization(sk3,sk8,X0)
        | organization(sk3,X0)
        | greater(sk9,X0) )
    | ~ spl0_15 ),
    inference(resolution,[],[f108,f9]) ).

fof(f167,plain,
    ( organization(sk3,sk10)
    | greater(sk9,sk10)
    | ~ spl0_15 ),
    inference(resolution,[],[f159,f10]) ).

fof(f168,plain,
    ( greater(sk9,sk10)
    | ~ spl0_15 ),
    inference(forward_subsumption_resolution,[],[f167,f6]) ).

fof(f169,plain,
    ( $false
    | ~ spl0_15 ),
    inference(forward_subsumption_resolution,[],[f168,f16]) ).

fof(f170,plain,
    ~ spl0_15,
    inference(avatar_contradiction_clause,[],[f169]) ).

fof(f171,plain,
    ( ~ organization(sk2,sk8)
    | ~ spl0_14 ),
    inference(resolution,[],[f105,f1]) ).

fof(f172,plain,
    ( $false
    | ~ spl0_14 ),
    inference(forward_subsumption_resolution,[],[f171,f4]) ).

fof(f173,plain,
    ~ spl0_14,
    inference(avatar_contradiction_clause,[],[f172]) ).

fof(f174,plain,
    ( ~ organization(sk3,sk8)
    | ~ spl0_13 ),
    inference(resolution,[],[f102,f1]) ).

fof(f175,plain,
    ( $false
    | ~ spl0_13 ),
    inference(forward_subsumption_resolution,[],[f174,f5]) ).

fof(f176,plain,
    ~ spl0_13,
    inference(avatar_contradiction_clause,[],[f175]) ).

cnf(s2,plain,
    ( spl0_4
    | spl0_5 ),
    inference(sat_conversion,[],[f56]) ).

cnf(s6,plain,
    ( ~ spl0_4
    | spl0_5
    | spl0_13
    | spl0_14
    | spl0_15 ),
    inference(sat_conversion,[],[f109]) ).

cnf(s7,plain,
    ~ spl0_5,
    inference(sat_conversion,[],[f112]) ).

cnf(s10,plain,
    ~ spl0_15,
    inference(sat_conversion,[],[f170]) ).

cnf(s11,plain,
    ~ spl0_14,
    inference(sat_conversion,[],[f173]) ).

cnf(s12,plain,
    ~ spl0_13,
    inference(sat_conversion,[],[f176]) ).

cnf(s13,plain,
    ~ spl0_4,
    inference(rat,[],[s6,s10,s11,s12,s7]) ).

cnf(s15,plain,
    $false,
    inference(rat,[],[s2,s7,s13]) ).

fof(f177,plain,
    $false,
    inference(avatar_sat_refutation,[],[s15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT016-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.38  % Computer : n015.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:20:01 UTC 2026
% 0.13/0.38  % CPUTime  : 
% 0.13/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.42  Running first-order model finding
% 0.13/0.42  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.45  % (1877298)Will run a generic schedule for satisfiability detection.
% 0.13/0.45  % (1877307)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=595496295:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.13/0.45  % (1877307) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1877298-1877307"...
% 0.13/0.45  % (1877304)% WARNING: option uhcvi not known.
% 0.13/0.45  % (1877307)...printing done.
% 0.13/0.45  % (1877307)Refutation found. Thanks to Tanya!
% 0.13/0.45  % SZS status Unsatisfiable for theBenchmark
% 0.13/0.45  % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.46  % (1877307)------------------------------
% 0.13/0.46  % (1877307)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.13/0.46  % (1877307)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.13/0.46  % (1877307)CaDiCaL version: 2.1.3
% 0.13/0.46  % (1877307)Termination reason: Refutation
% 0.13/0.46  % (1877307)Time elapsed: 0.003 s
% 0.13/0.46  % (1877307)Peak memory usage: 12 MB
% 0.13/0.46  % (1877307)Instructions burned: 7 (million)
% 0.13/0.46  % (1877298)Success in time 0.027 s
% 0.13/0.46  % Vampire exiting
%------------------------------------------------------------------------------