↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SEU244+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% 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:47:59 PM UTC 2026

% Result   : Theorem 1.62s 1.21s
% Output   : Refutation 4.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   96 (   5 unt;   2 def)
%            Number of atoms       :  322 (   0 equ)
%            Maximal formula atoms :   13 (   3 avg)
%            Number of connectives :  375 ( 149   ~; 150   |;  48   &)
%                                         (  18 <=>;   9  =>;   0  <=;   1 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   16 (  15 usr;   3 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   60 (   0 sgn  57   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f18,axiom,
    ! [X0] :
      ( relation(X0)
     => ( antisymmetric(X0)
      <=> is_antisymmetric_in(X0,relation_field(X0)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d12_relat_2) ).

fof(f22,axiom,
    ! [X0] :
      ( relation(X0)
     => ( connected(X0)
      <=> is_connected_in(X0,relation_field(X0)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d14_relat_2) ).

fof(f23,axiom,
    ! [X0] :
      ( relation(X0)
     => ( transitive(X0)
      <=> is_transitive_in(X0,relation_field(X0)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d16_relat_2) ).

fof(f50,axiom,
    ! [X0] :
      ( relation(X0)
     => ( well_ordering(X0)
      <=> ( reflexive(X0)
          & transitive(X0)
          & antisymmetric(X0)
          & connected(X0)
          & well_founded_relation(X0) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_wellord1) ).

fof(f56,axiom,
    ! [X0] :
      ( relation(X0)
     => ! [X1] :
          ( well_orders(X0,X1)
        <=> ( is_reflexive_in(X0,X1)
            & is_transitive_in(X0,X1)
            & is_antisymmetric_in(X0,X1)
            & is_connected_in(X0,X1)
            & is_well_founded_in(X0,X1) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_wellord1) ).

fof(f68,axiom,
    ! [X0] :
      ( relation(X0)
     => ( reflexive(X0)
      <=> is_reflexive_in(X0,relation_field(X0)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d9_relat_2) ).

fof(f266,axiom,
    ! [X0] :
      ( relation(X0)
     => ( well_founded_relation(X0)
      <=> is_well_founded_in(X0,relation_field(X0)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_wellord1) ).

fof(f290,conjecture,
    ! [X0] :
      ( relation(X0)
     => ( well_orders(X0,relation_field(X0))
      <=> well_ordering(X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_wellord1) ).

fof(f291,negated_conjecture,
    ~ ! [X0] :
        ( relation(X0)
       => ( well_orders(X0,relation_field(X0))
        <=> well_ordering(X0) ) ),
    inference(negated_conjecture,[status(cth)],[f290]) ).

fof(f330,plain,
    ! [X0] :
      ( ( antisymmetric(X0)
      <=> is_antisymmetric_in(X0,relation_field(X0)) )
      | ~ relation(X0) ),
    inference(ennf_transformation,[],[f18]) ).

fof(f335,plain,
    ! [X0] :
      ( ( connected(X0)
      <=> is_connected_in(X0,relation_field(X0)) )
      | ~ relation(X0) ),
    inference(ennf_transformation,[],[f22]) ).

fof(f336,plain,
    ! [X0] :
      ( ( transitive(X0)
      <=> is_transitive_in(X0,relation_field(X0)) )
      | ~ relation(X0) ),
    inference(ennf_transformation,[],[f23]) ).

fof(f354,plain,
    ! [X0] :
      ( ( well_ordering(X0)
      <=> ( reflexive(X0)
          & transitive(X0)
          & antisymmetric(X0)
          & connected(X0)
          & well_founded_relation(X0) ) )
      | ~ relation(X0) ),
    inference(ennf_transformation,[],[f50]) ).

fof(f359,plain,
    ! [X0] :
      ( ! [X1] :
          ( well_orders(X0,X1)
        <=> ( is_reflexive_in(X0,X1)
            & is_transitive_in(X0,X1)
            & is_antisymmetric_in(X0,X1)
            & is_connected_in(X0,X1)
            & is_well_founded_in(X0,X1) ) )
      | ~ relation(X0) ),
    inference(ennf_transformation,[],[f56]) ).

fof(f373,plain,
    ! [X0] :
      ( ( reflexive(X0)
      <=> is_reflexive_in(X0,relation_field(X0)) )
      | ~ relation(X0) ),
    inference(ennf_transformation,[],[f68]) ).

fof(f553,plain,
    ! [X0] :
      ( ( well_founded_relation(X0)
      <=> is_well_founded_in(X0,relation_field(X0)) )
      | ~ relation(X0) ),
    inference(ennf_transformation,[],[f266]) ).

fof(f578,plain,
    ? [X0] :
      ( ( well_orders(X0,relation_field(X0))
      <~> well_ordering(X0) )
      & relation(X0) ),
    inference(ennf_transformation,[],[f291]) ).

fof(f608,plain,
    ! [X0] :
      ( ( ( antisymmetric(X0)
          | ~ is_antisymmetric_in(X0,relation_field(X0)) )
        & ( is_antisymmetric_in(X0,relation_field(X0))
          | ~ antisymmetric(X0) ) )
      | ~ relation(X0) ),
    inference(nnf_transformation,[],[f330]) ).

fof(f619,plain,
    ! [X0] :
      ( ( ( connected(X0)
          | ~ is_connected_in(X0,relation_field(X0)) )
        & ( is_connected_in(X0,relation_field(X0))
          | ~ connected(X0) ) )
      | ~ relation(X0) ),
    inference(nnf_transformation,[],[f335]) ).

fof(f620,plain,
    ! [X0] :
      ( ( ( transitive(X0)
          | ~ is_transitive_in(X0,relation_field(X0)) )
        & ( is_transitive_in(X0,relation_field(X0))
          | ~ transitive(X0) ) )
      | ~ relation(X0) ),
    inference(nnf_transformation,[],[f336]) ).

fof(f692,plain,
    ! [X0] :
      ( ( ( well_ordering(X0)
          | ~ reflexive(X0)
          | ~ transitive(X0)
          | ~ antisymmetric(X0)
          | ~ connected(X0)
          | ~ well_founded_relation(X0) )
        & ( ( reflexive(X0)
            & transitive(X0)
            & antisymmetric(X0)
            & connected(X0)
            & well_founded_relation(X0) )
          | ~ well_ordering(X0) ) )
      | ~ relation(X0) ),
    inference(nnf_transformation,[],[f354]) ).

fof(f693,plain,
    ! [X0] :
      ( ( ( well_ordering(X0)
          | ~ reflexive(X0)
          | ~ transitive(X0)
          | ~ antisymmetric(X0)
          | ~ connected(X0)
          | ~ well_founded_relation(X0) )
        & ( ( reflexive(X0)
            & transitive(X0)
            & antisymmetric(X0)
            & connected(X0)
            & well_founded_relation(X0) )
          | ~ well_ordering(X0) ) )
      | ~ relation(X0) ),
    inference(flattening,[],[f692]) ).

fof(f704,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( well_orders(X0,X1)
            | ~ is_reflexive_in(X0,X1)
            | ~ is_transitive_in(X0,X1)
            | ~ is_antisymmetric_in(X0,X1)
            | ~ is_connected_in(X0,X1)
            | ~ is_well_founded_in(X0,X1) )
          & ( ( is_reflexive_in(X0,X1)
              & is_transitive_in(X0,X1)
              & is_antisymmetric_in(X0,X1)
              & is_connected_in(X0,X1)
              & is_well_founded_in(X0,X1) )
            | ~ well_orders(X0,X1) ) )
      | ~ relation(X0) ),
    inference(nnf_transformation,[],[f359]) ).

fof(f705,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( well_orders(X0,X1)
            | ~ is_reflexive_in(X0,X1)
            | ~ is_transitive_in(X0,X1)
            | ~ is_antisymmetric_in(X0,X1)
            | ~ is_connected_in(X0,X1)
            | ~ is_well_founded_in(X0,X1) )
          & ( ( is_reflexive_in(X0,X1)
              & is_transitive_in(X0,X1)
              & is_antisymmetric_in(X0,X1)
              & is_connected_in(X0,X1)
              & is_well_founded_in(X0,X1) )
            | ~ well_orders(X0,X1) ) )
      | ~ relation(X0) ),
    inference(flattening,[],[f704]) ).

fof(f727,plain,
    ! [X0] :
      ( ( ( reflexive(X0)
          | ~ is_reflexive_in(X0,relation_field(X0)) )
        & ( is_reflexive_in(X0,relation_field(X0))
          | ~ reflexive(X0) ) )
      | ~ relation(X0) ),
    inference(nnf_transformation,[],[f373]) ).

fof(f809,plain,
    ! [X0] :
      ( ( ( well_founded_relation(X0)
          | ~ is_well_founded_in(X0,relation_field(X0)) )
        & ( is_well_founded_in(X0,relation_field(X0))
          | ~ well_founded_relation(X0) ) )
      | ~ relation(X0) ),
    inference(nnf_transformation,[],[f553]) ).

fof(f824,plain,
    ? [X0] :
      ( ( ~ well_ordering(X0)
        | ~ well_orders(X0,relation_field(X0)) )
      & ( well_ordering(X0)
        | well_orders(X0,relation_field(X0)) )
      & relation(X0) ),
    inference(nnf_transformation,[],[f578]) ).

fof(f825,plain,
    ? [X0] :
      ( ( ~ well_ordering(X0)
        | ~ well_orders(X0,relation_field(X0)) )
      & ( well_ordering(X0)
        | well_orders(X0,relation_field(X0)) )
      & relation(X0) ),
    inference(flattening,[],[f824]) ).

fof(f826,plain,
    ( ( ~ well_ordering(sK118)
      | ~ well_orders(sK118,relation_field(sK118)) )
    & ( well_ordering(sK118)
      | well_orders(sK118,relation_field(sK118)) )
    & relation(sK118) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK118]),skolemize(X0,sK118)],[f825]) ).

fof(f874,plain,
    ! [X0] :
      ( is_antisymmetric_in(X0,relation_field(X0))
      | ~ antisymmetric(X0)
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f608]) ).

fof(f875,plain,
    ! [X0] :
      ( ~ is_antisymmetric_in(X0,relation_field(X0))
      | antisymmetric(X0)
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f608]) ).

fof(f894,plain,
    ! [X0] :
      ( is_connected_in(X0,relation_field(X0))
      | ~ connected(X0)
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f619]) ).

fof(f895,plain,
    ! [X0] :
      ( ~ is_connected_in(X0,relation_field(X0))
      | connected(X0)
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f619]) ).

fof(f896,plain,
    ! [X0] :
      ( is_transitive_in(X0,relation_field(X0))
      | ~ transitive(X0)
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f620]) ).

fof(f897,plain,
    ! [X0] :
      ( ~ is_transitive_in(X0,relation_field(X0))
      | transitive(X0)
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f620]) ).

fof(f1014,plain,
    ! [X0] :
      ( ~ well_ordering(X0)
      | well_founded_relation(X0)
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f693]) ).

fof(f1015,plain,
    ! [X0] :
      ( ~ well_ordering(X0)
      | connected(X0)
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f693]) ).

fof(f1016,plain,
    ! [X0] :
      ( ~ well_ordering(X0)
      | antisymmetric(X0)
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f693]) ).

fof(f1017,plain,
    ! [X0] :
      ( ~ well_ordering(X0)
      | transitive(X0)
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f693]) ).

fof(f1018,plain,
    ! [X0] :
      ( ~ well_ordering(X0)
      | reflexive(X0)
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f693]) ).

