↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---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 SAT

% Computer : n017.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:41 PM UTC 2026

% Result   : Theorem 0.12s 0.44s
% Output   : Refutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   32 (   9 unt;   0 def)
%            Number of atoms       :   94 (  17 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :  101 (  39   ~;  33   |;  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   :   61 (  55   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( smaller_or_equal(X0,X1)
    <=> ( smaller(X0,X1)
        | X0 = X1 ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT001+0.ax',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] :
      ( smaller_or_equal(X0,X1)
      | ( ~ smaller(X0,X1)
        & X0 != X1 ) ),
    inference(ennf_transformation,[],[f12]) ).

fof(f17,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(f18,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,[],[f17]) ).

fof(f19,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(f20,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,[],[f19]) ).

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

fof(f22,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(f23,plain,
    ? [X0,X1,X2] :
      ( ~ greater(capability(X0,X2),capability(X0,X1))
      & organization(X0)
      & greater(age(X0,X2),age(X0,X1)) ),
    inference(flattening,[],[f22]) ).

fof(f25,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)],[f23]) ).

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

fof(f35,plain,
    ! [X2,X0,X1] :
      ( ~ 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)) ),
    inference(cnf_transformation,[],[f18]) ).

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

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

fof(f38,plain,
    greater(age(sK0,sK2),age(sK0,sK1)),
    inference(cnf_transformation,[],[f25]) ).

fof(f39,plain,
    organization(sK0),
    inference(cnf_transformation,[],[f25]) ).

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

fof(f42,plain,
    ! [X0] : smaller_or_equal(X0,X0),
    inference(equality_resolution,[],[f26]) ).

fof(f63,plain,
    ! [X0,X1] : internal_friction(sK0,X0) = internal_friction(sK0,X1),
    inference(resolution,[],[f37,f39]) ).

fof(f68,plain,
    ! [X0,X1] :
      ( ~ greater(age(sK0,X0),age(sK0,X1))
      | greater(stock_of_knowledge(sK0,X0),stock_of_knowledge(sK0,X1)) ),
    inference(resolution,[],[f36,f39]) ).

fof(f73,plain,
    greater(stock_of_knowledge(sK0,sK2),stock_of_knowledge(sK0,sK1)),
    inference(resolution,[],[f68,f38]) ).

fof(f75,plain,
    ! [X0,X1] :
      ( ~ greater(stock_of_knowledge(sK0,X0),stock_of_knowledge(sK0,X1))
      | ~ smaller_or_equal(internal_friction(sK0,X0),internal_friction(sK0,X1))
      | greater(capability(sK0,X0),capability(sK0,X1)) ),
    inference(resolution,[],[f35,f39]) ).

fof(f88,plain,
    ( ~ smaller_or_equal(internal_friction(sK0,sK2),internal_friction(sK0,sK1))
    | greater(capability(sK0,sK2),capability(sK0,sK1)) ),
    inference(resolution,[],[f75,f73]) ).

fof(f90,plain,
    ~ smaller_or_equal(internal_friction(sK0,sK2),internal_friction(sK0,sK1)),
    inference(forward_subsumption_resolution,[],[f88,f40]) ).

fof(f92,plain,
    ! [X0] : ~ smaller_or_equal(internal_friction(sK0,X0),internal_friction(sK0,sK1)),
    inference(superposition,[],[f90,f63]) ).

fof(f105,plain,
    $false,
    inference(resolution,[],[f92,f42]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT044+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.12/0.37  % Computer : n017.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Sun Sep 27 17:22:05 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.12/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.40  Running first-order model finding
% 0.12/0.40  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.12/0.44  % (2820779)Will run a generic schedule for satisfiability detection.
% 0.12/0.44  % (2820789)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3001507207:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.12/0.44  % (2820789) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2820779-2820789"...
% 0.12/0.44  % (2820789)...printing done.
% 0.12/0.44  % (2820789)Refutation found. Thanks to Tanya!
% 0.12/0.44  % SZS status Theorem for theBenchmark
% 0.12/0.44  % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.44  % (2820789)------------------------------
% 0.12/0.44  % (2820789)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.44  % (2820789)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.44  % (2820789)CaDiCaL version: 2.1.3
% 0.12/0.44  % (2820789)Termination reason: Refutation
% 0.12/0.44  % (2820789)Time elapsed: 0.002 s
% 0.12/0.44  % (2820789)Peak memory usage: 11 MB
% 0.12/0.44  % (2820789)Instructions burned: 4 (million)
% 0.12/0.44  % (2820779)Success in time 0.027 s
% 0.12/0.44  % Vampire exiting
%------------------------------------------------------------------------------