↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : FLD060-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n013.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 09:49:45 AM UTC 2026

% Result   : Unsatisfiable 3.27s 0.75s
% Output   : Refutation 3.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   21
% Syntax   : Number of formulae    :   87 (  21 unt;   7 def)
%            Number of atoms       :  201 (   4 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  219 ( 105   ~; 109   |;   0   &)
%                                         (   5 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   6 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   55 (   0 sgn  55   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    ! [X0,X1] :
      ( equalish(add(X0,X1),add(X1,X0))
      | ~ defined(X0)
      | ~ defined(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',commutativity_addition) ).

fof(f10,axiom,
    ! [X0,X1] :
      ( defined(add(X0,X1))
      | ~ defined(X0)
      | ~ defined(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',well_definedness_of_addition) ).

fof(f16,axiom,
    ! [X0,X1] :
      ( ~ less_or_equal(X1,X0)
      | ~ less_or_equal(X0,X1)
      | equalish(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',antisymmetry_of_order_relation) ).

fof(f17,axiom,
    ! [X2,X0,X1] :
      ( ~ less_or_equal(X2,X1)
      | ~ less_or_equal(X0,X2)
      | less_or_equal(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',transitivity_of_order_relation) ).

fof(f18,axiom,
    ! [X0,X1] :
      ( less_or_equal(X1,X0)
      | less_or_equal(X0,X1)
      | ~ defined(X0)
      | ~ defined(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',totality_of_order_relation) ).

fof(f19,axiom,
    ! [X2,X0,X1] :
      ( less_or_equal(add(X0,X1),add(X2,X1))
      | ~ defined(X1)
      | ~ less_or_equal(X0,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_order_relation_and_addition) ).

fof(f22,axiom,
    ! [X0,X1] :
      ( ~ equalish(X1,X0)
      | equalish(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).

fof(f23,axiom,
    ! [X2,X0,X1] :
      ( ~ equalish(X2,X1)
      | ~ equalish(X0,X2)
      | equalish(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',transitivity_of_equality) ).

fof(f24,axiom,
    ! [X2,X0,X1] :
      ( equalish(add(X0,X1),add(X2,X1))
      | ~ defined(X1)
      | ~ equalish(X0,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_addition) ).

fof(f26,axiom,
    ! [X2,X0,X1] :
      ( ~ less_or_equal(X2,X1)
      | less_or_equal(X0,X1)
      | ~ equalish(X2,X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation) ).

fof(f28,axiom,
    defined(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).

fof(f29,axiom,
    defined(b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).

fof(f30,negated_conjecture,
    less_or_equal(a,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_3) ).

fof(f31,negated_conjecture,
    ~ less_or_equal(add(a,a),add(b,b)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_4) ).

fof(f32,definition,
    sF0 = add(a,a),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f33,plain,
    add(a,a) = sF0,
    inference(reorient_equations,[],[f32]) ).

fof(f34,definition,
    sF1 = add(b,b),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f35,plain,
    add(b,b) = sF1,
    inference(reorient_equations,[],[f34]) ).

fof(f36,plain,
    ~ less_or_equal(sF0,sF1),
    inference(definition_folding,[],[f31,f35,f33]) ).

fof(f43,plain,
    ( defined(sF0)
    | ~ defined(a)
    | ~ defined(a) ),
    inference(superposition,[],[f10,f33]) ).

fof(f46,plain,
    ( defined(sF0)
    | ~ defined(a) ),
    inference(duplicate_literal_removal,[],[f43]) ).

fof(f48,plain,
    defined(sF0),
    inference(forward_subsumption_resolution,[],[f46,f28]) ).

fof(f96,plain,
    ! [X2,X0,X1] :
      ( ~ equalish(X0,X2)
      | ~ defined(X0)
      | ~ defined(X1)
      | less_or_equal(X2,X1)
      | less_or_equal(X1,X0) ),
    inference(resolution,[],[f18,f26]) ).

fof(f101,plain,
    ! [X0] :
      ( less_or_equal(X0,X0)
      | ~ defined(X0)
      | ~ defined(X0) ),
    inference(factoring,[],[f18]) ).

fof(f102,plain,
    ! [X0] :
      ( less_or_equal(X0,X0)
      | ~ defined(X0) ),
    inference(duplicate_literal_removal,[],[f101]) ).

fof(f105,plain,
    ! [X2,X0,X1] :
      ( ~ equalish(X2,add(X0,X1))
      | ~ defined(X1)
      | ~ defined(X0)
      | equalish(X2,add(X1,X0)) ),
    inference(resolution,[],[f4,f23]) ).

fof(f152,plain,
    ! [X2,X3,X0,X1] :
      ( ~ equalish(add(X1,X0),X3)
      | ~ less_or_equal(X1,X2)
      | less_or_equal(X3,add(X2,X0))
      | ~ defined(X0) ),
    inference(resolution,[],[f19,f26]) ).

fof(f158,plain,
    ! [X0] :
      ( less_or_equal(add(X0,b),sF1)
      | ~ defined(b)
      | ~ less_or_equal(X0,b) ),
    inference(superposition,[],[f19,f35]) ).

fof(f159,plain,
    ! [X0] :
      ( less_or_equal(add(X0,b),sF1)
      | ~ less_or_equal(X0,b) ),
    inference(forward_subsumption_resolution,[],[f158,f29]) ).

fof(f173,plain,
    ! [X0] :
      ( equalish(add(X0,a),sF0)
      | ~ defined(a)
      | ~ equalish(X0,a) ),
    inference(superposition,[],[f24,f33]) ).

fof(f176,plain,
    ! [X0] :
      ( equalish(add(X0,a),sF0)
      | ~ equalish(X0,a) ),
    inference(forward_subsumption_resolution,[],[f173,f28]) ).

fof(f282,plain,
    ! [X0,X1] :
      ( ~ equalish(add(X0,b),X1)
      | less_or_equal(X1,sF1)
      | ~ less_or_equal(X0,b) ),
    inference(resolution,[],[f159,f26]) ).

fof(f283,plain,
    ! [X0,X1] :
      ( ~ less_or_equal(X1,add(X0,b))
      | ~ less_or_equal(X0,b)
      | less_or_equal(X1,sF1) ),
    inference(resolution,[],[f159,f17]) ).

fof(f312,definition,
    ( spl2_21
  <=> less_or_equal(a,a) ),
    introduced(definition,[new_symbols(definition,[spl2_21])],[avatar_definition]) ).

fof(f313,plain,
    ( less_or_equal(a,a)
    | ~ spl2_21 ),
    inference(avatar_component_clause,[],[f312]) ).

fof(f314,plain,
    ( ~ less_or_equal(a,a)
    | spl2_21 ),
    inference(avatar_component_clause,[],[f312]) ).

fof(f749,plain,
    ! [X2,X0,X1] :
      ( ~ defined(add(X0,X1))
      | ~ defined(X2)
      | less_or_equal(add(X1,X0),X2)
      | less_or_equal(X2,add(X0,X1))
      | ~ defined(X0)
      | ~ defined(X1) ),
    inference(resolution,[],[f96,f4]) ).

fof(f796,plain,
    ! [X2,X0,X1] :
      ( less_or_equal(add(X1,X0),X2)
      | less_or_equal(X2,add(X0,X1))
      | ~ defined(X2)
      | ~ defined(X0)
      | ~ defined(X1) ),
    inference(forward_subsumption_resolution,[],[f749,f10]) ).

fof(f1013,plain,
    ! [X0,X1] :
      ( ~ less_or_equal(X0,X1)
      | less_or_equal(sF0,add(X1,a))
      | ~ defined(a)
      | ~ equalish(X0,a) ),
    inference(resolution,[],[f152,f176]) ).

fof(f1021,plain,
    ! [X0,X1] :
      ( ~ less_or_equal(X0,X1)
      | less_or_equal(sF0,add(X1,a))
      | ~ equalish(X0,a) ),
    inference(forward_subsumption_resolution,[],[f1013,f28]) ).

fof(f1347,plain,
    ( ~ defined(a)
    | spl2_21 ),
    inference(resolution,[],[f314,f102]) ).

fof(f1348,plain,
    ( $false
    | spl2_21 ),
    inference(forward_subsumption_resolution,[],[f1347,f28]) ).

fof(f1349,plain,
    spl2_21,
    inference(avatar_contradiction_clause,[],[f1348]) ).

fof(f1367,plain,
    ( ~ less_or_equal(a,a)
    | equalish(a,a)
    | ~ spl2_21 ),
    inference(resolution,[],[f313,f16]) ).

fof(f1368,plain,
    ( equalish(a,a)
    | ~ spl2_21 ),
    inference(forward_subsumption_resolution,[],[f1367,f313]) ).

fof(f3174,plain,
    ( less_or_equal(sF0,add(b,a))
    | ~ equalish(a,a) ),
    inference(resolution,[],[f1021,f30]) ).

fof(f3188,plain,
    ( less_or_equal(sF0,add(b,a))
    | ~ spl2_21 ),
    inference(forward_subsumption_resolution,[],[f3174,f1368]) ).

fof(f3222,definition,
    ( spl2_163
  <=> less_or_equal(sF0,add(b,a)) ),
    introduced(definition,[new_symbols(definition,[spl2_163])],[avatar_definition]) ).

fof(f3224,plain,
    ( less_or_equal(sF0,add(b,a))
    | ~ spl2_163 ),
    inference(avatar_component_clause,[],[f3222]) ).

fof(f3365,plain,
    ( spl2_163
    | ~ spl2_21 ),
    inference(avatar_split_clause,[],[f3188,f312,f3222]) ).

fof(f3774,plain,
    ( ~ less_or_equal(add(b,a),sF0)
    | equalish(add(b,a),sF0)
    | ~ spl2_163 ),
    inference(resolution,[],[f3224,f16]) ).

fof(f3776,definition,
    ( spl2_228
  <=> equalish(add(b,a),sF0) ),
    introduced(definition,[new_symbols(definition,[spl2_228])],[avatar_definition]) ).

fof(f3778,plain,
    ( equalish(add(b,a),sF0)
    | ~ spl2_228 ),
    inference(avatar_component_clause,[],[f3776]) ).

fof(f3780,definition,
    ( spl2_229
  <=> less_or_equal(add(b,a),sF0) ),
    introduced(definition,[new_symbols(definition,[spl2_229])],[avatar_definition]) ).

fof(f3782,plain,
    ( ~ less_or_equal(add(b,a),sF0)
    | spl2_229 ),
    inference(avatar_component_clause,[],[f3780]) ).

fof(f3783,plain,
    ( spl2_228
    | ~ spl2_229
    | ~ spl2_163 ),
    inference(avatar_split_clause,[],[f3774,f3222,f3780,f3776]) ).

fof(f6342,plain,
    ( equalish(sF0,add(b,a))
    | ~ spl2_228 ),
    inference(resolution,[],[f3778,f22]) ).

fof(f6698,plain,
    ( ~ defined(a)
    | ~ defined(b)
    | equalish(sF0,add(a,b))
    | ~ spl2_228 ),
    inference(resolution,[],[f6342,f105]) ).

fof(f6711,plain,
    ( ~ defined(b)
    | equalish(sF0,add(a,b))
    | ~ spl2_228 ),
    inference(forward_subsumption_resolution,[],[f6698,f28]) ).

fof(f6715,plain,
    ( equalish(sF0,add(a,b))
    | ~ spl2_228 ),
    inference(forward_subsumption_resolution,[],[f6711,f29]) ).

fof(f6854,plain,
    ( equalish(add(a,b),sF0)
    | ~ spl2_228 ),
    inference(resolution,[],[f6715,f22]) ).

fof(f10091,plain,
    ( less_or_equal(sF0,add(a,b))
    | ~ defined(sF0)
    | ~ defined(a)
    | ~ defined(b)
    | spl2_229 ),
    inference(resolution,[],[f3782,f796]) ).

fof(f10104,plain,
    ( less_or_equal(sF0,add(a,b))
    | ~ defined(a)
    | ~ defined(b)
    | spl2_229 ),
    inference(forward_subsumption_resolution,[],[f10091,f48]) ).

fof(f10107,plain,
    ( less_or_equal(sF0,add(a,b))
    | ~ defined(b)
    | spl2_229 ),
    inference(forward_subsumption_resolution,[],[f10104,f28]) ).

fof(f10108,plain,
    ( less_or_equal(sF0,add(a,b))
    | spl2_229 ),
    inference(forward_subsumption_resolution,[],[f10107,f29]) ).

fof(f11339,plain,
    ( ~ less_or_equal(a,b)
    | less_or_equal(sF0,sF1)
    | spl2_229 ),
    inference(resolution,[],[f10108,f283]) ).

fof(f11371,definition,
    ( spl2_476
  <=> equalish(add(a,b),sF0) ),
    introduced(definition,[new_symbols(definition,[spl2_476])],[avatar_definition]) ).

fof(f11373,plain,
    ( equalish(add(a,b),sF0)
    | ~ spl2_476 ),
    inference(avatar_component_clause,[],[f11371]) ).

fof(f11376,plain,
    ( less_or_equal(sF0,sF1)
    | spl2_229 ),
    inference(forward_subsumption_resolution,[],[f11339,f30]) ).

fof(f11377,plain,
    ( $false
    | spl2_229 ),
    inference(forward_subsumption_resolution,[],[f11376,f36]) ).

fof(f11378,plain,
    spl2_229,
    inference(avatar_contradiction_clause,[],[f11377]) ).

fof(f11380,plain,
    ( spl2_476
    | ~ spl2_228 ),
    inference(avatar_split_clause,[],[f6854,f3776,f11371]) ).

fof(f13070,plain,
    ( less_or_equal(sF0,sF1)
    | ~ less_or_equal(a,b)
    | ~ spl2_476 ),
    inference(resolution,[],[f11373,f282]) ).

fof(f13094,plain,
    ( ~ less_or_equal(a,b)
    | ~ spl2_476 ),
    inference(forward_subsumption_resolution,[],[f13070,f36]) ).

fof(f13105,plain,
    ( $false
    | ~ spl2_476 ),
    inference(forward_subsumption_resolution,[],[f13094,f30]) ).

fof(f13106,plain,
    ~ spl2_476,
    inference(avatar_contradiction_clause,[],[f13105]) ).

cnf(s53,plain,
    spl2_21,
    inference(sat_conversion,[],[f1349]) ).

cnf(s141,plain,
    ( ~ spl2_21
    | spl2_163 ),
    inference(sat_conversion,[],[f3365]) ).

cnf(s170,plain,
    ( ~ spl2_163
    | spl2_228
    | ~ spl2_229 ),
    inference(sat_conversion,[],[f3783]) ).

cnf(s449,plain,
    spl2_229,
    inference(sat_conversion,[],[f11378]) ).

cnf(s451,plain,
    ( ~ spl2_228
    | spl2_476 ),
    inference(sat_conversion,[],[f11380]) ).

cnf(s465,plain,
    ~ spl2_476,
    inference(sat_conversion,[],[f13106]) ).

cnf(s468,plain,
    ~ spl2_228,
    inference(rat,[],[s451,s465]) ).

cnf(s486,plain,
    ~ spl2_163,
    inference(rat,[],[s170,s449,s468]) ).

cnf(s488,plain,
    ~ spl2_21,
    inference(rat,[],[s141,s486]) ).

cnf(s520,plain,
    $false,
    inference(rat,[],[s53,s488]) ).

fof(f13107,plain,
    $false,
    inference(avatar_sat_refutation,[],[s520]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : FLD060-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20  % Computer : n013.cluster.edu
% 0.08/0.20  % Model    : x86_64 x86_64
% 0.08/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20  % Memory   : 8046.5625MB
% 0.08/0.20  % OS       : Linux 6.8.0-71-generic
% 0.08/0.20  % CPULimit : 300
% 0.08/0.20  % WCLimit  : 300
% 0.08/0.20  % DateTime : Tue Sep 29 00:46:49 UTC 2026
% 0.08/0.20  % CPUTime  : 
% 0.08/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23  Running first-order model finding
% 0.08/0.23  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
% 3.27/0.75  % (1754671)Will run a generic schedule for satisfiability detection.
% 3.27/0.75  % (1754681)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3723045909:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 3.27/0.75  % (1754677)% WARNING: option uhcvi not known.
% 3.27/0.75  % (1754677)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1069176716:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 3.27/0.75  % (1754676)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=97166128_2999 on theBenchmark for (2999ds/0Mi)
% 3.27/0.75  % (1754678)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=307148777:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 3.27/0.75  % (1754679)dis+10_1_sil=32000:sp=arity:random_seed=3850425426:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 3.27/0.75  % (1754680)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1941142565:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 3.27/0.75  % (1754682)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3581230796:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 3.27/0.75  % TRYING [1]
% 3.27/0.75  % TRYING [2]
% 3.27/0.75  % TRYING [3]
% 3.27/0.75  % TRYING [4]
% 3.27/0.75  % (1754681)Instruction limit reached! 
% 3.27/0.75  % (1754681)------------------------------
% 3.27/0.75  % (1754681)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.27/0.75  % (1754681)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.27/0.75  % (1754681)CaDiCaL version: 2.1.3
% 3.27/0.75  % (1754681)Termination reason: Instruction limit
% 3.27/0.75  % (1754681)Termination phase: Saturation
% 3.27/0.75  % (1754681)Time elapsed: 0.043 s
% 3.27/0.75  % (1754681)Peak memory usage: 14 MB
% 3.27/0.75  % (1754681)Instructions burned: 133 (million)
% 3.27/0.75  % TRYING [5]
% 3.27/0.75  % (1754690)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1385658163:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 3.27/0.75  % TRYING [1]
% 3.27/0.75  % TRYING [2]
% 3.27/0.75  % TRYING [3]
% 3.27/0.75  % TRYING [4]
% 3.27/0.75  % (1754682)Instruction limit reached! 
% 3.27/0.75  % (1754682)------------------------------
% 3.27/0.75  % (1754682)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.27/0.75  % (1754682)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.27/0.75  % (1754682)CaDiCaL version: 2.1.3
% 3.27/0.75  % (1754682)Termination reason: Instruction limit
% 3.27/0.75  % (1754682)Termination phase: Saturation
% 3.27/0.75  % (1754682)Time elapsed: 0.056 s
% 3.27/0.75  % (1754682)Peak memory usage: 11 MB
% 3.27/0.75  % (1754682)Instructions burned: 170 (million)
% 3.27/0.75  % (1754679)Instruction limit reached! 
% 3.27/0.75  % (1754679)------------------------------
% 3.27/0.75  % (1754679)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.27/0.75  % (1754679)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.27/0.75  % (1754679)CaDiCaL version: 2.1.3
% 3.27/0.75  % (1754679)Termination reason: Instruction limit
% 3.27/0.75  % (1754679)Termination phase: Saturation
% 3.27/0.75  % (1754679)Time elapsed: 0.064 s
% 3.27/0.75  % (1754679)Peak memory usage: 12 MB
% 3.27/0.75  % (1754679)Instructions burned: 104 (million)
% 3.27/0.75  % (1754680)Instruction limit reached! 
% 3.27/0.75  % (1754680)------------------------------
% 3.27/0.75  % (1754680)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.27/0.75  % (1754680)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.27/0.75  % (1754680)CaDiCaL version: 2.1.3
% 3.27/0.75  % (1754680)Termination reason: Instruction limit
% 3.27/0.75  % (1754680)Termination phase: Saturation
% 3.27/0.75  % (1754680)Time elapsed: 0.066 s
% 3.27/0.75  % (1754680)Peak memory usage: 11 MB
% 3.27/0.75  % (1754680)Instructions burned: 117 (million)
% 3.27/0.75  % TRYING [5]
% 3.27/0.75  % (1754692)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1086665953:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 3.27/0.75  % (1754693)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=1320591334:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 3.27/0.75  % (1754694)ott-21_1_sil=16000:fs=off:random_seed=642508637:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 3.27/0.75  % (1754692)Instruction limit reached! 
% 3.27/0.75  % (1754692)------------------------------
% 3.27/0.75  % (1754692)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.27/0.75  % (1754692)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.27/0.75  % (1754692)CaDiCaL version: 2.1.3
% 3.27/0.75  % (1754692)Termination reason: Instruction limit
% 3.27/0.75  % (1754692)Termination phase: Saturation
% 3.27/0.75  % (1754692)Time elapsed: 0.076 s
% 3.27/0.75  % (1754692)Peak memory usage: 15 MB
% 3.27/0.75  % (1754692)Instructions burned: 132 (million)
% 3.27/0.75  % (1754698)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2348587684:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 3.27/0.75  % (1754694)Instruction limit reached! 
% 3.27/0.75  % (1754694)------------------------------
% 3.27/0.75  % (1754694)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.27/0.75  % (1754694)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.27/0.75  % (1754694)CaDiCaL version: 2.1.3
% 3.27/0.75  % (1754694)Termination reason: Instruction limit
% 3.27/0.75  % (1754694)Termination phase: Saturation
% 3.27/0.75  % (1754694)Time elapsed: 0.092 s
% 3.27/0.75  % (1754694)Peak memory usage: 12 MB
% 3.27/0.75  % (1754694)Instructions burned: 181 (million)
% 3.27/0.75  % TRYING [6]
% 3.27/0.75  % (1754700)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3726895366:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 3.27/0.75  % TRYING [1]
% 3.27/0.75  % TRYING [2]
% 3.27/0.75  % TRYING [3]
% 3.27/0.75  % TRYING [4]
% 3.27/0.75  % (1754690)Instruction limit reached! 
% 3.27/0.75  % (1754690)------------------------------
% 3.27/0.75  % (1754690)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.27/0.75  % (1754690)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.27/0.75  % (1754690)CaDiCaL version: 2.1.3
% 3.27/0.75  % (1754690)Termination reason: Instruction limit
% 3.27/0.75  % (1754690)Termination phase: Finite model building SAT solving
% 3.27/0.75  % (1754690)Time elapsed: 0.191 s
% 3.27/0.75  % (1754690)Peak memory usage: 24 MB
% 3.27/0.75  % (1754690)Instructions burned: 718 (million)
% 3.27/0.75  % (1754702)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=972147570:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 3.27/0.75  % TRYING [5]
% 3.27/0.75  % TRYING [6]
% 3.27/0.75  % TRYING [6]
% 3.27/0.75  % (1754702) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1754671-1754702"...
% 3.27/0.75  % (1754702)...printing done.
% 3.27/0.75  % (1754702)Refutation found. Thanks to Tanya!
% 3.27/0.75  % SZS status Unsatisfiable for theBenchmark
% 3.27/0.75  % SZS output start Proof for theBenchmark
% See solution above
% 3.27/0.75  % (1754702)------------------------------
% 3.27/0.75  % (1754702)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.27/0.75  % (1754702)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.27/0.75  % (1754702)CaDiCaL version: 2.1.3
% 3.27/0.75  % (1754702)Termination reason: Refutation
% 3.27/0.75  % (1754702)Time elapsed: 0.218 s
% 3.27/0.75  % (1754702)Peak memory usage: 20 MB
% 3.27/0.75  % (1754702)Instructions burned: 623 (million)
% 3.27/0.75  % (1754671)Success in time 0.51 s
% 3.27/0.75  % Vampire exiting
%------------------------------------------------------------------------------