fof(f1019,plain,
    ! [X0] :
      ( ~ reflexive(X0)
      | well_ordering(X0)
      | ~ transitive(X0)
      | ~ antisymmetric(X0)
      | ~ connected(X0)
      | ~ well_founded_relation(X0)
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f693]) ).

fof(f1038,plain,
    ! [X0,X1] :
      ( ~ well_orders(X0,X1)
      | is_well_founded_in(X0,X1)
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f705]) ).

fof(f1039,plain,
    ! [X0,X1] :
      ( ~ well_orders(X0,X1)
      | is_connected_in(X0,X1)
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f705]) ).

fof(f1040,plain,
    ! [X0,X1] :
      ( ~ well_orders(X0,X1)
      | is_antisymmetric_in(X0,X1)
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f705]) ).

fof(f1041,plain,
    ! [X0,X1] :
      ( ~ well_orders(X0,X1)
      | is_transitive_in(X0,X1)
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f705]) ).

fof(f1042,plain,
    ! [X0,X1] :
      ( ~ well_orders(X0,X1)
      | is_reflexive_in(X0,X1)
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f705]) ).

fof(f1043,plain,
    ! [X0,X1] :
      ( ~ is_well_founded_in(X0,X1)
      | ~ is_reflexive_in(X0,X1)
      | ~ is_transitive_in(X0,X1)
      | ~ is_antisymmetric_in(X0,X1)
      | ~ is_connected_in(X0,X1)
      | well_orders(X0,X1)
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f705]) ).

