↑ 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  : SET099+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n009.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:43:06 PM UTC 2026

% Result   : Theorem 1.73s 0.76s
% Output   : Refutation 1.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   79 (  14 unt;   4 def)
%            Number of atoms       :  204 (  46 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  209 (  84   ~;  95   |;  14   &)
%                                         (  10 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   5 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   3 con; 0-2 aty)
%            Number of variables   :   86 (   0 sgn  80   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( subclass(X0,X1)
    <=> ! [X2] :
          ( member(X2,X0)
         => member(X2,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',subclass_defn) ).

fof(f2,axiom,
    ! [X0] : subclass(X0,universal_class),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',class_elements_are_sets) ).

fof(f3,axiom,
    ! [X0,X1] :
      ( X0 = X1
    <=> ( subclass(X0,X1)
        & subclass(X1,X0) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',extensionality) ).

fof(f4,axiom,
    ! [X0,X1,X2] :
      ( member(X0,unordered_pair(X1,X2))
    <=> ( member(X0,universal_class)
        & ( X0 = X1
          | X0 = X2 ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).

fof(f6,axiom,
    ! [X0] : singleton(X0) = unordered_pair(X0,X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',singleton_set_defn) ).

fof(f13,axiom,
    ! [X0,X1,X2] :
      ( member(X2,intersection(X0,X1))
    <=> ( member(X2,X0)
        & member(X2,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',intersection) ).

fof(f14,axiom,
    ! [X0,X1] :
      ( member(X1,complement(X0))
    <=> ( member(X1,universal_class)
        & ~ member(X1,X0) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',complement) ).

fof(f41,axiom,
    ! [X0] :
      ( X0 != null_class
     => ? [X1] :
          ( member(X1,universal_class)
          & member(X1,X0)
          & disjoint(X1,X0) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',regularity) ).

fof(f44,conjecture,
    ! [X0] :
      ( ! [X1,X2] :
          ( ( member(X1,X0)
            & member(X2,intersection(complement(singleton(X1)),X0)) )
         => X1 = X2 )
     => ( X0 = null_class
        | ? [X3] : singleton(X3) = X0 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',corollary_2_to_number_of_elements_in_class) ).

fof(f45,negated_conjecture,
    ~ ! [X0] :
        ( ! [X1,X2] :
            ( ( member(X1,X0)
              & member(X2,intersection(complement(singleton(X1)),X0)) )
           => X1 = X2 )
       => ( X0 = null_class
          | ? [X3] : singleton(X3) = X0 ) ),
    inference(negated_conjecture,[status(cth)],[f44]) ).

fof(f47,plain,
    ! [X0,X1] :
      ( subclass(X0,X1)
    <=> ! [X2] :
          ( member(X2,X1)
          | ~ member(X2,X0) ) ),
    inference(ennf_transformation,[],[f1]) ).

fof(f57,plain,
    ! [X0] :
      ( ? [X1] :
          ( member(X1,universal_class)
          & member(X1,X0)
          & disjoint(X1,X0) )
      | null_class = X0 ),
    inference(ennf_transformation,[],[f41]) ).

fof(f60,plain,
    ? [X0] :
      ( null_class != X0
      & ! [X3] : singleton(X3) != X0
      & ! [X1,X2] :
          ( X1 = X2
          | ~ member(X1,X0)
          | ~ member(X2,intersection(complement(singleton(X1)),X0)) ) ),
    inference(ennf_transformation,[],[f45]) ).

fof(f61,plain,
    ? [X0] :
      ( null_class != X0
      & ! [X3] : singleton(X3) != X0
      & ! [X1,X2] :
          ( X1 = X2
          | ~ member(X1,X0)
          | ~ member(X2,intersection(complement(singleton(X1)),X0)) ) ),
    inference(flattening,[],[f60]) ).

fof(f62,plain,
    ! [X2,X0,X1] :
      ( ~ subclass(X0,X1)
      | member(X2,X1)
      | ~ member(X2,X0) ),
    inference(cnf_transformation,[],[f47]) ).

fof(f63,plain,
    ! [X0,X1] :
      ( member(sK0(X0,X1),X0)
      | subclass(X0,X1) ),
    inference(cnf_transformation,[],[f47]) ).

fof(f64,plain,
    ! [X0,X1] :
      ( ~ member(sK0(X0,X1),X1)
      | subclass(X0,X1) ),
    inference(cnf_transformation,[],[f47]) ).

fof(f65,plain,
    ! [X0] : subclass(X0,universal_class),
    inference(cnf_transformation,[],[f2]) ).

fof(f68,plain,
    ! [X0,X1] :
      ( ~ subclass(X0,X1)
      | ~ subclass(X1,X0)
      | X0 = X1 ),
    inference(cnf_transformation,[],[f3]) ).

fof(f70,plain,
    ! [X2,X0,X1] :
      ( X0 != X1
      | ~ member(X0,universal_class)
      | member(X0,unordered_pair(X1,X2)) ),
    inference(cnf_transformation,[],[f4]) ).

fof(f71,plain,
    ! [X2,X0,X1] :
      ( ~ member(X0,unordered_pair(X1,X2))
      | X0 = X1
      | X0 = X2 ),
    inference(cnf_transformation,[],[f4]) ).

fof(f74,plain,
    ! [X0] : singleton(X0) = unordered_pair(X0,X0),
    inference(cnf_transformation,[],[f6]) ).

fof(f88,plain,
    ! [X2,X0,X1] :
      ( member(X2,intersection(X0,X1))
      | ~ member(X2,X0)
      | ~ member(X2,X1) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f91,plain,
    ! [X0,X1] :
      ( member(X1,complement(X0))
      | ~ member(X1,universal_class)
      | member(X1,X0) ),
    inference(cnf_transformation,[],[f14]) ).

fof(f144,plain,
    ! [X0] :
      ( member(sK4(X0),X0)
      | null_class = X0 ),
    inference(cnf_transformation,[],[f57]) ).

fof(f149,plain,
    ! [X2,X1] :
      ( ~ member(X2,intersection(complement(singleton(X1)),sK6))
      | ~ member(X1,sK6)
      | X1 = X2 ),
    inference(cnf_transformation,[],[f61]) ).

fof(f150,plain,
    ! [X3] : singleton(X3) != sK6,
    inference(cnf_transformation,[],[f61]) ).

fof(f151,plain,
    null_class != sK6,
    inference(cnf_transformation,[],[f61]) ).

fof(f189,plain,
    ! [X3] : sK6 != unordered_pair(X3,X3),
    inference(definition_unfolding,[],[f150,f74]) ).

fof(f190,plain,
    ! [X2,X1] :
      ( ~ member(X2,intersection(complement(unordered_pair(X1,X1)),sK6))
      | ~ member(X1,sK6)
      | X1 = X2 ),
    inference(definition_unfolding,[],[f149,f74]) ).

fof(f193,plain,
    ! [X2,X1] :
      ( member(X1,unordered_pair(X1,X2))
      | ~ member(X1,universal_class) ),
    inference(equality_resolution,[],[f70]) ).

fof(f283,plain,
    ! [X0,X1] :
      ( ~ member(X0,complement(unordered_pair(X1,X1)))
      | ~ member(X0,sK6)
      | ~ member(X1,sK6)
      | X0 = X1 ),
    inference(resolution,[],[f88,f190]) ).

fof(f385,plain,
    ! [X0,X1] :
      ( member(X0,unordered_pair(X1,X1))
      | ~ member(X1,sK6)
      | X0 = X1
      | ~ member(X0,universal_class)
      | ~ member(X0,sK6) ),
    inference(resolution,[],[f283,f91]) ).

fof(f393,plain,
    ! [X0,X1] :
      ( ~ member(sK0(X1,unordered_pair(X0,X0)),sK6)
      | sK0(X1,unordered_pair(X0,X0)) = X0
      | ~ member(sK0(X1,unordered_pair(X0,X0)),universal_class)
      | ~ member(X0,sK6)
      | subclass(X1,unordered_pair(X0,X0)) ),
    inference(resolution,[],[f385,f64]) ).

fof(f404,definition,
    ( spl7_17
  <=> member(sK4(sK6),sK6) ),
    introduced(definition,[new_symbols(definition,[spl7_17])],[avatar_definition]) ).

fof(f405,plain,
    ( member(sK4(sK6),sK6)
    | ~ spl7_17 ),
    inference(avatar_component_clause,[],[f404]) ).

fof(f406,plain,
    ( ~ member(sK4(sK6),sK6)
    | spl7_17 ),
    inference(avatar_component_clause,[],[f404]) ).

fof(f423,plain,
    ! [X0] :
      ( sK0(sK6,unordered_pair(X0,X0)) = X0
      | ~ member(sK0(sK6,unordered_pair(X0,X0)),universal_class)
      | ~ member(X0,sK6)
      | subclass(sK6,unordered_pair(X0,X0))
      | subclass(sK6,unordered_pair(X0,X0)) ),
    inference(resolution,[],[f393,f63]) ).

fof(f424,plain,
    ! [X0] :
      ( ~ member(sK0(sK6,unordered_pair(X0,X0)),universal_class)
      | sK0(sK6,unordered_pair(X0,X0)) = X0
      | ~ member(X0,sK6)
      | subclass(sK6,unordered_pair(X0,X0)) ),
    inference(duplicate_literal_removal,[],[f423]) ).

fof(f468,plain,
    ! [X0,X1] :
      ( ~ member(X0,X1)
      | member(X0,universal_class) ),
    inference(resolution,[],[f62,f65]) ).

fof(f516,plain,
    ! [X0,X1] :
      ( member(sK0(X0,X1),universal_class)
      | subclass(X0,X1) ),
    inference(resolution,[],[f468,f63]) ).

fof(f571,plain,
    ! [X0] :
      ( subclass(sK6,unordered_pair(X0,X0))
      | sK0(sK6,unordered_pair(X0,X0)) = X0
      | ~ member(X0,sK6)
      | subclass(sK6,unordered_pair(X0,X0)) ),
    inference(resolution,[],[f516,f424]) ).

fof(f577,plain,
    ! [X0] :
      ( ~ member(X0,sK6)
      | sK0(sK6,unordered_pair(X0,X0)) = X0
      | subclass(sK6,unordered_pair(X0,X0)) ),
    inference(duplicate_literal_removal,[],[f571]) ).

fof(f1137,plain,
    ! [X2,X0,X1] :
      ( subclass(unordered_pair(X0,X1),X2)
      | sK0(unordered_pair(X0,X1),X2) = X1
      | sK0(unordered_pair(X0,X1),X2) = X0 ),
    inference(resolution,[],[f71,f63]) ).

fof(f1800,definition,
    ( spl7_89
  <=> subclass(sK6,unordered_pair(sK4(sK6),sK4(sK6))) ),
    introduced(definition,[new_symbols(definition,[spl7_89])],[avatar_definition]) ).

fof(f1802,plain,
    ( subclass(sK6,unordered_pair(sK4(sK6),sK4(sK6)))
    | ~ spl7_89 ),
    inference(avatar_component_clause,[],[f1800]) ).

fof(f1804,definition,
    ( spl7_90
  <=> sK4(sK6) = sK0(sK6,unordered_pair(sK4(sK6),sK4(sK6))) ),
    introduced(definition,[new_symbols(definition,[spl7_90])],[avatar_definition]) ).

fof(f1806,plain,
    ( sK4(sK6) = sK0(sK6,unordered_pair(sK4(sK6),sK4(sK6)))
    | ~ spl7_90 ),
    inference(avatar_component_clause,[],[f1804]) ).

fof(f1809,plain,
    ( null_class = sK6
    | spl7_17 ),
    inference(resolution,[],[f406,f144]) ).

fof(f1810,plain,
    ( $false
    | spl7_17 ),
    inference(forward_subsumption_resolution,[],[f1809,f151]) ).

fof(f1811,plain,
    spl7_17,
    inference(avatar_contradiction_clause,[],[f1810]) ).

fof(f1815,plain,
    ( sK4(sK6) = sK0(sK6,unordered_pair(sK4(sK6),sK4(sK6)))
    | subclass(sK6,unordered_pair(sK4(sK6),sK4(sK6)))
    | ~ spl7_17 ),
    inference(resolution,[],[f405,f577]) ).

fof(f1818,plain,
    ( spl7_89
    | spl7_90
    | ~ spl7_17 ),
    inference(avatar_split_clause,[],[f1815,f404,f1804,f1800]) ).

fof(f1892,plain,
    ( ~ member(sK4(sK6),unordered_pair(sK4(sK6),sK4(sK6)))
    | subclass(sK6,unordered_pair(sK4(sK6),sK4(sK6)))
    | ~ spl7_90 ),
    inference(superposition,[],[f64,f1806]) ).

fof(f1896,definition,
    ( spl7_98
  <=> member(sK4(sK6),unordered_pair(sK4(sK6),sK4(sK6))) ),
    introduced(definition,[new_symbols(definition,[spl7_98])],[avatar_definition]) ).

fof(f1898,plain,
    ( ~ member(sK4(sK6),unordered_pair(sK4(sK6),sK4(sK6)))
    | spl7_98 ),
    inference(avatar_component_clause,[],[f1896]) ).

fof(f1899,plain,
    ( spl7_89
    | ~ spl7_98
    | ~ spl7_90 ),
    inference(avatar_split_clause,[],[f1892,f1804,f1896,f1800]) ).

fof(f1915,plain,
    ( member(sK4(sK6),universal_class)
    | ~ spl7_17 ),
    inference(resolution,[],[f468,f405]) ).

fof(f1992,plain,
    ( ~ member(sK4(sK6),universal_class)
    | spl7_98 ),
    inference(resolution,[],[f1898,f193]) ).

fof(f1998,plain,
    ( $false
    | ~ spl7_17
    | spl7_98 ),
    inference(forward_subsumption_resolution,[],[f1992,f1915]) ).

fof(f1999,plain,
    ( ~ spl7_17
    | spl7_98 ),
    inference(avatar_contradiction_clause,[],[f1998]) ).

fof(f2001,plain,
    ( ~ subclass(unordered_pair(sK4(sK6),sK4(sK6)),sK6)
    | sK6 = unordered_pair(sK4(sK6),sK4(sK6))
    | ~ spl7_89 ),
    inference(resolution,[],[f1802,f68]) ).

fof(f2003,plain,
    ( ~ subclass(unordered_pair(sK4(sK6),sK4(sK6)),sK6)
    | ~ spl7_89 ),
    inference(forward_subsumption_resolution,[],[f2001,f189]) ).

fof(f7695,plain,
    ( sK4(sK6) = sK0(unordered_pair(sK4(sK6),sK4(sK6)),sK6)
    | sK4(sK6) = sK0(unordered_pair(sK4(sK6),sK4(sK6)),sK6)
    | ~ spl7_89 ),
    inference(resolution,[],[f1137,f2003]) ).

fof(f7703,plain,
    ( sK4(sK6) = sK0(unordered_pair(sK4(sK6),sK4(sK6)),sK6)
    | ~ spl7_89 ),
    inference(duplicate_literal_removal,[],[f7695]) ).

fof(f7707,plain,
    ( ~ member(sK4(sK6),sK6)
    | subclass(unordered_pair(sK4(sK6),sK4(sK6)),sK6)
    | ~ spl7_89 ),
    inference(superposition,[],[f64,f7703]) ).

fof(f7709,plain,
    ( subclass(unordered_pair(sK4(sK6),sK4(sK6)),sK6)
    | ~ spl7_17
    | ~ spl7_89 ),
    inference(forward_subsumption_resolution,[],[f7707,f405]) ).

fof(f7710,plain,
    ( $false
    | ~ spl7_17
    | ~ spl7_89 ),
    inference(forward_subsumption_resolution,[],[f7709,f2003]) ).

fof(f7711,plain,
    ( ~ spl7_17
    | ~ spl7_89 ),
    inference(avatar_contradiction_clause,[],[f7710]) ).

cnf(s87,plain,
    spl7_17,
    inference(sat_conversion,[],[f1811]) ).

cnf(s88,plain,
    ( ~ spl7_17
    | spl7_89
    | spl7_90 ),
    inference(sat_conversion,[],[f1818]) ).

cnf(s96,plain,
    ( spl7_89
    | ~ spl7_90
    | ~ spl7_98 ),
    inference(sat_conversion,[],[f1899]) ).

cnf(s113,plain,
    ( ~ spl7_17
    | spl7_98 ),
    inference(sat_conversion,[],[f1999]) ).

cnf(s301,plain,
    ( ~ spl7_17
    | ~ spl7_89 ),
    inference(sat_conversion,[],[f7711]) ).

cnf(s319,plain,
    ~ spl7_89,
    inference(rat,[],[s301,s87]) ).

cnf(s320,plain,
    spl7_98,
    inference(rat,[],[s113,s87]) ).

cnf(s322,plain,
    ~ spl7_90,
    inference(rat,[],[s96,s320,s319]) ).

cnf(s323,plain,
    $false,
    inference(rat,[],[s88,s87,s322,s319]) ).

fof(f7712,plain,
    $false,
    inference(avatar_sat_refutation,[],[s323]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET099+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.37  % Computer : n009.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.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Mon Sep 28 00:41:15 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41  Running first-order model finding
% 0.12/0.41  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
% 1.73/0.76  % (2569230)Will run a generic schedule for satisfiability detection.
% 1.73/0.76  % (2569235)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1754572902_2999 on theBenchmark for (2999ds/0Mi)
% 1.73/0.76  % (2569236)% WARNING: option uhcvi not known.
% 1.73/0.76  % (2569238)dis+10_1_sil=32000:sp=arity:random_seed=748254023:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.73/0.76  % (2569236)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1657201890:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.73/0.76  % (2569240)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=52286141:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.73/0.76  % (2569237)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=959688452:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.73/0.76  % (2569239)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3142455617:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.73/0.76  % (2569241)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2563236521:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.73/0.76  % TRYING [1]
% 1.73/0.76  % TRYING [2]
% 1.73/0.76  % TRYING [3]
% 1.73/0.76  % TRYING [4]
% 1.73/0.76  % (2569238)Instruction limit reached! 
% 1.73/0.76  % (2569238)------------------------------
% 1.73/0.76  % (2569238)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.73/0.76  % (2569238)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.73/0.76  % (2569238)CaDiCaL version: 2.1.3
% 1.73/0.76  % (2569238)Termination reason: Instruction limit
% 1.73/0.76  % (2569238)Termination phase: Saturation
% 1.73/0.76  % (2569238)Time elapsed: 0.068 s
% 1.73/0.76  % (2569238)Peak memory usage: 13 MB
% 1.73/0.76  % (2569238)Instructions burned: 104 (million)
% 1.73/0.76  % (2569239)Instruction limit reached! 
% 1.73/0.76  % (2569239)------------------------------
% 1.73/0.76  % (2569239)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.73/0.76  % (2569239)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.73/0.76  % (2569239)CaDiCaL version: 2.1.3
% 1.73/0.76  % (2569239)Termination reason: Instruction limit
% 1.73/0.76  % (2569239)Termination phase: Saturation
% 1.73/0.76  % (2569239)Time elapsed: 0.072 s
% 1.73/0.76  % (2569239)Peak memory usage: 13 MB
% 1.73/0.76  % (2569239)Instructions burned: 117 (million)
% 1.73/0.76  % (2569240)Instruction limit reached! 
% 1.73/0.76  % (2569240)------------------------------
% 1.73/0.76  % (2569240)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.73/0.76  % (2569240)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.73/0.76  % (2569240)CaDiCaL version: 2.1.3
% 1.73/0.76  % (2569240)Termination reason: Instruction limit
% 1.73/0.76  % (2569240)Termination phase: Saturation
% 1.73/0.76  % (2569240)Time elapsed: 0.082 s
% 1.73/0.76  % (2569240)Peak memory usage: 13 MB
% 1.73/0.76  % (2569240)Instructions burned: 131 (million)
% 1.73/0.76  % (2569249)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1779601766:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.73/0.76  % (2569250)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3262392055:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.73/0.76  % (2569251)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=2290701069:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.73/0.76  % (2569241)Instruction limit reached! 
% 1.73/0.76  % (2569241)------------------------------
% 1.73/0.76  % (2569241)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.73/0.76  % (2569241)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.73/0.76  % (2569241)CaDiCaL version: 2.1.3
% 1.73/0.76  % (2569241)Termination reason: Instruction limit
% 1.73/0.76  % (2569241)Termination phase: Saturation
% 1.73/0.76  % (2569241)Time elapsed: 0.104 s
% 1.73/0.76  % (2569241)Peak memory usage: 14 MB
% 1.73/0.76  % (2569241)Instructions burned: 160 (million)
% 1.73/0.76  % TRYING [1]
% 1.73/0.76  % TRYING [2]
% 1.73/0.76  % (2569255)ott-21_1_sil=16000:fs=off:random_seed=587245605:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.73/0.76  % TRYING [3]
% 1.73/0.76  % TRYING [5]
% 1.73/0.76  % (2569250)Instruction limit reached! 
% 1.73/0.76  % (2569250)------------------------------
% 1.73/0.76  % (2569250)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.73/0.76  % (2569250)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.73/0.76  % (2569250)CaDiCaL version: 2.1.3
% 1.73/0.76  % (2569250)Termination reason: Instruction limit
% 1.73/0.76  % (2569250)Termination phase: Saturation
% 1.73/0.76  % (2569250)Time elapsed: 0.077 s
% 1.73/0.76  % (2569250)Peak memory usage: 13 MB
% 1.73/0.76  % (2569250)Instructions burned: 132 (million)
% 1.73/0.76  % TRYING [4]
% 1.73/0.76  % (2569257)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2995642164:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 1.73/0.76  % (2569255)Instruction limit reached! 
% 1.73/0.76  % (2569255)------------------------------
% 1.73/0.76  % (2569255)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.73/0.76  % (2569255)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.73/0.76  % (2569255)CaDiCaL version: 2.1.3
% 1.73/0.76  % (2569255)Termination reason: Instruction limit
% 1.73/0.76  % (2569255)Termination phase: Saturation
% 1.73/0.76  % (2569255)Time elapsed: 0.098 s
% 1.73/0.76  % (2569255)Peak memory usage: 13 MB
% 1.73/0.76  % (2569255)Instructions burned: 180 (million)
% 1.73/0.76  % (2569259)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=103150173:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 1.73/0.76  % TRYING [1]
% 1.73/0.76  % TRYING [2]
% 1.73/0.76  % (2569251) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2569230-2569251"...
% 1.73/0.76  % (2569251)...printing done.
% 1.73/0.76  % (2569251)Refutation found. Thanks to Tanya!
% 1.73/0.76  % SZS status Theorem for theBenchmark
% 1.73/0.76  % SZS output start Proof for theBenchmark
% See solution above
% 1.73/0.76  % (2569251)------------------------------
% 1.73/0.76  % (2569251)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.73/0.76  % (2569251)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.73/0.76  % (2569251)CaDiCaL version: 2.1.3
% 1.73/0.76  % (2569251)Termination reason: Refutation
% 1.73/0.76  % (2569251)Time elapsed: 0.195 s
% 1.73/0.76  % (2569251)Peak memory usage: 16 MB
% 1.73/0.76  % (2569251)Instructions burned: 287 (million)
% 1.73/0.76  % (2569230)Success in time 0.337 s
% 1.73/0.76  % Vampire exiting
%------------------------------------------------------------------------------