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

% Computer : n006.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:52:37 PM UTC 2026

% Result   : Theorem 2.25s 0.94s
% Output   : Refutation 2.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   78 (  24 unt;   1 def)
%            Number of atoms       :  209 (   2 equ)
%            Maximal formula atoms :   13 (   2 avg)
%            Number of connectives :  231 ( 100   ~;  89   |;  24   &)
%                                         (   2 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   74 (  70   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f51,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(f85,axiom,
    ! [X0,X1] :
      ( relation(X0)
     => relation(relation_restriction(X0,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k2_wellord1) ).

fof(f223,axiom,
    ! [X0,X1] :
      ( relation(X1)
     => ( reflexive(X1)
       => reflexive(relation_restriction(X1,X0)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t22_wellord1) ).

fof(f226,axiom,
    ! [X0,X1] :
      ( relation(X1)
     => ( connected(X1)
       => connected(relation_restriction(X1,X0)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t23_wellord1) ).

fof(f228,axiom,
    ! [X0,X1] :
      ( relation(X1)
     => ( transitive(X1)
       => transitive(relation_restriction(X1,X0)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t24_wellord1) ).

fof(f230,axiom,
    ! [X0,X1] :
      ( relation(X1)
     => ( antisymmetric(X1)
       => antisymmetric(relation_restriction(X1,X0)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t25_wellord1) ).

fof(f239,axiom,
    ! [X0,X1] :
      ( relation(X1)
     => ( well_founded_relation(X1)
       => well_founded_relation(relation_restriction(X1,X0)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t31_wellord1) ).

fof(f241,conjecture,
    ! [X0,X1] :
      ( relation(X1)
     => ( well_ordering(X1)
       => well_ordering(relation_restriction(X1,X0)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t32_wellord1) ).

fof(f242,negated_conjecture,
    ~ ! [X0,X1] :
        ( relation(X1)
       => ( well_ordering(X1)
         => well_ordering(relation_restriction(X1,X0)) ) ),
    inference(negated_conjecture,[status(cth)],[f241]) ).

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

fof(f395,plain,
    ! [X0,X1] :
      ( relation(relation_restriction(X0,X1))
      | ~ relation(X0) ),
    inference(ennf_transformation,[],[f85]) ).

fof(f521,plain,
    ! [X0,X1] :
      ( reflexive(relation_restriction(X1,X0))
      | ~ reflexive(X1)
      | ~ relation(X1) ),
    inference(ennf_transformation,[],[f223]) ).

fof(f522,plain,
    ! [X0,X1] :
      ( reflexive(relation_restriction(X1,X0))
      | ~ reflexive(X1)
      | ~ relation(X1) ),
    inference(flattening,[],[f521]) ).

fof(f527,plain,
    ! [X0,X1] :
      ( connected(relation_restriction(X1,X0))
      | ~ connected(X1)
      | ~ relation(X1) ),
    inference(ennf_transformation,[],[f226]) ).

fof(f528,plain,
    ! [X0,X1] :
      ( connected(relation_restriction(X1,X0))
      | ~ connected(X1)
      | ~ relation(X1) ),
    inference(flattening,[],[f527]) ).

fof(f531,plain,
    ! [X0,X1] :
      ( transitive(relation_restriction(X1,X0))
      | ~ transitive(X1)
      | ~ relation(X1) ),
    inference(ennf_transformation,[],[f228]) ).

fof(f532,plain,
    ! [X0,X1] :
      ( transitive(relation_restriction(X1,X0))
      | ~ transitive(X1)
      | ~ relation(X1) ),
    inference(flattening,[],[f531]) ).

fof(f535,plain,
    ! [X0,X1] :
      ( antisymmetric(relation_restriction(X1,X0))
      | ~ antisymmetric(X1)
      | ~ relation(X1) ),
    inference(ennf_transformation,[],[f230]) ).

fof(f536,plain,
    ! [X0,X1] :
      ( antisymmetric(relation_restriction(X1,X0))
      | ~ antisymmetric(X1)
      | ~ relation(X1) ),
    inference(flattening,[],[f535]) ).

fof(f545,plain,
    ! [X0,X1] :
      ( well_founded_relation(relation_restriction(X1,X0))
      | ~ well_founded_relation(X1)
      | ~ relation(X1) ),
    inference(ennf_transformation,[],[f239]) ).

fof(f546,plain,
    ! [X0,X1] :
      ( well_founded_relation(relation_restriction(X1,X0))
      | ~ well_founded_relation(X1)
      | ~ relation(X1) ),
    inference(flattening,[],[f545]) ).

fof(f549,plain,
    ? [X0,X1] :
      ( ~ well_ordering(relation_restriction(X1,X0))
      & well_ordering(X1)
      & relation(X1) ),
    inference(ennf_transformation,[],[f242]) ).

fof(f550,plain,
    ? [X0,X1] :
      ( ~ well_ordering(relation_restriction(X1,X0))
      & well_ordering(X1)
      & relation(X1) ),
    inference(flattening,[],[f549]) ).

fof(f738,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,[],[f372]) ).

fof(f739,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,[],[f738]) ).

fof(f830,plain,
    ( ~ well_ordering(relation_restriction(sK109,sK108))
    & well_ordering(sK109)
    & relation(sK109) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK108,sK109]),skolemize(X0,sK108),skolemize(X1,sK109)],[f550]) ).

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

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

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

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

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

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

fof(f1143,plain,
    ! [X0,X1] :
      ( relation(relation_restriction(X0,X1))
      | ~ relation(X0) ),
    inference(cnf_transformation,[],[f395]) ).

fof(f1364,plain,
    ! [X0,X1] :
      ( ~ reflexive(X1)
      | reflexive(relation_restriction(X1,X0))
      | ~ relation(X1) ),
    inference(cnf_transformation,[],[f522]) ).

fof(f1367,plain,
    ! [X0,X1] :
      ( ~ connected(X1)
      | connected(relation_restriction(X1,X0))
      | ~ relation(X1) ),
    inference(cnf_transformation,[],[f528]) ).

fof(f1369,plain,
    ! [X0,X1] :
      ( ~ transitive(X1)
      | transitive(relation_restriction(X1,X0))
      | ~ relation(X1) ),
    inference(cnf_transformation,[],[f532]) ).

fof(f1372,plain,
    ! [X0,X1] :
      ( ~ antisymmetric(X1)
      | antisymmetric(relation_restriction(X1,X0))
      | ~ relation(X1) ),
    inference(cnf_transformation,[],[f536]) ).

fof(f1384,plain,
    ! [X0,X1] :
      ( ~ well_founded_relation(X1)
      | well_founded_relation(relation_restriction(X1,X0))
      | ~ relation(X1) ),
    inference(cnf_transformation,[],[f546]) ).

fof(f1388,plain,
    relation(sK109),
    inference(cnf_transformation,[],[f830]) ).

fof(f1389,plain,
    well_ordering(sK109),
    inference(cnf_transformation,[],[f830]) ).

fof(f1390,plain,
    ~ well_ordering(relation_restriction(sK109,sK108)),
    inference(cnf_transformation,[],[f830]) ).

fof(f1812,definition,
    sF123 = relation_restriction(sK109,sK108),
    introduced(definition,[new_symbols(definition,[sF123])],[function_definition]) ).

fof(f1813,plain,
    relation_restriction(sK109,sK108) = sF123,
    inference(reorient_equations,[],[f1812]) ).

fof(f1814,plain,
    ~ well_ordering(sF123),
    inference(definition_folding,[],[f1390,f1813]) ).

fof(f2026,plain,
    ( well_founded_relation(sK109)
    | ~ relation(sK109) ),
    inference(resolution,[],[f1067,f1389]) ).

fof(f2027,plain,
    well_founded_relation(sK109),
    inference(forward_subsumption_resolution,[],[f2026,f1388]) ).

fof(f2028,plain,
    ( connected(sK109)
    | ~ relation(sK109) ),
    inference(resolution,[],[f1068,f1389]) ).

fof(f2029,plain,
    connected(sK109),
    inference(forward_subsumption_resolution,[],[f2028,f1388]) ).

fof(f2030,plain,
    ( antisymmetric(sK109)
    | ~ relation(sK109) ),
    inference(resolution,[],[f1069,f1389]) ).

fof(f2031,plain,
    antisymmetric(sK109),
    inference(forward_subsumption_resolution,[],[f2030,f1388]) ).

fof(f2032,plain,
    ( transitive(sK109)
    | ~ relation(sK109) ),
    inference(resolution,[],[f1070,f1389]) ).

fof(f2033,plain,
    transitive(sK109),
    inference(forward_subsumption_resolution,[],[f2032,f1388]) ).

fof(f2034,plain,
    ( reflexive(sK109)
    | ~ relation(sK109) ),
    inference(resolution,[],[f1071,f1389]) ).

fof(f2035,plain,
    reflexive(sK109),
    inference(forward_subsumption_resolution,[],[f2034,f1388]) ).

fof(f2037,plain,
    ( relation(sF123)
    | ~ relation(sK109) ),
    inference(superposition,[],[f1143,f1813]) ).

fof(f2038,plain,
    relation(sF123),
    inference(forward_subsumption_resolution,[],[f2037,f1388]) ).

fof(f2638,plain,
    ! [X0] :
      ( reflexive(relation_restriction(sK109,X0))
      | ~ relation(sK109) ),
    inference(resolution,[],[f1364,f2035]) ).

fof(f2639,plain,
    ! [X0] : reflexive(relation_restriction(sK109,X0)),
    inference(forward_subsumption_resolution,[],[f2638,f1388]) ).

fof(f2644,plain,
    ! [X0] :
      ( connected(relation_restriction(sK109,X0))
      | ~ relation(sK109) ),
    inference(resolution,[],[f1367,f2029]) ).

fof(f2645,plain,
    ! [X0] : connected(relation_restriction(sK109,X0)),
    inference(forward_subsumption_resolution,[],[f2644,f1388]) ).

fof(f2647,plain,
    reflexive(sF123),
    inference(superposition,[],[f2639,f1813]) ).

fof(f2648,plain,
    ! [X0] :
      ( transitive(relation_restriction(sK109,X0))
      | ~ relation(sK109) ),
    inference(resolution,[],[f1369,f2033]) ).

fof(f2649,plain,
    ! [X0] : transitive(relation_restriction(sK109,X0)),
    inference(forward_subsumption_resolution,[],[f2648,f1388]) ).

fof(f2652,plain,
    ! [X0] :
      ( antisymmetric(relation_restriction(sK109,X0))
      | ~ relation(sK109) ),
    inference(resolution,[],[f1372,f2031]) ).

fof(f2653,plain,
    ! [X0] : antisymmetric(relation_restriction(sK109,X0)),
    inference(forward_subsumption_resolution,[],[f2652,f1388]) ).

fof(f2655,plain,
    connected(sF123),
    inference(superposition,[],[f2645,f1813]) ).

fof(f2656,plain,
    ! [X0] :
      ( well_founded_relation(relation_restriction(sK109,X0))
      | ~ relation(sK109) ),
    inference(resolution,[],[f1384,f2027]) ).

fof(f2657,plain,
    ! [X0] : well_founded_relation(relation_restriction(sK109,X0)),
    inference(forward_subsumption_resolution,[],[f2656,f1388]) ).

fof(f2696,plain,
    transitive(sF123),
    inference(superposition,[],[f2649,f1813]) ).

fof(f2742,plain,
    antisymmetric(sF123),
    inference(superposition,[],[f2653,f1813]) ).

fof(f2779,plain,
    well_founded_relation(sF123),
    inference(superposition,[],[f2657,f1813]) ).

fof(f11058,plain,
    ( well_ordering(sF123)
    | ~ transitive(sF123)
    | ~ antisymmetric(sF123)
    | ~ connected(sF123)
    | ~ well_founded_relation(sF123)
    | ~ relation(sF123) ),
    inference(resolution,[],[f1072,f2647]) ).

fof(f11059,plain,
    ( ~ transitive(sF123)
    | ~ antisymmetric(sF123)
    | ~ connected(sF123)
    | ~ well_founded_relation(sF123)
    | ~ relation(sF123) ),
    inference(forward_subsumption_resolution,[],[f11058,f1814]) ).

fof(f11069,plain,
    ( ~ antisymmetric(sF123)
    | ~ connected(sF123)
    | ~ well_founded_relation(sF123)
    | ~ relation(sF123) ),
    inference(forward_subsumption_resolution,[],[f11059,f2696]) ).

fof(f11079,plain,
    ( ~ connected(sF123)
    | ~ well_founded_relation(sF123)
    | ~ relation(sF123) ),
    inference(forward_subsumption_resolution,[],[f11069,f2742]) ).

fof(f11089,plain,
    ( ~ well_founded_relation(sF123)
    | ~ relation(sF123) ),
    inference(forward_subsumption_resolution,[],[f11079,f2655]) ).

fof(f11099,plain,
    ~ relation(sF123),
    inference(forward_subsumption_resolution,[],[f11089,f2779]) ).

fof(f11108,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f11099,f2038]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU257+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38  % Computer : n006.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Mon Sep 28 04:20:55 UTC 2026
% 0.10/0.39  % CPUTime  : 
% 0.10/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42  Running first-order model finding
% 0.10/0.42  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.25/0.94  % (3577622)Will run a generic schedule for satisfiability detection.
% 2.25/0.94  % (3577631)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3620451122:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.25/0.94  % (3577628)% WARNING: option uhcvi not known.
% 2.25/0.94  % (3577627)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4279496419_2999 on theBenchmark for (2999ds/0Mi)
% 2.25/0.94  % (3577628)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4190713483:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.25/0.94  % (3577629)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=456991137:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.25/0.94  % (3577630)dis+10_1_sil=32000:sp=arity:random_seed=3269280389:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.25/0.94  % (3577632)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=169380691:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.25/0.94  % (3577633)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3746030294:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.25/0.94  % (3577631)Instruction limit reached! 
% 2.25/0.94  % (3577631)------------------------------
% 2.25/0.94  % (3577631)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/0.94  % (3577631)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/0.94  % (3577631)CaDiCaL version: 2.1.3
% 2.25/0.94  % (3577631)Termination reason: Instruction limit
% 2.25/0.94  % (3577631)Termination phase: Saturation
% 2.25/0.94  % (3577631)Time elapsed: 0.039 s
% 2.25/0.94  % (3577631)Peak memory usage: 14 MB
% 2.25/0.94  % (3577631)Instructions burned: 117 (million)
% 2.25/0.94  % (3577641)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3857220186:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.25/0.94  % (3577630)Instruction limit reached! 
% 2.25/0.94  % (3577630)------------------------------
% 2.25/0.94  % (3577630)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/0.94  % (3577630)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/0.94  % (3577630)CaDiCaL version: 2.1.3
% 2.25/0.94  % (3577630)Termination reason: Instruction limit
% 2.25/0.94  % (3577630)Termination phase: Saturation
% 2.25/0.94  % (3577630)Time elapsed: 0.067 s
% 2.25/0.94  % (3577630)Peak memory usage: 13 MB
% 2.25/0.94  % (3577630)Instructions burned: 103 (million)
% 2.25/0.94  % (3577632)Instruction limit reached! 
% 2.25/0.94  % (3577632)------------------------------
% 2.25/0.94  % (3577632)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/0.94  % (3577632)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/0.94  % (3577632)CaDiCaL version: 2.1.3
% 2.25/0.94  % (3577632)Termination reason: Instruction limit
% 2.25/0.94  % (3577632)Termination phase: Saturation
% 2.25/0.94  % (3577632)Time elapsed: 0.067 s
% 2.25/0.94  % (3577632)Peak memory usage: 14 MB
% 2.25/0.94  % (3577632)Instructions burned: 131 (million)
% 2.25/0.94  % TRYING [1]
% 2.25/0.94  % TRYING [2]
% 2.25/0.94  % (3577643)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2055389044:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.25/0.94  % (3577644)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=116489980:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.25/0.94  % TRYING [1]
% 2.25/0.94  % TRYING [2]
% 2.25/0.94  % (3577633)Instruction limit reached! 
% 2.25/0.94  % (3577633)------------------------------
% 2.25/0.94  % (3577633)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/0.94  % (3577633)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/0.94  % (3577633)CaDiCaL version: 2.1.3
% 2.25/0.94  % (3577633)Termination reason: Instruction limit
% 2.25/0.94  % (3577633)Termination phase: Saturation
% 2.25/0.94  % (3577633)Time elapsed: 0.098 s
% 2.25/0.94  % (3577633)Peak memory usage: 15 MB
% 2.25/0.94  % (3577633)Instructions burned: 159 (million)
% 2.25/0.94  % TRYING [3]
% 2.25/0.94  % TRYING [3]
% 2.25/0.94  % (3577647)ott-21_1_sil=16000:fs=off:random_seed=793503617:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.25/0.94  % (3577643)Instruction limit reached! 
% 2.25/0.94  % (3577643)------------------------------
% 2.25/0.94  % (3577643)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/0.94  % (3577643)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/0.94  % (3577643)CaDiCaL version: 2.1.3
% 2.25/0.94  % (3577643)Termination reason: Instruction limit
% 2.25/0.94  % (3577643)Termination phase: Saturation
% 2.25/0.94  % (3577643)Time elapsed: 0.075 s
% 2.25/0.94  % (3577643)Peak memory usage: 14 MB
% 2.25/0.94  % (3577643)Instructions burned: 132 (million)
% 2.25/0.94  % (3577649)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=223877595:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 2.25/0.94  % TRYING [4]
% 2.25/0.94  % (3577641)Instruction limit reached! 
% 2.25/0.94  % (3577641)------------------------------
% 2.25/0.94  % (3577641)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/0.94  % (3577641)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/0.94  % (3577641)CaDiCaL version: 2.1.3
% 2.25/0.94  % (3577641)Termination reason: Instruction limit
% 2.25/0.94  % (3577641)Termination phase: Finite model building constraint generation
% 2.25/0.94  % (3577641)Time elapsed: 0.162 s
% 2.25/0.94  % (3577641)Peak memory usage: 36 MB
% 2.25/0.94  % (3577641)Instructions burned: 720 (million)
% 2.25/0.94  % (3577647)Instruction limit reached! 
% 2.25/0.94  % (3577647)------------------------------
% 2.25/0.94  % (3577647)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/0.94  % (3577647)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/0.94  % (3577647)CaDiCaL version: 2.1.3
% 2.25/0.94  % (3577647)Termination reason: Instruction limit
% 2.25/0.94  % (3577647)Termination phase: Saturation
% 2.25/0.94  % (3577647)Time elapsed: 0.098 s
% 2.25/0.94  % (3577647)Peak memory usage: 14 MB
% 2.25/0.94  % (3577647)Instructions burned: 181 (million)
% 2.25/0.94  % (3577651)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3628215846:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.25/0.94  % (3577652)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1284988678:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 2.25/0.94  % TRYING [1]
% 2.25/0.94  % TRYING [2]
% 2.25/0.94  % TRYING [4]
% 2.25/0.94  % TRYING [3]
% 2.25/0.94  % (3577651)Instruction limit reached! 
% 2.25/0.94  % (3577651)------------------------------
% 2.25/0.94  % (3577651)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/0.94  % (3577651)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/0.94  % (3577651)CaDiCaL version: 2.1.3
% 2.25/0.94  % (3577651)Termination reason: Instruction limit
% 2.25/0.94  % (3577651)Termination phase: Finite model building SAT solving
% 2.25/0.94  % (3577651)Time elapsed: 0.207 s
% 2.25/0.94  % (3577651)Peak memory usage: 40 MB
% 2.25/0.94  % (3577651)Instructions burned: 867 (million)
% 2.25/0.94  % (3577655)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=283749560:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 2.25/0.94  % (3577652) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3577622-3577652"...
% 2.25/0.94  % (3577652)...printing done.
% 2.25/0.94  % (3577652)Refutation found. Thanks to Tanya!
% 2.25/0.94  % SZS status Theorem for theBenchmark
% 2.25/0.94  % SZS output start Proof for theBenchmark
% See solution above
% 2.25/0.94  % (3577652)------------------------------
% 2.25/0.94  % (3577652)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/0.94  % (3577652)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/0.94  % (3577652)CaDiCaL version: 2.1.3
% 2.25/0.94  % (3577652)Termination reason: Refutation
% 2.25/0.94  % (3577652)Time elapsed: 0.218 s
% 2.25/0.94  % (3577652)Peak memory usage: 18 MB
% 2.25/0.94  % (3577652)Instructions burned: 346 (million)
% 2.25/0.94  % (3577622)Success in time 0.512 s
% 2.25/0.94  % Vampire exiting
%------------------------------------------------------------------------------