fof(f1084,plain,
    ! [X0] :
      ( is_reflexive_in(X0,relation_field(X0))
      | ~ reflexive(X0)
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f727]) ).

fof(f1085,plain,
    ! [X0] :
      ( ~ is_reflexive_in(X0,relation_field(X0))
      | reflexive(X0)
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f727]) ).

fof(f1391,plain,
    ! [X0] :
      ( is_well_founded_in(X0,relation_field(X0))
      | ~ well_founded_relation(X0)
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f809]) ).

fof(f1392,plain,
    ! [X0] :
      ( ~ is_well_founded_in(X0,relation_field(X0))
      | well_founded_relation(X0)
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f809]) ).

fof(f1432,plain,
    relation(sK118),
    inference(cnf_transformation,[],[f826]) ).

fof(f1433,plain,
    ( well_ordering(sK118)
    | well_orders(sK118,relation_field(sK118)) ),
    inference(cnf_transformation,[],[f826]) ).

fof(f1434,plain,
    ( ~ well_ordering(sK118)
    | ~ well_orders(sK118,relation_field(sK118)) ),
    inference(cnf_transformation,[],[f826]) ).

fof(f1448,definition,
    ( spl121_1
  <=> well_orders(sK118,relation_field(sK118)) ),
    introduced(definition,[new_symbols(definition,[spl121_1])],[avatar_definition]) ).

