↑ 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  : MGT015-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n006.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.17s 0.47s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   22
% Syntax   : Number of formulae    :   67 (  25 unt;   6 def)
%            Number of atoms       :  214 (   0 equ)
%            Maximal formula atoms :   13 (   3 avg)
%            Number of connectives :  303 ( 156   ~; 141   |;   0   &)
%                                         (   6 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   23 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   14 (  13 usr;   7 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   9 con; 0-2 aty)
%            Number of variables   :   85 (   0 sgn  85   !;   0   ?)

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

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

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

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

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

fof(f6,negated_conjecture,
    organization(sk3,sk10),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t15_FOL_6) ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

fof(f43,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(f44,plain,
    ( ! [X2,X1] :
        ( ~ inertia(sk3,X2,sk8)
        | ~ inertia(sk2,X1,sk8)
        | greater(X2,X1) )
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f43]) ).

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

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

fof(f48,plain,
    ( spl0_4
    | spl0_5 ),
    inference(avatar_split_clause,[],[f41,f46,f43]) ).

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

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

fof(f86,definition,
    ( spl0_13
  <=> ! [X4,X3] :
        ( ~ inertia(sk2,X3,sk8)
        | ~ inertia(sk3,X4,sk8)
        | ~ greater(X4,X3) ) ),
    introduced(definition,[new_symbols(definition,[spl0_13])],[avatar_definition]) ).

fof(f87,plain,
    ( ! [X3,X4] :
        ( ~ inertia(sk2,X3,sk8)
        | ~ inertia(sk3,X4,sk8)
        | ~ greater(X4,X3) )
    | ~ spl0_13 ),
    inference(avatar_component_clause,[],[f86]) ).

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

fof(f90,plain,
    ( ! [X2,X1] :
        ( ~ reorganization(sk3,sk8,X2)
        | ~ reorganization(sk2,sk8,X1)
        | greater(X2,X1)
        | ~ organization(sk3,X2) )
    | ~ spl0_14 ),
    inference(avatar_component_clause,[],[f89]) ).

fof(f91,plain,
    ( spl0_13
    | spl0_14
    | spl0_5 ),
    inference(avatar_split_clause,[],[f77,f46,f89,f86]) ).

fof(f113,plain,
    ( ~ class(sk2,sk5,sk8)
    | ~ spl0_5 ),
    inference(resolution,[],[f47,f8]) ).

fof(f114,plain,
    ( $false
    | ~ spl0_5 ),
    inference(forward_subsumption_resolution,[],[f113,f7]) ).

fof(f115,plain,
    ~ spl0_5,
    inference(avatar_contradiction_clause,[],[f114]) ).

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

fof(f124,plain,
    ( ! [X4] : ~ inertia(sk3,X4,sk8)
    | ~ spl0_19 ),
    inference(avatar_component_clause,[],[f123]) ).

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

fof(f127,plain,
    ( ! [X3] : ~ inertia(sk2,X3,sk8)
    | ~ spl0_20 ),
    inference(avatar_component_clause,[],[f126]) ).

fof(f137,plain,
    ( ! [X0] :
        ( ~ reorganization(sk2,sk8,X0)
        | greater(sk10,X0)
        | ~ organization(sk3,sk10) )
    | ~ spl0_14 ),
    inference(resolution,[],[f90,f10]) ).

fof(f138,plain,
    ( ! [X0] :
        ( ~ reorganization(sk2,sk8,X0)
        | greater(sk10,X0) )
    | ~ spl0_14 ),
    inference(forward_subsumption_resolution,[],[f137,f6]) ).

fof(f139,plain,
    ( greater(sk10,sk9)
    | ~ spl0_14 ),
    inference(resolution,[],[f138,f9]) ).

fof(f140,plain,
    ( $false
    | ~ spl0_14 ),
    inference(forward_subsumption_resolution,[],[f139,f16]) ).

fof(f141,plain,
    ~ spl0_14,
    inference(avatar_contradiction_clause,[],[f140]) ).

fof(f142,plain,
    ( ! [X3,X4] :
        ( ~ inertia(sk2,X3,sk8)
        | ~ inertia(sk3,X4,sk8) )
    | ~ spl0_4
    | ~ spl0_13 ),
    inference(forward_subsumption_resolution,[],[f87,f44]) ).

fof(f144,plain,
    ( spl0_19
    | spl0_20
    | ~ spl0_4
    | ~ spl0_13 ),
    inference(avatar_split_clause,[],[f142,f86,f43,f126,f123]) ).

fof(f145,plain,
    ( ~ organization(sk3,sk8)
    | ~ spl0_19 ),
    inference(resolution,[],[f124,f1]) ).

fof(f146,plain,
    ( $false
    | ~ spl0_19 ),
    inference(forward_subsumption_resolution,[],[f145,f5]) ).

fof(f147,plain,
    ~ spl0_19,
    inference(avatar_contradiction_clause,[],[f146]) ).

fof(f148,plain,
    ( ~ organization(sk2,sk8)
    | ~ spl0_20 ),
    inference(resolution,[],[f127,f1]) ).

fof(f149,plain,
    ( $false
    | ~ spl0_20 ),
    inference(forward_subsumption_resolution,[],[f148,f4]) ).

fof(f150,plain,
    ~ spl0_20,
    inference(avatar_contradiction_clause,[],[f149]) ).

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

cnf(s6,plain,
    ( spl0_5
    | spl0_13
    | spl0_14 ),
    inference(sat_conversion,[],[f91]) ).

cnf(s10,plain,
    ~ spl0_5,
    inference(sat_conversion,[],[f115]) ).

cnf(s12,plain,
    ~ spl0_14,
    inference(sat_conversion,[],[f141]) ).

cnf(s14,plain,
    ( ~ spl0_4
    | ~ spl0_13
    | spl0_19
    | spl0_20 ),
    inference(sat_conversion,[],[f144]) ).

cnf(s15,plain,
    ~ spl0_19,
    inference(sat_conversion,[],[f147]) ).

cnf(s16,plain,
    ~ spl0_20,
    inference(sat_conversion,[],[f150]) ).

cnf(s17,plain,
    ( ~ spl0_4
    | ~ spl0_13 ),
    inference(rat,[],[s14,s16,s15]) ).

cnf(s22,plain,
    spl0_13,
    inference(rat,[],[s6,s12,s10]) ).

cnf(s23,plain,
    ~ spl0_4,
    inference(rat,[],[s17,s22]) ).

cnf(s26,plain,
    $false,
    inference(rat,[],[s2,s10,s23]) ).

fof(f151,plain,
    $false,
    inference(avatar_sat_refutation,[],[s26]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MGT015-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38  % Computer : n006.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:16:11 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42  Running first-order model finding
% 0.11/0.42  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.47  % (3190956)Will run a generic schedule for satisfiability detection.
% 0.17/0.47  % (3190961)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2083458844_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.47  % TRYING [1]
% 0.17/0.47  % TRYING [2]
% 0.17/0.47  % TRYING [3]
% 0.17/0.47  % TRYING [4]
% 0.17/0.47  % (3190962)% WARNING: option uhcvi not known.
% 0.17/0.47  % TRYING [5]
% 0.17/0.47  % (3190962)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1099795749:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.47  % (3190963)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3279951146:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.47  % (3190964)dis+10_1_sil=32000:sp=arity:random_seed=115609251:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.47  % (3190965)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1467006048:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.47  % TRYING [6]
% 0.17/0.47  % (3190966)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=217771270:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.47  % (3190967)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3291056313:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.47  % (3190964) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3190956-3190964"...
% 0.17/0.47  % (3190962) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3190956-3190962"...
% 0.17/0.47  % (3190967) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3190956-3190967"...
% 0.17/0.47  % (3190966) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3190956-3190966"...
% 0.17/0.47  % (3190965) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3190956-3190965"...
% 0.17/0.47  % (3190963) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3190956-3190963"...
% 0.17/0.47  % (3190964)...printing done.
% 0.17/0.47  % TRYING [7]
% 0.17/0.47  % (3190962)...printing done.
% 0.17/0.47  % (3190966)...printing done.
% 0.17/0.47  % (3190964)Refutation found. Thanks to Tanya!
% 0.17/0.47  % SZS status Unsatisfiable for theBenchmark
% 0.17/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.47  % (3190964)------------------------------
% 0.17/0.47  % (3190964)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.47  % (3190964)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.47  % (3190964)CaDiCaL version: 2.1.3
% 0.17/0.47  % (3190964)Termination reason: Refutation
% 0.17/0.47  % (3190964)Time elapsed: 0.004 s
% 0.17/0.47  % (3190964)Peak memory usage: 12 MB
% 0.17/0.47  % (3190964)Instructions burned: 4 (million)
% 0.17/0.47  % (3190956)Success in time 0.047 s
% 0.17/0.47  % Vampire exiting
%------------------------------------------------------------------------------