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

% Computer : n026.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:42:33 PM UTC 2026

% Result   : Theorem 5.95s 1.34s
% Output   : Refutation 5.95s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   79 (  21 unt;   7 def)
%            Number of atoms       :  195 (  28 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :  199 (  83   ~;  89   |;  19   &)
%                                         (   8 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   5 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   70 (   0 sgn  66   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1,X2] :
      ( member(X2,intersection(X0,X1))
    <=> ( member(X2,X0)
        & member(X2,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_defn) ).

fof(f2,axiom,
    ! [X0,X1,X2] :
      ( member(X2,difference(X0,X1))
    <=> ( member(X2,X0)
        & ~ member(X2,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference_defn) ).

fof(f7,axiom,
    ! [X0,X1] :
      ( X0 = X1
    <=> ! [X2] :
          ( member(X2,X0)
        <=> member(X2,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_member_defn) ).

fof(f8,conjecture,
    ! [X0,X1] : difference(X0,difference(X0,X1)) = intersection(X0,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_difference_difference_intersection) ).

fof(f9,negated_conjecture,
    ~ ! [X0,X1] : difference(X0,difference(X0,X1)) = intersection(X0,X1),
    inference(negated_conjecture,[status(cth)],[f8]) ).

fof(f11,plain,
    ? [X0,X1] : intersection(X0,X1) != difference(X0,difference(X0,X1)),
    inference(ennf_transformation,[],[f9]) ).

fof(f12,plain,
    ! [X0,X1,X2] :
      ( ( member(X2,intersection(X0,X1))
        | ~ member(X2,X0)
        | ~ member(X2,X1) )
      & ( ( member(X2,X0)
          & member(X2,X1) )
        | ~ member(X2,intersection(X0,X1)) ) ),
    inference(nnf_transformation,[],[f1]) ).

fof(f13,plain,
    ! [X0,X1,X2] :
      ( ( member(X2,intersection(X0,X1))
        | ~ member(X2,X0)
        | ~ member(X2,X1) )
      & ( ( member(X2,X0)
          & member(X2,X1) )
        | ~ member(X2,intersection(X0,X1)) ) ),
    inference(flattening,[],[f12]) ).

fof(f14,plain,
    ! [X0,X1,X2] :
      ( ( member(X2,difference(X0,X1))
        | ~ member(X2,X0)
        | member(X2,X1) )
      & ( ( member(X2,X0)
          & ~ member(X2,X1) )
        | ~ member(X2,difference(X0,X1)) ) ),
    inference(nnf_transformation,[],[f2]) ).

fof(f15,plain,
    ! [X0,X1,X2] :
      ( ( member(X2,difference(X0,X1))
        | ~ member(X2,X0)
        | member(X2,X1) )
      & ( ( member(X2,X0)
          & ~ member(X2,X1) )
        | ~ member(X2,difference(X0,X1)) ) ),
    inference(flattening,[],[f14]) ).

fof(f21,plain,
    ! [X0,X1] :
      ( ( X0 = X1
        | ? [X2] :
            ( ( ~ member(X2,X1)
              | ~ member(X2,X0) )
            & ( member(X2,X1)
              | member(X2,X0) ) ) )
      & ( ! [X2] :
            ( ( member(X2,X0)
              | ~ member(X2,X1) )
            & ( member(X2,X1)
              | ~ member(X2,X0) ) )
        | X0 != X1 ) ),
    inference(nnf_transformation,[],[f7]) ).

fof(f22,plain,
    ! [X0,X1] :
      ( ( X0 = X1
        | ? [X2] :
            ( ( ~ member(X2,X1)
              | ~ member(X2,X0) )
            & ( member(X2,X1)
              | member(X2,X0) ) ) )
      & ( ! [X3] :
            ( ( member(X3,X0)
              | ~ member(X3,X1) )
            & ( member(X3,X1)
              | ~ member(X3,X0) ) )
        | X0 != X1 ) ),
    inference(rectify,[],[f21]) ).

fof(f23,plain,
    ! [X0,X1] :
      ( ( X0 = X1
        | ( ( ~ member(sK1(X0,X1),X1)
            | ~ member(sK1(X0,X1),X0) )
          & ( member(sK1(X0,X1),X1)
            | member(sK1(X0,X1),X0) ) ) )
      & ( ! [X3] :
            ( ( member(X3,X0)
              | ~ member(X3,X1) )
            & ( member(X3,X1)
              | ~ member(X3,X0) ) )
        | X0 != X1 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X2,sK1(X0,X1))],[f22]) ).

fof(f24,plain,
    intersection(sK2,sK3) != difference(sK2,difference(sK2,sK3)),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X1,sK3)],[f11]) ).

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

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

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

fof(f28,plain,
    ! [X2,X0,X1] :
      ( ~ member(X2,difference(X0,X1))
      | ~ member(X2,X1) ),
    inference(cnf_transformation,[],[f15]) ).

fof(f29,plain,
    ! [X2,X0,X1] :
      ( ~ member(X2,difference(X0,X1))
      | member(X2,X0) ),
    inference(cnf_transformation,[],[f15]) ).

fof(f30,plain,
    ! [X2,X0,X1] :
      ( member(X2,difference(X0,X1))
      | ~ member(X2,X0)
      | member(X2,X1) ),
    inference(cnf_transformation,[],[f15]) ).

fof(f41,plain,
    ! [X0,X1] :
      ( member(sK1(X0,X1),X1)
      | member(sK1(X0,X1),X0)
      | X0 = X1 ),
    inference(cnf_transformation,[],[f23]) ).

fof(f42,plain,
    ! [X0,X1] :
      ( ~ member(sK1(X0,X1),X1)
      | X0 = X1
      | ~ member(sK1(X0,X1),X0) ),
    inference(cnf_transformation,[],[f23]) ).

fof(f43,plain,
    intersection(sK2,sK3) != difference(sK2,difference(sK2,sK3)),
    inference(cnf_transformation,[],[f24]) ).

fof(f48,definition,
    sF4 = intersection(sK2,sK3),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

fof(f49,plain,
    intersection(sK2,sK3) = sF4,
    inference(reorient_equations,[],[f48]) ).

fof(f50,definition,
    sF5 = difference(sK2,sK3),
    introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).

fof(f51,plain,
    difference(sK2,sK3) = sF5,
    inference(reorient_equations,[],[f50]) ).

fof(f52,definition,
    sF6 = difference(sK2,sF5),
    introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).

fof(f53,plain,
    difference(sK2,sF5) = sF6,
    inference(reorient_equations,[],[f52]) ).

fof(f54,plain,
    sF4 != sF6,
    inference(definition_folding,[],[f43,f53,f51,f49]) ).

fof(f55,plain,
    ! [X0] :
      ( ~ member(X0,sF4)
      | member(X0,sK3) ),
    inference(superposition,[],[f25,f49]) ).

fof(f58,plain,
    ! [X0] :
      ( ~ member(X0,sF4)
      | member(X0,sK2) ),
    inference(superposition,[],[f26,f49]) ).

fof(f61,plain,
    ! [X0] :
      ( ~ member(X0,sF5)
      | ~ member(X0,sK3) ),
    inference(superposition,[],[f28,f51]) ).

fof(f62,plain,
    ! [X0] :
      ( ~ member(X0,sF6)
      | ~ member(X0,sF5) ),
    inference(superposition,[],[f28,f53]) ).

fof(f64,plain,
    ! [X0] :
      ( ~ member(X0,sF6)
      | member(X0,sK2) ),
    inference(superposition,[],[f29,f53]) ).

fof(f72,plain,
    ! [X0] :
      ( ~ member(X0,sK3)
      | ~ member(X0,sK2)
      | member(X0,sF4) ),
    inference(superposition,[],[f27,f49]) ).

fof(f78,plain,
    ! [X0] :
      ( ~ member(X0,sK2)
      | member(X0,sF5)
      | member(X0,sK3) ),
    inference(superposition,[],[f30,f51]) ).

fof(f79,plain,
    ! [X0] :
      ( ~ member(X0,sK2)
      | member(X0,sF6)
      | member(X0,sF5) ),
    inference(superposition,[],[f30,f53]) ).

fof(f85,plain,
    ! [X0] :
      ( member(sK1(X0,sF4),sK2)
      | member(sK1(X0,sF4),X0)
      | sF4 = X0 ),
    inference(resolution,[],[f41,f58]) ).

fof(f86,plain,
    ! [X0] :
      ( member(sK1(X0,sF4),sK3)
      | member(sK1(X0,sF4),X0)
      | sF4 = X0 ),
    inference(resolution,[],[f41,f55]) ).

fof(f134,plain,
    ( member(sK1(sF6,sF4),sK2)
    | sF4 = sF6
    | member(sK1(sF6,sF4),sK2) ),
    inference(resolution,[],[f85,f64]) ).

fof(f137,plain,
    ( member(sK1(sF6,sF4),sK2)
    | sF4 = sF6 ),
    inference(duplicate_literal_removal,[],[f134]) ).

fof(f149,plain,
    member(sK1(sF6,sF4),sK2),
    inference(forward_subsumption_resolution,[],[f137,f54]) ).

fof(f154,plain,
    ( member(sK1(sF6,sF4),sF6)
    | member(sK1(sF6,sF4),sF5) ),
    inference(resolution,[],[f149,f79]) ).

fof(f155,plain,
    ( member(sK1(sF6,sF4),sF5)
    | member(sK1(sF6,sF4),sK3) ),
    inference(resolution,[],[f149,f78]) ).

fof(f158,definition,
    ( spl7_3
  <=> member(sK1(sF6,sF4),sK3) ),
    introduced(definition,[new_symbols(definition,[spl7_3])],[avatar_definition]) ).

fof(f160,plain,
    ( member(sK1(sF6,sF4),sK3)
    | ~ spl7_3 ),
    inference(avatar_component_clause,[],[f158]) ).

fof(f162,definition,
    ( spl7_4
  <=> member(sK1(sF6,sF4),sF5) ),
    introduced(definition,[new_symbols(definition,[spl7_4])],[avatar_definition]) ).

fof(f164,plain,
    ( member(sK1(sF6,sF4),sF5)
    | ~ spl7_4 ),
    inference(avatar_component_clause,[],[f162]) ).

fof(f165,plain,
    ( spl7_3
    | spl7_4 ),
    inference(avatar_split_clause,[],[f155,f162,f158]) ).

fof(f167,definition,
    ( spl7_5
  <=> member(sK1(sF6,sF4),sF6) ),
    introduced(definition,[new_symbols(definition,[spl7_5])],[avatar_definition]) ).

fof(f169,plain,
    ( member(sK1(sF6,sF4),sF6)
    | ~ spl7_5 ),
    inference(avatar_component_clause,[],[f167]) ).

fof(f170,plain,
    ( spl7_4
    | spl7_5 ),
    inference(avatar_split_clause,[],[f154,f167,f162]) ).

fof(f440,definition,
    ( spl7_15
  <=> member(sK1(sF6,sF4),sF4) ),
    introduced(definition,[new_symbols(definition,[spl7_15])],[avatar_definition]) ).

fof(f441,plain,
    ( ~ member(sK1(sF6,sF4),sF4)
    | spl7_15 ),
    inference(avatar_component_clause,[],[f440]) ).

fof(f442,plain,
    ( member(sK1(sF6,sF4),sF4)
    | ~ spl7_15 ),
    inference(avatar_component_clause,[],[f440]) ).

fof(f826,plain,
    ( sF4 = sF6
    | ~ member(sK1(sF6,sF4),sF6)
    | ~ spl7_15 ),
    inference(resolution,[],[f442,f42]) ).

fof(f841,plain,
    ( ~ member(sK1(sF6,sF4),sF6)
    | ~ spl7_15 ),
    inference(forward_subsumption_resolution,[],[f826,f54]) ).

fof(f860,plain,
    ( $false
    | ~ spl7_5
    | ~ spl7_15 ),
    inference(forward_subsumption_resolution,[],[f841,f169]) ).

fof(f861,plain,
    ( ~ spl7_5
    | ~ spl7_15 ),
    inference(avatar_contradiction_clause,[],[f860]) ).

fof(f884,plain,
    ( ~ member(sK1(sF6,sF4),sK2)
    | member(sK1(sF6,sF4),sF4)
    | ~ spl7_3 ),
    inference(resolution,[],[f160,f72]) ).

fof(f886,plain,
    ( member(sK1(sF6,sF4),sF4)
    | ~ spl7_3 ),
    inference(forward_subsumption_resolution,[],[f884,f149]) ).

fof(f887,plain,
    ( $false
    | ~ spl7_3
    | spl7_15 ),
    inference(forward_subsumption_resolution,[],[f886,f441]) ).

fof(f888,plain,
    ( ~ spl7_3
    | spl7_15 ),
    inference(avatar_contradiction_clause,[],[f887]) ).

fof(f919,plain,
    ( member(sK1(sF6,sF4),sK3)
    | sF4 = sF6
    | ~ member(sK1(sF6,sF4),sF5) ),
    inference(resolution,[],[f86,f62]) ).

fof(f923,plain,
    ( sF4 = sF6
    | ~ member(sK1(sF6,sF4),sF5) ),
    inference(forward_subsumption_resolution,[],[f919,f61]) ).

fof(f925,plain,
    ~ member(sK1(sF6,sF4),sF5),
    inference(forward_subsumption_resolution,[],[f923,f54]) ).

fof(f926,plain,
    ( $false
    | ~ spl7_4 ),
    inference(forward_subsumption_resolution,[],[f925,f164]) ).

fof(f927,plain,
    ~ spl7_4,
    inference(avatar_contradiction_clause,[],[f926]) ).

cnf(s2,plain,
    ( spl7_3
    | spl7_4 ),
    inference(sat_conversion,[],[f165]) ).

cnf(s3,plain,
    ( spl7_4
    | spl7_5 ),
    inference(sat_conversion,[],[f170]) ).

cnf(s28,plain,
    ( ~ spl7_5
    | ~ spl7_15 ),
    inference(sat_conversion,[],[f861]) ).

cnf(s29,plain,
    ( ~ spl7_3
    | spl7_15 ),
    inference(sat_conversion,[],[f888]) ).

cnf(s30,plain,
    ~ spl7_4,
    inference(sat_conversion,[],[f927]) ).

cnf(s31,plain,
    spl7_5,
    inference(rat,[],[s3,s30]) ).

cnf(s32,plain,
    ~ spl7_15,
    inference(rat,[],[s28,s31]) ).

cnf(s33,plain,
    ~ spl7_3,
    inference(rat,[],[s29,s32]) ).

cnf(s35,plain,
    $false,
    inference(rat,[],[s2,s30,s33]) ).

fof(f928,plain,
    $false,
    inference(avatar_sat_refutation,[],[s35]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SET011+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.07  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.15/0.41  % Computer : n026.cluster.edu
% 0.15/0.41  % Model    : x86_64 x86_64
% 0.15/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41  % Memory   : 8046.5625MB
% 0.15/0.41  % OS       : Linux 6.8.0-71-generic
% 0.15/0.41  % CPULimit : 300
% 0.15/0.41  % WCLimit  : 300
% 0.15/0.42  % DateTime : Mon Sep 28 00:05:56 UTC 2026
% 0.15/0.42  % CPUTime  : 
% 0.15/0.42  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.15/0.47  Running first-order model finding
% 0.15/0.47  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
% 5.95/1.34  % (3351287)Will run a generic schedule for satisfiability detection.
% 5.95/1.34  % (3351294)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1103633328:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 5.95/1.34  % (3351298)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3708797547:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 5.95/1.34  % (3351293)% WARNING: option uhcvi not known.
% 5.95/1.34  % (3351292)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2121752820_3000 on theBenchmark for (3000ds/0Mi)
% 5.95/1.34  % (3351293)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4038358925:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 5.95/1.34  % (3351295)dis+10_1_sil=32000:sp=arity:random_seed=3412254457:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 5.95/1.34  % (3351296)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1277554647:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 5.95/1.34  % (3351297)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1682731597:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 5.95/1.34  % TRYING [1]
% 5.95/1.34  % TRYING [2]
% 5.95/1.34  % TRYING [3]
% 5.95/1.34  % TRYING [4]
% 5.95/1.34  % TRYING [5]
% 5.95/1.34  % (3351295)Instruction limit reached! 
% 5.95/1.34  % (3351295)------------------------------
% 5.95/1.34  % (3351295)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.95/1.34  % (3351295)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.95/1.34  % (3351295)CaDiCaL version: 2.1.3
% 5.95/1.34  % (3351295)Termination reason: Instruction limit
% 5.95/1.34  % (3351295)Termination phase: Saturation
% 5.95/1.34  % (3351295)Time elapsed: 0.101 s
% 5.95/1.34  % (3351295)Peak memory usage: 12 MB
% 5.95/1.34  % (3351295)Instructions burned: 103 (million)
% 5.95/1.34  % (3351296)Instruction limit reached! 
% 5.95/1.34  % (3351296)------------------------------
% 5.95/1.34  % (3351296)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.95/1.34  % (3351296)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.95/1.34  % (3351296)CaDiCaL version: 2.1.3
% 5.95/1.34  % (3351296)Termination reason: Instruction limit
% 5.95/1.34  % (3351296)Termination phase: Saturation
% 5.95/1.34  % (3351296)Time elapsed: 0.107 s
% 5.95/1.34  % (3351296)Peak memory usage: 12 MB
% 5.95/1.34  % (3351296)Instructions burned: 116 (million)
% 5.95/1.34  % (3351297)Instruction limit reached! 
% 5.95/1.34  % (3351297)------------------------------
% 5.95/1.34  % (3351297)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.95/1.34  % (3351297)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.95/1.34  % (3351297)CaDiCaL version: 2.1.3
% 5.95/1.34  % (3351297)Termination reason: Instruction limit
% 5.95/1.34  % (3351297)Termination phase: Saturation
% 5.95/1.34  % (3351297)Time elapsed: 0.123 s
% 5.95/1.34  % (3351297)Peak memory usage: 12 MB
% 5.95/1.34  % (3351297)Instructions burned: 131 (million)
% 5.95/1.34  % (3351306)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3772674907:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 5.95/1.34  % TRYING [1]
% 5.95/1.34  % TRYING [2]
% 5.95/1.34  % TRYING [3]
% 5.95/1.34  % (3351307)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=4042768171:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 5.95/1.34  % (3351298)Instruction limit reached! 
% 5.95/1.34  % (3351298)------------------------------
% 5.95/1.34  % (3351298)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.95/1.34  % (3351298)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.95/1.34  % TRYING [4]
% 5.95/1.34  % (3351298)CaDiCaL version: 2.1.3
% 5.95/1.34  % (3351298)Termination reason: Instruction limit
% 5.95/1.34  % (3351298)Termination phase: Saturation
% 5.95/1.34  % (3351298)Time elapsed: 0.151 s
% 5.95/1.34  % (3351298)Peak memory usage: 13 MB
% 5.95/1.34  % (3351298)Instructions burned: 160 (million)
% 5.95/1.34  % TRYING [6]
% 5.95/1.34  % (3351308)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=2154825937:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 5.95/1.34  % (3351311)ott-21_1_sil=16000:fs=off:random_seed=2139314026:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 5.95/1.34  % TRYING [5]
% 5.95/1.34  % (3351307)Instruction limit reached! 
% 5.95/1.34  % (3351307)------------------------------
% 5.95/1.34  % (3351307)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.95/1.34  % (3351307)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.95/1.34  % (3351307)CaDiCaL version: 2.1.3
% 5.95/1.34  % (3351307)Termination reason: Instruction limit
% 5.95/1.34  % (3351307)Termination phase: Saturation
% 5.95/1.34  % (3351307)Time elapsed: 0.141 s
% 5.95/1.34  % (3351307)Peak memory usage: 13 MB
% 5.95/1.34  % (3351307)Instructions burned: 131 (million)
% 5.95/1.34  % (3351314)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=229038828:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 5.95/1.34  % (3351311)Instruction limit reached! 
% 5.95/1.34  % (3351311)------------------------------
% 5.95/1.34  % (3351311)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.95/1.34  % (3351311)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.95/1.34  % (3351311)CaDiCaL version: 2.1.3
% 5.95/1.34  % (3351311)Termination reason: Instruction limit
% 5.95/1.34  % (3351311)Termination phase: Saturation
% 5.95/1.34  % (3351311)Time elapsed: 0.154 s
% 5.95/1.34  % (3351311)Peak memory usage: 12 MB
% 5.95/1.34  % (3351311)Instructions burned: 181 (million)
% 5.95/1.34  % (3351316)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1294104071:fmbsr=1.3:i=865:ins=25_2996 on theBenchmark for (2996ds/865Mi)
% 5.95/1.34  % TRYING [1]
% 5.95/1.34  % TRYING [2]
% 5.95/1.34  % TRYING [3]
% 5.95/1.34  % TRYING [4]
% 5.95/1.34  % TRYING [5]
% 5.95/1.34  % TRYING [6]
% 5.95/1.34  % TRYING [7]
% 5.95/1.34  % TRYING [7]
% 5.95/1.34  % TRYING [8]
% 5.95/1.34  % TRYING [6]
% 5.95/1.34  % (3351306)Instruction limit reached! 
% 5.95/1.34  % (3351306)------------------------------
% 5.95/1.34  % (3351306)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.95/1.34  % (3351306)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.95/1.34  % (3351306)CaDiCaL version: 2.1.3
% 5.95/1.34  % (3351306)Termination reason: Instruction limit
% 5.95/1.34  % (3351306)Termination phase: Finite model building constraint generation
% 5.95/1.34  % (3351306)Time elapsed: 0.626 s
% 5.95/1.34  % (3351306)Peak memory usage: 13 MB
% 5.95/1.34  % (3351306)Instructions burned: 715 (million)
% 5.95/1.34  % (3351308)Instruction limit reached! 
% 5.95/1.34  % (3351308)------------------------------
% 5.95/1.34  % (3351308)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.95/1.34  % (3351308)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.95/1.34  % (3351308)CaDiCaL version: 2.1.3
% 5.95/1.34  % (3351308)Termination reason: Instruction limit
% 5.95/1.34  % (3351308)Termination phase: Saturation
% 5.95/1.34  % (3351308)Time elapsed: 0.620 s
% 5.95/1.34  % (3351308)Peak memory usage: 17 MB
% 5.95/1.34  % (3351308)Instructions burned: 684 (million)
% 5.95/1.34  % (3351318)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1251578236:i=1179_2992 on theBenchmark for (2992ds/1179Mi)
% 5.95/1.34  % (3351314)Instruction limit reached! 
% 5.95/1.34  % (3351314)------------------------------
% 5.95/1.34  % (3351314)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.95/1.34  % (3351314)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.95/1.34  % (3351314)CaDiCaL version: 2.1.3
% 5.95/1.34  % (3351314)Termination reason: Instruction limit
% 5.95/1.34  % (3351314)Termination phase: Saturation
% 5.95/1.34  % (3351314)Time elapsed: 0.467 s
% 5.95/1.34  % (3351314)Peak memory usage: 15 MB
% 5.95/1.34  % (3351314)Instructions burned: 477 (million)
% 5.95/1.34  % (3351319)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=529646415:i=889:ins=1_2991 on theBenchmark for (2991ds/889Mi)
% 5.95/1.34  % (3351318) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3351287-3351318"...
% 5.95/1.34  % (3351321)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=3949980402:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2991 on theBenchmark for (2991ds/692Mi)
% 5.95/1.34  % (3351318)...printing done.
% 5.95/1.34  % (3351318)Refutation found. Thanks to Tanya!
% 5.95/1.34  % SZS status Theorem for theBenchmark
% 5.95/1.34  % SZS output start Proof for theBenchmark
% See solution above
% 5.95/1.34  % (3351318)------------------------------
% 5.95/1.34  % (3351318)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.95/1.34  % (3351318)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.95/1.34  % (3351318)CaDiCaL version: 2.1.3
% 5.95/1.34  % (3351318)Termination reason: Refutation
% 5.95/1.34  % (3351318)Time elapsed: 0.034 s
% 5.95/1.34  % (3351318)Peak memory usage: 13 MB
% 5.95/1.34  % (3351318)Instructions burned: 44 (million)
% 5.95/1.34  % (3351287)Success in time 0.86 s
% 5.95/1.34  % Vampire exiting
%------------------------------------------------------------------------------