fof(f1449,plain,
    ( ~ well_orders(sK118,relation_field(sK118))
    | spl121_1 ),
    inference(avatar_component_clause,[],[f1448]) ).

fof(f1450,plain,
    ( well_orders(sK118,relation_field(sK118))
    | ~ spl121_1 ),
    inference(avatar_component_clause,[],[f1448]) ).

fof(f1452,definition,
    ( spl121_2
  <=> well_ordering(sK118) ),
    introduced(definition,[new_symbols(definition,[spl121_2])],[avatar_definition]) ).

fof(f1453,plain,
    ( ~ well_ordering(sK118)
    | spl121_2 ),
    inference(avatar_component_clause,[],[f1452]) ).

fof(f1454,plain,
    ( well_ordering(sK118)
    | ~ spl121_2 ),
    inference(avatar_component_clause,[],[f1452]) ).

fof(f1455,plain,
    ( spl121_1
    | spl121_2 ),
    inference(avatar_split_clause,[],[f1433,f1452,f1448]) ).

fof(f1456,plain,
    ( ~ spl121_1
    | ~ spl121_2 ),
    inference(avatar_split_clause,[],[f1434,f1452,f1448]) ).

fof(f1464,plain,
    ( well_founded_relation(sK118)
    | ~ spl121_2 ),
    inference(unit_resulting_resolution,[],[f1014,f1432,f1454]) ).

