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

% Computer : n001.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:51:51 PM UTC 2026

% Result   : Theorem 2.22s 0.92s
% Output   : Refutation 2.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   24
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   96 (  39 unt;   5 def)
%            Number of atoms       :  237 (  85 equ)
%            Maximal formula atoms :   12 (   2 avg)
%            Number of connectives :  237 (  96   ~;  96   |;  29   &)
%                                         (   6 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :   10 (   8 usr;   3 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   2 con; 0-2 aty)
%            Number of variables   :   96 (   1 sgn  90   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f7,axiom,
    ! [X0,X1] :
      ( disjoint(X0,X1)
    <=> set_intersection2(X0,X1) = empty_set ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d7_xboole_0) ).

fof(f8,axiom,
    ! [X0] :
      ( ( relation(X0)
        & function(X0) )
     => ( one_to_one(X0)
      <=> ! [X1,X2] :
            ( ( in(X1,relation_dom(X0))
              & in(X2,relation_dom(X0))
              & apply(X0,X1) = apply(X0,X2) )
           => X1 = X2 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d8_funct_1) ).

fof(f14,axiom,
    ! [X0] : ~ empty(singleton(X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc2_subset_1) ).

fof(f15,axiom,
    ( empty(empty_set)
    & relation(empty_set) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc4_relat_1) ).

fof(f18,axiom,
    ! [X0,X1] : set_intersection2(X0,X0) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_k3_xboole_0) ).

fof(f34,axiom,
    ! [X0,X1] :
      ( ( relation(X1)
        & function(X1) )
     => ( in(X0,relation_dom(X1))
       => relation_image(X1,singleton(X0)) = singleton(apply(X1,X0)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t117_funct_1) ).

fof(f35,conjecture,
    ! [X0] :
      ( ( relation(X0)
        & function(X0) )
     => ( ! [X1,X2] : relation_image(X0,set_intersection2(X1,X2)) = set_intersection2(relation_image(X0,X1),relation_image(X0,X2))
       => one_to_one(X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t122_funct_1) ).

fof(f36,negated_conjecture,
    ~ ! [X0] :
        ( ( relation(X0)
          & function(X0) )
       => ( ! [X1,X2] : relation_image(X0,set_intersection2(X1,X2)) = set_intersection2(relation_image(X0,X1),relation_image(X0,X2))
         => one_to_one(X0) ) ),
    inference(negated_conjecture,[status(cth)],[f35]) ).

fof(f37,axiom,
    ! [X0] :
      ( relation(X0)
     => relation_image(X0,empty_set) = empty_set ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t149_relat_1) ).

fof(f38,axiom,
    ! [X0,X1] :
      ( X0 != X1
     => disjoint(singleton(X0),singleton(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t17_zfmisc_1) ).

fof(f48,plain,
    ! [X0] : set_intersection2(X0,X0) = X0,
    inference(rectify,[],[f18]) ).

fof(f58,plain,
    ! [X0] :
      ( ( one_to_one(X0)
      <=> ! [X1,X2] :
            ( X1 = X2
            | ~ in(X1,relation_dom(X0))
            | ~ in(X2,relation_dom(X0))
            | apply(X0,X1) != apply(X0,X2) ) )
      | ~ relation(X0)
      | ~ function(X0) ),
    inference(ennf_transformation,[],[f8]) ).

fof(f59,plain,
    ! [X0] :
      ( ( one_to_one(X0)
      <=> ! [X1,X2] :
            ( X1 = X2
            | ~ in(X1,relation_dom(X0))
            | ~ in(X2,relation_dom(X0))
            | apply(X0,X1) != apply(X0,X2) ) )
      | ~ relation(X0)
      | ~ function(X0) ),
    inference(flattening,[],[f58]) ).

fof(f73,plain,
    ! [X0,X1] :
      ( relation_image(X1,singleton(X0)) = singleton(apply(X1,X0))
      | ~ in(X0,relation_dom(X1))
      | ~ relation(X1)
      | ~ function(X1) ),
    inference(ennf_transformation,[],[f34]) ).

fof(f74,plain,
    ! [X0,X1] :
      ( relation_image(X1,singleton(X0)) = singleton(apply(X1,X0))
      | ~ in(X0,relation_dom(X1))
      | ~ relation(X1)
      | ~ function(X1) ),
    inference(flattening,[],[f73]) ).

fof(f75,plain,
    ? [X0] :
      ( ~ one_to_one(X0)
      & ! [X1,X2] : relation_image(X0,set_intersection2(X1,X2)) = set_intersection2(relation_image(X0,X1),relation_image(X0,X2))
      & relation(X0)
      & function(X0) ),
    inference(ennf_transformation,[],[f36]) ).

fof(f76,plain,
    ? [X0] :
      ( ~ one_to_one(X0)
      & ! [X1,X2] : relation_image(X0,set_intersection2(X1,X2)) = set_intersection2(relation_image(X0,X1),relation_image(X0,X2))
      & relation(X0)
      & function(X0) ),
    inference(flattening,[],[f75]) ).

fof(f77,plain,
    ! [X0] :
      ( relation_image(X0,empty_set) = empty_set
      | ~ relation(X0) ),
    inference(ennf_transformation,[],[f37]) ).

fof(f78,plain,
    ! [X0,X1] :
      ( disjoint(singleton(X0),singleton(X1))
      | X0 = X1 ),
    inference(ennf_transformation,[],[f38]) ).

fof(f92,plain,
    ! [X0,X1] :
      ( ( disjoint(X0,X1)
        | set_intersection2(X0,X1) != empty_set )
      & ( set_intersection2(X0,X1) = empty_set
        | ~ disjoint(X0,X1) ) ),
    inference(nnf_transformation,[],[f7]) ).

fof(f93,plain,
    ! [X0] :
      ( ( ( one_to_one(X0)
          | ? [X1,X2] :
              ( X1 != X2
              & in(X1,relation_dom(X0))
              & in(X2,relation_dom(X0))
              & apply(X0,X1) = apply(X0,X2) ) )
        & ( ! [X1,X2] :
              ( X1 = X2
              | ~ in(X1,relation_dom(X0))
              | ~ in(X2,relation_dom(X0))
              | apply(X0,X1) != apply(X0,X2) )
          | ~ one_to_one(X0) ) )
      | ~ relation(X0)
      | ~ function(X0) ),
    inference(nnf_transformation,[],[f59]) ).

fof(f94,plain,
    ! [X0] :
      ( ( ( one_to_one(X0)
          | ? [X1,X2] :
              ( X1 != X2
              & in(X1,relation_dom(X0))
              & in(X2,relation_dom(X0))
              & apply(X0,X1) = apply(X0,X2) ) )
        & ( ! [X3,X4] :
              ( X3 = X4
              | ~ in(X3,relation_dom(X0))
              | ~ in(X4,relation_dom(X0))
              | apply(X0,X3) != apply(X0,X4) )
          | ~ one_to_one(X0) ) )
      | ~ relation(X0)
      | ~ function(X0) ),
    inference(rectify,[],[f93]) ).

fof(f95,plain,
    ! [X0] :
      ( ( ( one_to_one(X0)
          | ( sK1(X0) != sK2(X0)
            & in(sK1(X0),relation_dom(X0))
            & in(sK2(X0),relation_dom(X0))
            & apply(X0,sK1(X0)) = apply(X0,sK2(X0)) ) )
        & ( ! [X3,X4] :
              ( X3 = X4
              | ~ in(X3,relation_dom(X0))
              | ~ in(X4,relation_dom(X0))
              | apply(X0,X3) != apply(X0,X4) )
          | ~ one_to_one(X0) ) )
      | ~ relation(X0)
      | ~ function(X0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X1,sK1(X0)),skolemize(X2,sK2(X0))],[f94]) ).

fof(f108,plain,
    ( ~ one_to_one(sK14)
    & ! [X1,X2] : relation_image(sK14,set_intersection2(X1,X2)) = set_intersection2(relation_image(sK14,X1),relation_image(sK14,X2))
    & relation(sK14)
    & function(sK14) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK14]),skolemize(X0,sK14)],[f76]) ).

fof(f120,plain,
    ! [X0,X1] :
      ( ~ disjoint(X0,X1)
      | set_intersection2(X0,X1) = empty_set ),
    inference(cnf_transformation,[],[f92]) ).

fof(f123,plain,
    ! [X0] :
      ( ~ relation(X0)
      | apply(X0,sK1(X0)) = apply(X0,sK2(X0))
      | one_to_one(X0)
      | ~ function(X0) ),
    inference(cnf_transformation,[],[f95]) ).

fof(f124,plain,
    ! [X0] :
      ( ~ relation(X0)
      | in(sK2(X0),relation_dom(X0))
      | one_to_one(X0)
      | ~ function(X0) ),
    inference(cnf_transformation,[],[f95]) ).

fof(f125,plain,
    ! [X0] :
      ( ~ relation(X0)
      | in(sK1(X0),relation_dom(X0))
      | one_to_one(X0)
      | ~ function(X0) ),
    inference(cnf_transformation,[],[f95]) ).

fof(f126,plain,
    ! [X0] :
      ( sK1(X0) != sK2(X0)
      | one_to_one(X0)
      | ~ relation(X0)
      | ~ function(X0) ),
    inference(cnf_transformation,[],[f95]) ).

fof(f133,plain,
    ! [X0] : ~ empty(singleton(X0)),
    inference(cnf_transformation,[],[f14]) ).

fof(f135,plain,
    empty(empty_set),
    inference(cnf_transformation,[],[f15]) ).

fof(f139,plain,
    ! [X0] : set_intersection2(X0,X0) = X0,
    inference(cnf_transformation,[],[f48]) ).

fof(f165,plain,
    ! [X0,X1] :
      ( ~ in(X0,relation_dom(X1))
      | relation_image(X1,singleton(X0)) = singleton(apply(X1,X0))
      | ~ relation(X1)
      | ~ function(X1) ),
    inference(cnf_transformation,[],[f74]) ).

fof(f166,plain,
    function(sK14),
    inference(cnf_transformation,[],[f108]) ).

fof(f167,plain,
    relation(sK14),
    inference(cnf_transformation,[],[f108]) ).

fof(f168,plain,
    ! [X2,X1] : relation_image(sK14,set_intersection2(X1,X2)) = set_intersection2(relation_image(sK14,X1),relation_image(sK14,X2)),
    inference(cnf_transformation,[],[f108]) ).

fof(f169,plain,
    ~ one_to_one(sK14),
    inference(cnf_transformation,[],[f108]) ).

fof(f170,plain,
    ! [X0] :
      ( ~ relation(X0)
      | empty_set = relation_image(X0,empty_set) ),
    inference(cnf_transformation,[],[f77]) ).

fof(f171,plain,
    ! [X0,X1] :
      ( disjoint(singleton(X0),singleton(X1))
      | X0 = X1 ),
    inference(cnf_transformation,[],[f78]) ).

fof(f184,definition,
    ! [X2,X1] : sF15(X1,X2) = relation_image(sK14,set_intersection2(X1,X2)),
    introduced(definition,[new_symbols(definition,[sF15])],[function_definition]) ).

fof(f185,plain,
    ! [X2,X1] : relation_image(sK14,set_intersection2(X1,X2)) = sF15(X1,X2),
    inference(reorient_equations,[],[f184]) ).

fof(f186,definition,
    ! [X1] : sF16(X1) = relation_image(sK14,X1),
    introduced(definition,[new_symbols(definition,[sF16])],[function_definition]) ).

fof(f187,plain,
    ! [X1] : relation_image(sK14,X1) = sF16(X1),
    inference(reorient_equations,[],[f186]) ).

fof(f188,definition,
    ! [X2,X1] : sF17(X1,X2) = set_intersection2(sF16(X1),sF16(X2)),
    introduced(definition,[new_symbols(definition,[sF17])],[function_definition]) ).

fof(f189,plain,
    ! [X2,X1] : set_intersection2(sF16(X1),sF16(X2)) = sF17(X1,X2),
    inference(reorient_equations,[],[f188]) ).

fof(f190,plain,
    ! [X2,X1] : sF15(X1,X2) = sF17(X1,X2),
    inference(definition_folding,[],[f168,f189,f187,f187,f185]) ).

fof(f261,plain,
    empty_set = relation_image(sK14,empty_set),
    inference(resolution,[],[f170,f167]) ).

fof(f262,plain,
    empty_set = sF16(empty_set),
    inference(forward_demodulation,[],[f261,f187]) ).

fof(f349,plain,
    ! [X0,X1] :
      ( empty_set = set_intersection2(singleton(X0),singleton(X1))
      | X0 = X1 ),
    inference(resolution,[],[f171,f120]) ).

fof(f392,plain,
    ! [X0,X1] : set_intersection2(sF16(X0),sF16(X1)) = sF15(X0,X1),
    inference(superposition,[],[f190,f189]) ).

fof(f394,plain,
    ! [X0,X1] : relation_image(sK14,set_intersection2(X0,X1)) = set_intersection2(sF16(X0),sF16(X1)),
    inference(superposition,[],[f185,f392]) ).

fof(f395,plain,
    ! [X0,X1] : set_intersection2(sF16(X0),sF16(X1)) = sF16(set_intersection2(X0,X1)),
    inference(forward_demodulation,[],[f394,f187]) ).

fof(f514,plain,
    ( in(sK2(sK14),relation_dom(sK14))
    | one_to_one(sK14)
    | ~ function(sK14) ),
    inference(resolution,[],[f124,f167]) ).

fof(f516,plain,
    ( in(sK2(sK14),relation_dom(sK14))
    | ~ function(sK14) ),
    inference(forward_subsumption_resolution,[],[f514,f169]) ).

fof(f544,plain,
    in(sK2(sK14),relation_dom(sK14)),
    inference(forward_subsumption_resolution,[],[f516,f166]) ).

fof(f580,plain,
    ( in(sK1(sK14),relation_dom(sK14))
    | one_to_one(sK14)
    | ~ function(sK14) ),
    inference(resolution,[],[f125,f167]) ).

fof(f582,plain,
    ( in(sK1(sK14),relation_dom(sK14))
    | ~ function(sK14) ),
    inference(forward_subsumption_resolution,[],[f580,f169]) ).

fof(f587,plain,
    in(sK1(sK14),relation_dom(sK14)),
    inference(forward_subsumption_resolution,[],[f582,f166]) ).

fof(f625,plain,
    ( apply(sK14,sK1(sK14)) = apply(sK14,sK2(sK14))
    | one_to_one(sK14)
    | ~ function(sK14) ),
    inference(resolution,[],[f123,f167]) ).

fof(f627,plain,
    ( apply(sK14,sK1(sK14)) = apply(sK14,sK2(sK14))
    | ~ function(sK14) ),
    inference(forward_subsumption_resolution,[],[f625,f169]) ).

fof(f632,plain,
    apply(sK14,sK1(sK14)) = apply(sK14,sK2(sK14)),
    inference(forward_subsumption_resolution,[],[f627,f166]) ).

fof(f643,plain,
    ( relation_image(sK14,singleton(sK1(sK14))) = singleton(apply(sK14,sK1(sK14)))
    | ~ relation(sK14)
    | ~ function(sK14) ),
    inference(resolution,[],[f165,f587]) ).

fof(f644,plain,
    ( relation_image(sK14,singleton(sK2(sK14))) = singleton(apply(sK14,sK2(sK14)))
    | ~ relation(sK14)
    | ~ function(sK14) ),
    inference(resolution,[],[f165,f544]) ).

fof(f646,plain,
    ( relation_image(sK14,singleton(sK2(sK14))) = singleton(apply(sK14,sK2(sK14)))
    | ~ function(sK14) ),
    inference(forward_subsumption_resolution,[],[f644,f167]) ).

fof(f647,plain,
    ( relation_image(sK14,singleton(sK1(sK14))) = singleton(apply(sK14,sK1(sK14)))
    | ~ function(sK14) ),
    inference(forward_subsumption_resolution,[],[f643,f167]) ).

fof(f648,plain,
    relation_image(sK14,singleton(sK2(sK14))) = singleton(apply(sK14,sK2(sK14))),
    inference(forward_subsumption_resolution,[],[f646,f166]) ).

fof(f649,plain,
    relation_image(sK14,singleton(sK1(sK14))) = singleton(apply(sK14,sK1(sK14))),
    inference(forward_subsumption_resolution,[],[f647,f166]) ).

fof(f650,plain,
    singleton(apply(sK14,sK1(sK14))) = relation_image(sK14,singleton(sK2(sK14))),
    inference(forward_demodulation,[],[f648,f632]) ).

fof(f651,plain,
    singleton(apply(sK14,sK1(sK14))) = sF16(singleton(sK1(sK14))),
    inference(forward_demodulation,[],[f649,f187]) ).

fof(f652,plain,
    singleton(apply(sK14,sK1(sK14))) = sF16(singleton(sK2(sK14))),
    inference(forward_demodulation,[],[f650,f187]) ).

fof(f659,plain,
    ! [X0] : set_intersection2(sF16(X0),singleton(apply(sK14,sK1(sK14)))) = sF16(set_intersection2(X0,singleton(sK1(sK14)))),
    inference(superposition,[],[f395,f651]) ).

fof(f663,plain,
    ! [X0] : set_intersection2(sF16(X0),singleton(apply(sK14,sK1(sK14)))) = sF16(set_intersection2(X0,singleton(sK2(sK14)))),
    inference(superposition,[],[f395,f652]) ).

fof(f666,plain,
    ! [X0] : sF16(set_intersection2(X0,singleton(sK1(sK14)))) = sF16(set_intersection2(X0,singleton(sK2(sK14)))),
    inference(forward_demodulation,[],[f663,f659]) ).

fof(f1611,plain,
    ! [X0] :
      ( sF16(empty_set) = sF16(set_intersection2(singleton(X0),singleton(sK1(sK14))))
      | sK2(sK14) = X0 ),
    inference(superposition,[],[f666,f349]) ).

fof(f1662,plain,
    ! [X0] :
      ( empty_set = sF16(set_intersection2(singleton(X0),singleton(sK1(sK14))))
      | sK2(sK14) = X0 ),
    inference(forward_demodulation,[],[f1611,f262]) ).

fof(f5035,plain,
    ( empty_set = sF16(singleton(sK1(sK14)))
    | sK2(sK14) = sK1(sK14) ),
    inference(superposition,[],[f1662,f139]) ).

fof(f5076,plain,
    ( empty_set = singleton(apply(sK14,sK1(sK14)))
    | sK2(sK14) = sK1(sK14) ),
    inference(forward_demodulation,[],[f5035,f651]) ).

fof(f5080,definition,
    ( spl18_26
  <=> sK2(sK14) = sK1(sK14) ),
    introduced(definition,[new_symbols(definition,[spl18_26])],[avatar_definition]) ).

fof(f5082,plain,
    ( sK2(sK14) = sK1(sK14)
    | ~ spl18_26 ),
    inference(avatar_component_clause,[],[f5080]) ).

fof(f5084,definition,
    ( spl18_27
  <=> empty_set = singleton(apply(sK14,sK1(sK14))) ),
    introduced(definition,[new_symbols(definition,[spl18_27])],[avatar_definition]) ).

fof(f5086,plain,
    ( empty_set = singleton(apply(sK14,sK1(sK14)))
    | ~ spl18_27 ),
    inference(avatar_component_clause,[],[f5084]) ).

fof(f5087,plain,
    ( spl18_26
    | spl18_27 ),
    inference(avatar_split_clause,[],[f5076,f5084,f5080]) ).

fof(f5276,plain,
    ( sK1(sK14) != sK1(sK14)
    | one_to_one(sK14)
    | ~ relation(sK14)
    | ~ function(sK14)
    | ~ spl18_26 ),
    inference(superposition,[],[f126,f5082]) ).

fof(f5277,plain,
    ( one_to_one(sK14)
    | ~ relation(sK14)
    | ~ function(sK14)
    | ~ spl18_26 ),
    inference(trivial_inequality_removal,[],[f5276]) ).

fof(f5278,plain,
    ( ~ relation(sK14)
    | ~ function(sK14)
    | ~ spl18_26 ),
    inference(forward_subsumption_resolution,[],[f5277,f169]) ).

fof(f5279,plain,
    ( ~ function(sK14)
    | ~ spl18_26 ),
    inference(forward_subsumption_resolution,[],[f5278,f167]) ).

fof(f5280,plain,
    ( $false
    | ~ spl18_26 ),
    inference(forward_subsumption_resolution,[],[f5279,f166]) ).

fof(f5281,plain,
    ~ spl18_26,
    inference(avatar_contradiction_clause,[],[f5280]) ).

fof(f5693,plain,
    ( ~ empty(empty_set)
    | ~ spl18_27 ),
    inference(superposition,[],[f133,f5086]) ).

fof(f5823,plain,
    ( $false
    | ~ spl18_27 ),
    inference(forward_subsumption_resolution,[],[f5693,f135]) ).

fof(f5824,plain,
    ~ spl18_27,
    inference(avatar_contradiction_clause,[],[f5823]) ).

cnf(s22,plain,
    ( spl18_26
    | spl18_27 ),
    inference(sat_conversion,[],[f5087]) ).

cnf(s24,plain,
    ~ spl18_26,
    inference(sat_conversion,[],[f5281]) ).

cnf(s29,plain,
    ~ spl18_27,
    inference(sat_conversion,[],[f5824]) ).

cnf(s32,plain,
    $false,
    inference(rat,[],[s22,s29,s24]) ).

fof(f5874,plain,
    $false,
    inference(avatar_sat_refutation,[],[s32]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU053+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39  % Computer : n001.cluster.edu
% 0.11/0.39  % Model    : x86_64 x86_64
% 0.11/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39  % Memory   : 8046.5625MB
% 0.11/0.39  % OS       : Linux 6.8.0-71-generic
% 0.11/0.39  % CPULimit : 300
% 0.11/0.39  % WCLimit  : 300
% 0.11/0.39  % DateTime : Mon Sep 28 03:33:32 UTC 2026
% 0.11/0.40  % CPUTime  : 
% 0.11/0.40  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.43  Running first-order model finding
% 0.11/0.43  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
% 2.22/0.92  % (4181417)Will run a generic schedule for satisfiability detection.
% 2.22/0.92  % (4181437)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2633036101:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.22/0.92  % (4181433)% WARNING: option uhcvi not known.
% 2.22/0.92  % (4181434)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4004604198:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.22/0.92  % (4181432)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4279444511_2999 on theBenchmark for (2999ds/0Mi)
% 2.22/0.92  % (4181433)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=501153570:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.22/0.92  % (4181435)dis+10_1_sil=32000:sp=arity:random_seed=3542039594:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.22/0.92  % (4181436)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3091819042:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.22/0.92  % (4181438)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2700886990:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.22/0.92  % TRYING [1]
% 2.22/0.92  % TRYING [2]
% 2.22/0.92  % TRYING [3]
% 2.22/0.92  % TRYING [4]
% 2.22/0.92  % TRYING [5]
% 2.22/0.92  % TRYING [6]
% 2.22/0.92  % (4181437)Instruction limit reached! 
% 2.22/0.92  % (4181437)------------------------------
% 2.22/0.92  % (4181437)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.22/0.92  % (4181437)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.22/0.92  % (4181437)CaDiCaL version: 2.1.3
% 2.22/0.92  % (4181437)Termination reason: Instruction limit
% 2.22/0.92  % (4181437)Termination phase: Saturation
% 2.22/0.92  % (4181437)Time elapsed: 0.050 s
% 2.22/0.92  % (4181437)Peak memory usage: 13 MB
% 2.22/0.92  % (4181437)Instructions burned: 134 (million)
% 2.22/0.92  % TRYING [7]
% 2.22/0.92  % (4181467)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2083366568:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.22/0.92  % (4181435)Instruction limit reached! 
% 2.22/0.92  % (4181435)------------------------------
% 2.22/0.92  % (4181435)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.22/0.92  % (4181435)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.22/0.92  % (4181435)CaDiCaL version: 2.1.3
% 2.22/0.92  % (4181435)Termination reason: Instruction limit
% 2.22/0.92  % (4181435)Termination phase: Saturation
% 2.22/0.92  % (4181435)Time elapsed: 0.057 s
% 2.22/0.92  % (4181435)Peak memory usage: 12 MB
% 2.22/0.92  % (4181435)Instructions burned: 106 (million)
% 2.22/0.92  % TRYING [1]
% 2.22/0.92  % TRYING [2]
% 2.22/0.92  % TRYING [3]
% 2.22/0.92  % TRYING [4]
% 2.22/0.92  % TRYING [5]
% 2.22/0.92  % (4181436)Instruction limit reached! 
% 2.22/0.92  % (4181436)------------------------------
% 2.22/0.92  % (4181436)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.22/0.92  % (4181436)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.22/0.92  % (4181436)CaDiCaL version: 2.1.3
% 2.22/0.92  % (4181436)Termination reason: Instruction limit
% 2.22/0.92  % (4181436)Termination phase: Saturation
% 2.22/0.92  % (4181436)Time elapsed: 0.064 s
% 2.22/0.92  % (4181436)Peak memory usage: 12 MB
% 2.22/0.92  % (4181436)Instructions burned: 116 (million)
% 2.22/0.92  % TRYING [6]
% 2.22/0.92  % (4181473)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1907502911:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 2.22/0.92  % TRYING [7]
% 2.22/0.92  % (4181476)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=1240848449:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.22/0.92  % (4181438)Instruction limit reached! 
% 2.22/0.92  % (4181438)------------------------------
% 2.22/0.92  % (4181438)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.22/0.92  % (4181438)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.22/0.92  % (4181438)CaDiCaL version: 2.1.3
% 2.22/0.92  % (4181438)Termination reason: Instruction limit
% 2.22/0.92  % (4181438)Termination phase: Saturation
% 2.22/0.92  % (4181438)Time elapsed: 0.091 s
% 2.22/0.92  % (4181438)Peak memory usage: 13 MB
% 2.22/0.92  % (4181438)Instructions burned: 160 (million)
% 2.22/0.92  % TRYING [8]
% 2.22/0.92  % (4181485)ott-21_1_sil=16000:fs=off:random_seed=53549646:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.22/0.92  % TRYING [8]
% 2.22/0.92  % (4181473)Instruction limit reached! 
% 2.22/0.92  % (4181473)------------------------------
% 2.22/0.92  % (4181473)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.22/0.92  % (4181473)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.22/0.92  % (4181473)CaDiCaL version: 2.1.3
% 2.22/0.92  % (4181473)Termination reason: Instruction limit
% 2.22/0.92  % (4181473)Termination phase: Saturation
% 2.22/0.92  % (4181473)Time elapsed: 0.086 s
% 2.22/0.92  % (4181473)Peak memory usage: 13 MB
% 2.22/0.92  % (4181473)Instructions burned: 132 (million)
% 2.22/0.92  % (4181485)Instruction limit reached! 
% 2.22/0.92  % (4181485)------------------------------
% 2.22/0.92  % (4181485)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.22/0.92  % (4181485)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.22/0.92  % (4181485)CaDiCaL version: 2.1.3
% 2.22/0.92  % (4181485)Termination reason: Instruction limit
% 2.22/0.92  % (4181485)Termination phase: Saturation
% 2.22/0.92  % (4181485)Time elapsed: 0.073 s
% 2.22/0.92  % (4181485)Peak memory usage: 11 MB
% 2.22/0.92  % (4181485)Instructions burned: 180 (million)
% 2.22/0.92  % (4181496)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3451085533:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 2.22/0.92  % (4181497)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3679009277:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.22/0.92  % TRYING [1]
% 2.22/0.92  % TRYING [2]
% 2.22/0.92  % TRYING [3]
% 2.22/0.92  % TRYING [4]
% 2.22/0.92  % TRYING [5]
% 2.22/0.92  % (4181467)Instruction limit reached! 
% 2.22/0.92  % (4181467)------------------------------
% 2.22/0.92  % (4181467)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.22/0.92  % (4181467)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.22/0.92  % (4181467)CaDiCaL version: 2.1.3
% 2.22/0.92  % (4181467)Termination reason: Instruction limit
% 2.22/0.92  % (4181467)Termination phase: Finite model building SAT solving
% 2.22/0.92  % (4181467)Time elapsed: 0.178 s
% 2.22/0.92  % (4181467)Peak memory usage: 24 MB
% 2.22/0.92  % (4181467)Instructions burned: 716 (million)
% 2.22/0.92  % (4181510)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3057466874:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 2.22/0.92  % TRYING [6]
% 2.22/0.92  % TRYING [9]
% 2.22/0.92  % TRYING [7]
% 2.22/0.92  % TRYING [8]
% 2.22/0.92  % (4181510) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4181417-4181510"...
% 2.22/0.92  % (4181510)...printing done.
% 2.22/0.92  % (4181510)Refutation found. Thanks to Tanya!
% 2.22/0.92  % SZS status Theorem for theBenchmark
% 2.22/0.92  % SZS output start Proof for theBenchmark
% See solution above
% 2.22/0.92  % (4181510)------------------------------
% 2.22/0.92  % (4181510)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.22/0.92  % (4181510)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.22/0.92  % (4181510)CaDiCaL version: 2.1.3
% 2.22/0.92  % (4181510)Termination reason: Refutation
% 2.22/0.92  % (4181510)Time elapsed: 0.194 s
% 2.22/0.92  % (4181510)Peak memory usage: 14 MB
% 2.22/0.92  % (4181510)Instructions burned: 832 (million)
% 2.22/0.92  % (4181417)Success in time 0.484 s
% 2.22/0.92  % Vampire exiting
%------------------------------------------------------------------------------