fof(f1465,plain,
    ( connected(sK118)
    | ~ spl121_2 ),
    inference(unit_resulting_resolution,[],[f1015,f1432,f1454]) ).

fof(f1466,plain,
    ( antisymmetric(sK118)
    | ~ spl121_2 ),
    inference(unit_resulting_resolution,[],[f1016,f1432,f1454]) ).

fof(f1467,plain,
    ( transitive(sK118)
    | ~ spl121_2 ),
    inference(unit_resulting_resolution,[],[f1017,f1432,f1454]) ).

fof(f1468,plain,
    ( reflexive(sK118)
    | ~ spl121_2 ),
    inference(unit_resulting_resolution,[],[f1018,f1432,f1454]) ).

fof(f1527,plain,
    ( is_well_founded_in(sK118,relation_field(sK118))
    | ~ spl121_2 ),
    inference(unit_resulting_resolution,[],[f1391,f1432,f1464]) ).

fof(f1535,plain,
    ( is_antisymmetric_in(sK118,relation_field(sK118))
    | ~ spl121_2 ),
    inference(unit_resulting_resolution,[],[f874,f1432,f1466]) ).

fof(f1537,plain,
    ( is_connected_in(sK118,relation_field(sK118))
    | ~ spl121_2 ),
    inference(unit_resulting_resolution,[],[f894,f1432,f1465]) ).

fof(f1539,plain,
    ( is_transitive_in(sK118,relation_field(sK118))
    | ~ spl121_2 ),
    inference(unit_resulting_resolution,[],[f896,f1432,f1467]) ).

fof(f1542,plain,
    ( is_reflexive_in(sK118,relation_field(sK118))
    | ~ spl121_2 ),
    inference(unit_resulting_resolution,[],[f1084,f1432,f1468]) ).

fof(f1548,plain,
    ( ~ relation(sK118)
    | spl121_1
    | ~ spl121_2 ),
    inference(unit_resulting_resolution,[],[f1043,f1449,f1537,f1535,f1539,f1527,f1542]) ).

fof(f1561,plain,
    ( $false
    | spl121_1
    | ~ spl121_2 ),
    inference(forward_subsumption_resolution,[],[f1548,f1432]) ).

fof(f1562,plain,
    ( spl121_1
    | ~ spl121_2 ),
    inference(avatar_contradiction_clause,[],[f1561]) ).

fof(f1563,plain,
    ( is_reflexive_in(sK118,relation_field(sK118))
    | ~ spl121_1 ),
    inference(unit_resulting_resolution,[],[f1042,f1432,f1450]) ).

fof(f1564,plain,
    ( is_transitive_in(sK118,relation_field(sK118))
    | ~ spl121_1 ),
    inference(unit_resulting_resolution,[],[f1041,f1432,f1450]) ).

fof(f1565,plain,
    ( is_antisymmetric_in(sK118,relation_field(sK118))
    | ~ spl121_1 ),
    inference(unit_resulting_resolution,[],[f1040,f1432,f1450]) ).

fof(f1566,plain,
    ( is_connected_in(sK118,relation_field(sK118))
    | ~ spl121_1 ),
    inference(unit_resulting_resolution,[],[f1039,f1432,f1450]) ).

fof(f1567,plain,
    ( is_well_founded_in(sK118,relation_field(sK118))
    | ~ spl121_1 ),
    inference(unit_resulting_resolution,[],[f1038,f1432,f1450]) ).

fof(f1568,plain,
    ( transitive(sK118)
    | ~ spl121_1 ),
    inference(unit_resulting_resolution,[],[f897,f1432,f1564]) ).

fof(f1569,plain,
    ( antisymmetric(sK118)
    | ~ spl121_1 ),
    inference(unit_resulting_resolution,[],[f875,f1432,f1565]) ).

fof(f1570,plain,
    ( connected(sK118)
    | ~ spl121_1 ),
    inference(unit_resulting_resolution,[],[f895,f1432,f1566]) ).

fof(f1571,plain,
    ( well_founded_relation(sK118)
    | ~ spl121_1 ),
    inference(unit_resulting_resolution,[],[f1392,f1432,f1567]) ).

fof(f1574,plain,
    ( reflexive(sK118)
    | ~ spl121_1 ),
    inference(unit_resulting_resolution,[],[f1085,f1432,f1563]) ).

fof(f1608,plain,
    ( ~ relation(sK118)
    | ~ spl121_1
    | spl121_2 ),
    inference(unit_resulting_resolution,[],[f1019,f1571,f1570,f1569,f1568,f1453,f1574]) ).

fof(f1621,plain,
    ( $false
    | ~ spl121_1
    | spl121_2 ),
    inference(forward_subsumption_resolution,[],[f1608,f1432]) ).

fof(f1622,plain,
    ( ~ spl121_1
    | spl121_2 ),
    inference(avatar_contradiction_clause,[],[f1621]) ).

cnf(s1,plain,
    ( spl121_1
    | spl121_2 ),
    inference(sat_conversion,[],[f1455]) ).

cnf(s2,plain,
    ( ~ spl121_1
    | ~ spl121_2 ),
    inference(sat_conversion,[],[f1456]) ).

cnf(s12,plain,
    ( spl121_1
    | ~ spl121_2 ),
    inference(sat_conversion,[],[f1562]) ).

cnf(s20,plain,
    ( ~ spl121_1
    | spl121_2 ),
    inference(sat_conversion,[],[f1622]) ).

cnf(s21,plain,
    spl121_1,
    inference(rat,[],[s1,s12]) ).

cnf(s22,plain,
    spl121_2,
    inference(rat,[],[s20,s21]) ).

cnf(s23,plain,
    $false,
    inference(rat,[],[s2,s22,s21]) ).

fof(f1623,plain,
    $false,
    inference(avatar_sat_refutation,[],[s23]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU244+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.39  % Computer : n015.cluster.edu
% 0.09/0.39  % Model    : x86_64 x86_64
% 0.09/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.39  % Memory   : 8046.5625MB
% 0.09/0.39  % OS       : Linux 6.8.0-71-generic
% 0.09/0.39  % CPULimit : 300
% 0.09/0.39  % WCLimit  : 300
% 0.09/0.39  % DateTime : Mon Sep 28 04:20:19 UTC 2026
% 0.09/0.39  % CPUTime  : 
% 0.09/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.43  Running first-order theorem proving
% 0.09/0.43  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.62/1.21  % (2254384)Detected formulas, will run a generic FOF schedule.
% 1.62/1.21  % (2254392)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3044922545:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 1.62/1.21  % (2254391)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=1787735099:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 1.62/1.21  % (2254389)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=291066155:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 1.62/1.21  % (2254395)dis-21_1_sil=8000:lcm=predicate:random_seed=604833922:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 1.62/1.21  % (2254393)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3927476959:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 1.62/1.21  % (2254390)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=498270516:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 1.62/1.21  % (2254394)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=609016336:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 1.62/1.21  % (2254392)Instruction limit reached! 
% 1.62/1.21  % (2254392)------------------------------
% 1.62/1.21  % (2254392)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.62/1.21  % (2254392)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.62/1.21  % (2254392)CaDiCaL version: 2.1.3
% 1.62/1.21  % (2254392)Termination reason: Instruction limit
% 1.62/1.21  % (2254392)Termination phase: Saturation
% 1.62/1.21  % (2254392)Time elapsed: 0.068 s
% 1.62/1.21  % (2254392)Peak memory usage: 90 MB
% 1.62/1.21  % (2254392)Instructions burned: 110 (million)
% 1.62/1.21  % (2254395)Instruction limit reached! 
% 1.62/1.21  % (2254395)------------------------------
% 1.62/1.21  % (2254395)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.62/1.21  % (2254395)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.62/1.21  % (2254395)CaDiCaL version: 2.1.3
% 1.62/1.21  % (2254395)Termination reason: Instruction limit
% 1.62/1.21  % (2254395)Termination phase: Saturation
% 1.62/1.21  % (2254395)Time elapsed: 0.076 s
% 1.62/1.21  % (2254395)Peak memory usage: 90 MB
% 1.62/1.21  % (2254395)Instructions burned: 130 (million)
% 1.62/1.21  % (2254393)Instruction limit reached! 
% 1.62/1.21  % (2254393)------------------------------
% 1.62/1.21  % (2254393)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.62/1.21  % (2254393)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.62/1.21  % (2254393)CaDiCaL version: 2.1.3
% 1.62/1.21  % (2254393)Termination reason: Instruction limit
% 1.62/1.21  % (2254393)Termination phase: Saturation
% 1.62/1.21  % (2254393)Time elapsed: 0.079 s
% 1.62/1.21  % (2254393)Peak memory usage: 89 MB
% 1.62/1.21  % (2254393)Instructions burned: 120 (million)
% 1.62/1.21  % (2254394)Instruction limit reached! 
% 1.62/1.21  % (2254394)------------------------------
% 1.62/1.21  % (2254394)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.62/1.21  % (2254394)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.62/1.21  % (2254394)CaDiCaL version: 2.1.3
% 1.62/1.21  % (2254394)Termination reason: Instruction limit
% 1.62/1.21  % (2254394)Termination phase: Saturation
% 1.62/1.21  % (2254394)Time elapsed: 0.098 s
% 1.62/1.21  % (2254394)Peak memory usage: 91 MB
% 1.62/1.21  % (2254394)Instructions burned: 139 (million)
% 1.62/1.21  % (2254404)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1027506069:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 1.62/1.21  % (2254405)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1063508662:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 1.62/1.21  % (2254403)lrs+10_1_sil=8000:sp=occurrence:random_seed=2675181528:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 1.62/1.21  % (2254404)Refutation not found, incomplete strategy
% 1.62/1.21  % (2254404)------------------------------
% 1.62/1.21  % (2254404)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.62/1.21  % (2254404)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.62/1.21  % (2254404)CaDiCaL version: 2.1.3
% 1.62/1.21  % (2254404)Termination reason: Refutation not found, incomplete strategy
% 1.62/1.21  % (2254404)Time elapsed: 0.004 s
% 1.62/1.21  % (2254404)Peak memory usage: 89 MB
% 1.62/1.21  % (2254404)Instructions burned: 4 (million)
% 1.62/1.21  % (2254406)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=55364424:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 1.62/1.21  % (2254406)First to succeed.
% 1.62/1.21  % (2254406)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2254384"
% 1.62/1.21  % (2254406)Refutation found. Thanks to Tanya!
% 1.62/1.21  % SZS status Theorem for theBenchmark
% 1.62/1.21  % SZS output start Proof for theBenchmark
% See solution above
% 4.40/1.31  % (2254406)------------------------------
% 4.40/1.31  % (2254406)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.40/1.31  % (2254406)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.40/1.31  % (2254406)CaDiCaL version: 2.1.3
% 4.40/1.31  % (2254406)Termination reason: Refutation
% 4.40/1.31  % (2254406)Time elapsed: 0.010 s
% 4.40/1.31  % (2254406)Peak memory usage: 90 MB
% 4.40/1.31  % (2254406)Instructions burned: 28 (million)
% 4.40/1.31  % (2254406)------------------------------
% 4.40/1.31  % (2254406)------------------------------
% 4.40/1.31  % (2254384)Success in time 0.58 s
% 4.40/1.31  % Vampire exiting
%------------------------------------------------------------------------------