↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n007.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 11:51:44 AM UTC 2026

% Result   : Unsatisfiable 3.74s 2.00s
% Output   : Refutation 7.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   22
% Syntax   : Number of formulae    :   86 (  54 unt;  12 def)
%            Number of atoms       :  125 (  22 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   81 (  42   ~;  37   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    6 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;  13 con; 0-2 aty)
%            Number of variables   :   82 (   0 sgn  82   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : axiom(implies(or(X0,X0),X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_2) ).

fof(f2,axiom,
    ! [X0,X1] : axiom(implies(X0,or(X1,X0))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).

fof(f3,axiom,
    ! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).

fof(f4,axiom,
    ! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_5) ).

fof(f5,axiom,
    ! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_6) ).

fof(f6,axiom,
    ! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_definition) ).

fof(f7,axiom,
    ! [X0] :
      ( ~ axiom(X0)
      | theorem(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( theorem(X0)
      | ~ theorem(implies(X1,X0))
      | ~ theorem(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).

fof(f9,axiom,
    ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_defn) ).

fof(f10,negated_conjecture,
    ~ theorem(implies(implies(and(p,q),r),implies(p,implies(q,r)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f11,plain,
    ! [X0] : axiom(or(not(or(X0,X0)),X0)),
    inference(definition_unfolding,[],[f1,f6]) ).

fof(f12,plain,
    ! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
    inference(definition_unfolding,[],[f2,f6]) ).

fof(f13,plain,
    ! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
    inference(definition_unfolding,[],[f3,f6]) ).

fof(f14,plain,
    ! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(definition_unfolding,[],[f4,f6]) ).

fof(f15,plain,
    ! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(definition_unfolding,[],[f5,f6,f6,f6]) ).

fof(f16,plain,
    ! [X0,X1] :
      ( ~ theorem(or(not(X1),X0))
      | theorem(X0)
      | ~ theorem(X1) ),
    inference(definition_unfolding,[],[f8,f6]) ).

fof(f17,plain,
    ~ theorem(or(not(or(not(not(or(not(p),not(q)))),r)),or(not(p),or(not(q),r)))),
    inference(definition_unfolding,[],[f10,f6,f6,f9,f6,f6]) ).

fof(f18,definition,
    sF0 = not(p),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f19,plain,
    not(p) = sF0,
    inference(reorient_equations,[],[f18]) ).

fof(f20,definition,
    sF1 = not(q),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f21,plain,
    not(q) = sF1,
    inference(reorient_equations,[],[f20]) ).

fof(f22,definition,
    sF2 = or(sF0,sF1),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f23,plain,
    or(sF0,sF1) = sF2,
    inference(reorient_equations,[],[f22]) ).

fof(f24,definition,
    sF3 = not(sF2),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f25,plain,
    not(sF2) = sF3,
    inference(reorient_equations,[],[f24]) ).

fof(f26,definition,
    sF4 = not(sF3),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

fof(f27,plain,
    not(sF3) = sF4,
    inference(reorient_equations,[],[f26]) ).

fof(f28,definition,
    sF5 = or(sF4,r),
    introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).

fof(f29,plain,
    or(sF4,r) = sF5,
    inference(reorient_equations,[],[f28]) ).

fof(f30,definition,
    sF6 = not(sF5),
    introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).

fof(f31,plain,
    not(sF5) = sF6,
    inference(reorient_equations,[],[f30]) ).

fof(f32,definition,
    sF7 = or(sF1,r),
    introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).

fof(f33,plain,
    or(sF1,r) = sF7,
    inference(reorient_equations,[],[f32]) ).

fof(f34,definition,
    sF8 = or(sF0,sF7),
    introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).

fof(f35,plain,
    or(sF0,sF7) = sF8,
    inference(reorient_equations,[],[f34]) ).

fof(f36,definition,
    sF9 = or(sF6,sF8),
    introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).

fof(f37,plain,
    or(sF6,sF8) = sF9,
    inference(reorient_equations,[],[f36]) ).

fof(f38,plain,
    ~ theorem(sF9),
    inference(definition_folding,[],[f17,f37,f35,f33,f21,f19,f31,f29,f27,f25,f23,f21,f19]) ).

fof(f39,plain,
    ! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(resolution,[],[f15,f7]) ).

fof(f58,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X0,X1)),or(X0,X2)))
      | ~ theorem(or(not(X1),X2)) ),
    inference(resolution,[],[f16,f39]) ).

fof(f98,plain,
    ! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(resolution,[],[f14,f7]) ).

fof(f119,plain,
    ! [X0] : theorem(or(not(or(sF6,or(X0,sF8))),or(X0,sF9))),
    inference(superposition,[],[f98,f37]) ).

fof(f149,plain,
    ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
    inference(resolution,[],[f13,f7]) ).

fof(f162,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X1,X0))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f149,f16]) ).

fof(f176,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
    inference(resolution,[],[f12,f7]) ).

fof(f196,plain,
    theorem(or(not(r),sF7)),
    inference(superposition,[],[f176,f33]) ).

fof(f226,plain,
    ! [X0] :
      ( ~ theorem(or(sF6,or(X0,sF8)))
      | theorem(or(X0,sF9)) ),
    inference(resolution,[],[f119,f16]) ).

fof(f230,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(not(X0),X1))
      | theorem(or(X2,X1))
      | ~ theorem(or(X2,X0)) ),
    inference(resolution,[],[f58,f16]) ).

fof(f234,plain,
    ! [X0] :
      ( theorem(or(not(sF2),or(sF0,X0)))
      | ~ theorem(or(not(sF1),X0)) ),
    inference(superposition,[],[f58,f23]) ).

fof(f236,plain,
    ! [X0] :
      ( theorem(or(not(sF5),or(sF4,X0)))
      | ~ theorem(or(not(r),X0)) ),
    inference(superposition,[],[f58,f29]) ).

fof(f243,plain,
    ! [X0] :
      ( theorem(or(sF6,or(sF4,X0)))
      | ~ theorem(or(not(r),X0)) ),
    inference(forward_demodulation,[],[f236,f31]) ).

fof(f244,plain,
    ! [X0] :
      ( theorem(or(sF3,or(sF0,X0)))
      | ~ theorem(or(not(sF1),X0)) ),
    inference(forward_demodulation,[],[f234,f25]) ).

fof(f245,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X0,or(X2,X1)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f230,f149]) ).

fof(f246,plain,
    ! [X2,X3,X0,X1] :
      ( ~ theorem(or(X0,or(X1,X3)))
      | theorem(or(X0,or(X1,X2)))
      | ~ theorem(or(not(X3),X2)) ),
    inference(resolution,[],[f230,f58]) ).

fof(f250,plain,
    ! [X2,X0,X1] :
      ( theorem(or(X0,or(X1,X2)))
      | ~ theorem(or(X0,X2)) ),
    inference(resolution,[],[f230,f176]) ).

fof(f254,plain,
    ! [X0,X1] :
      ( ~ theorem(or(sF4,X0))
      | theorem(or(X1,X0))
      | ~ theorem(or(X1,sF3)) ),
    inference(superposition,[],[f230,f27]) ).

fof(f261,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X0,X1))),
    inference(resolution,[],[f245,f176]) ).

fof(f270,plain,
    ! [X2,X3,X0,X1] :
      ( theorem(or(not(or(X0,or(X1,X2))),or(X1,X3)))
      | ~ theorem(or(not(or(X0,X2)),X3)) ),
    inference(resolution,[],[f246,f98]) ).

fof(f284,plain,
    ! [X0] :
      ( ~ theorem(or(X0,sF7))
      | theorem(or(X0,sF8)) ),
    inference(superposition,[],[f250,f35]) ).

fof(f289,plain,
    ! [X0] : theorem(or(not(or(X0,X0)),X0)),
    inference(resolution,[],[f11,f7]) ).

fof(f384,plain,
    ! [X2,X3,X0,X1] :
      ( ~ theorem(or(not(or(X0,X1)),X2))
      | theorem(or(X3,X2))
      | ~ theorem(or(X0,or(X3,X1))) ),
    inference(resolution,[],[f270,f16]) ).

fof(f430,plain,
    theorem(or(not(sF1),sF7)),
    inference(superposition,[],[f261,f33]) ).

fof(f493,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X1,or(X0,X1)))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f384,f289]) ).

fof(f678,plain,
    ( ~ theorem(or(not(r),sF8))
    | theorem(or(sF4,sF9)) ),
    inference(resolution,[],[f243,f226]) ).

fof(f698,definition,
    ( spl10_30
  <=> theorem(or(sF4,sF9)) ),
    introduced(definition,[new_symbols(definition,[spl10_30])],[avatar_definition]) ).

fof(f700,plain,
    ( theorem(or(sF4,sF9))
    | ~ spl10_30 ),
    inference(avatar_component_clause,[],[f698]) ).

fof(f702,definition,
    ( spl10_31
  <=> theorem(or(not(r),sF8)) ),
    introduced(definition,[new_symbols(definition,[spl10_31])],[avatar_definition]) ).

fof(f704,plain,
    ( ~ theorem(or(not(r),sF8))
    | spl10_31 ),
    inference(avatar_component_clause,[],[f702]) ).

fof(f705,plain,
    ( spl10_30
    | ~ spl10_31 ),
    inference(avatar_split_clause,[],[f678,f702,f698]) ).

fof(f795,plain,
    ( theorem(or(sF3,sF8))
    | ~ theorem(or(not(sF1),sF7)) ),
    inference(superposition,[],[f244,f35]) ).

fof(f797,plain,
    theorem(or(sF3,sF8)),
    inference(forward_subsumption_resolution,[],[f795,f430]) ).

fof(f818,plain,
    theorem(or(sF8,sF3)),
    inference(resolution,[],[f797,f162]) ).

fof(f873,plain,
    ( ~ theorem(or(sF8,sF9))
    | theorem(sF9) ),
    inference(superposition,[],[f493,f37]) ).

fof(f874,plain,
    ~ theorem(or(sF8,sF9)),
    inference(forward_subsumption_resolution,[],[f873,f38]) ).

fof(f1413,plain,
    theorem(or(not(r),sF8)),
    inference(resolution,[],[f284,f196]) ).

fof(f1419,plain,
    ( $false
    | spl10_31 ),
    inference(forward_subsumption_resolution,[],[f1413,f704]) ).

fof(f1420,plain,
    spl10_31,
    inference(avatar_contradiction_clause,[],[f1419]) ).

fof(f1421,plain,
    ( ! [X0] :
        ( ~ theorem(or(X0,sF3))
        | theorem(or(X0,sF9)) )
    | ~ spl10_30 ),
    inference(resolution,[],[f700,f254]) ).

fof(f1424,plain,
    ( theorem(or(sF8,sF9))
    | ~ spl10_30 ),
    inference(resolution,[],[f1421,f818]) ).

fof(f1430,plain,
    ( $false
    | ~ spl10_30 ),
    inference(forward_subsumption_resolution,[],[f1424,f874]) ).

fof(f1431,plain,
    ~ spl10_30,
    inference(avatar_contradiction_clause,[],[f1430]) ).

cnf(s16,plain,
    ( spl10_30
    | ~ spl10_31 ),
    inference(sat_conversion,[],[f705]) ).

cnf(s28,plain,
    spl10_31,
    inference(sat_conversion,[],[f1420]) ).

cnf(s29,plain,
    ~ spl10_30,
    inference(sat_conversion,[],[f1431]) ).

cnf(s30,plain,
    $false,
    inference(rat,[],[s16,s28,s29]) ).

fof(f1432,plain,
    $false,
    inference(avatar_sat_refutation,[],[s30]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL242-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41  % Computer : n007.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.42  % CPULimit : 300
% 0.15/0.42  % WCLimit  : 300
% 0.15/0.42  % DateTime : Sun Sep 27 15:28:25 UTC 2026
% 0.15/0.42  % CPUTime  : 
% 0.15/0.42  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.46  Running first-order theorem proving
% 0.15/0.46  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.74/2.00  % (1589197)Input is clausal, will run a generic CNF schedule.
% 3.74/2.00  % (1589221)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2128492466:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.74/2.00  % (1589216)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=591353570:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.74/2.00  % (1589220)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1199550:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.74/2.00  % (1589219)lrs+10_1_sil=8000:sp=occurrence:random_seed=689224514:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.74/2.00  % (1589217)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=4024484717:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.74/2.00  % (1589222)dis-21_1_sil=8000:lcm=predicate:random_seed=3568710957:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 3.74/2.00  % (1589218)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1383334760:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.74/2.00  % (1589221)Instruction limit reached! 
% 3.74/2.00  % (1589221)------------------------------
% 3.74/2.00  % (1589221)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.74/2.00  % (1589221)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.74/2.00  % (1589221)CaDiCaL version: 2.1.3
% 3.74/2.00  % (1589221)Termination reason: Instruction limit
% 3.74/2.00  % (1589221)Termination phase: Saturation
% 3.74/2.00  % (1589221)Time elapsed: 0.128 s
% 3.74/2.00  % (1589221)Peak memory usage: 89 MB
% 3.74/2.00  % (1589221)Instructions burned: 181 (million)
% 3.74/2.00  % (1589222)Instruction limit reached! 
% 3.74/2.00  % (1589222)------------------------------
% 3.74/2.00  % (1589222)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.74/2.00  % (1589222)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.74/2.00  % (1589222)CaDiCaL version: 2.1.3
% 3.74/2.00  % (1589222)Termination reason: Instruction limit
% 3.74/2.00  % (1589222)Termination phase: Saturation
% 3.74/2.00  % (1589222)Time elapsed: 0.098 s
% 3.74/2.00  % (1589222)Peak memory usage: 87 MB
% 3.74/2.00  % (1589222)Instructions burned: 117 (million)
% 3.74/2.00  % (1589220)Instruction limit reached! 
% 3.74/2.00  % (1589220)------------------------------
% 3.74/2.00  % (1589220)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.74/2.00  % (1589220)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.74/2.00  % (1589220)CaDiCaL version: 2.1.3
% 3.74/2.00  % (1589220)Termination reason: Instruction limit
% 3.74/2.00  % (1589220)Termination phase: Saturation
% 3.74/2.00  % (1589220)Time elapsed: 0.110 s
% 3.74/2.00  % (1589220)Peak memory usage: 88 MB
% 3.74/2.00  % (1589220)Instructions burned: 114 (million)
% 3.74/2.00  % (1589219)Instruction limit reached! 
% 3.74/2.00  % (1589219)------------------------------
% 3.74/2.00  % (1589219)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.74/2.00  % (1589219)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.74/2.00  % (1589219)CaDiCaL version: 2.1.3
% 3.74/2.00  % (1589219)Termination reason: Instruction limit
% 3.74/2.00  % (1589219)Termination phase: Saturation
% 3.74/2.00  % (1589219)Time elapsed: 0.115 s
% 3.74/2.00  % (1589219)Peak memory usage: 89 MB
% 3.74/2.00  % (1589219)Instructions burned: 107 (million)
% 3.74/2.00  % (1589230)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=496685064:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 3.74/2.00  % (1589230)Refutation not found, incomplete strategy
% 3.74/2.00  % (1589230)------------------------------
% 3.74/2.00  % (1589230)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.74/2.00  % (1589230)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.74/2.00  % (1589230)CaDiCaL version: 2.1.3
% 3.74/2.00  % (1589230)Termination reason: Refutation not found, incomplete strategy
% 3.74/2.00  % (1589230)Time elapsed: 0.002 s
% 3.74/2.00  % (1589230)Peak memory usage: 88 MB
% 3.74/2.00  % (1589233)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=1300487714:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2996 on theBenchmark for (2996ds/189Mi)
% 3.74/2.00  % (1589233)Refutation not found, incomplete strategy
% 3.74/2.00  % (1589233)------------------------------
% 3.74/2.00  % (1589233)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.74/2.00  % (1589233)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.74/2.00  % (1589233)CaDiCaL version: 2.1.3
% 3.74/2.00  % (1589233)Termination reason: Refutation not found, incomplete strategy
% 3.74/2.00  % (1589233)Time elapsed: 0.001 s
% 3.74/2.00  % (1589233)Peak memory usage: 87 MB
% 3.74/2.00  % (1589235)lrs+10_64_to=lpo:sil=8000:random_seed=1544030919:i=126:bd=preordered_2996 on theBenchmark for (2996ds/126Mi)
% 3.74/2.00  % (1589234)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=2426912752:st=4:i=219:sd=3:ss=axioms_2996 on theBenchmark for (2996ds/219Mi)
% 3.74/2.00  % (1589234)Refutation not found, incomplete strategy
% 3.74/2.00  % (1589234)------------------------------
% 3.74/2.00  % (1589234)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.74/2.00  % (1589234)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.74/2.00  % (1589234)CaDiCaL version: 2.1.3
% 3.74/2.00  % (1589234)Termination reason: Refutation not found, incomplete strategy
% 3.74/2.00  % (1589234)Time elapsed: 0.001 s
% 3.74/2.00  % (1589234)Peak memory usage: 88 MB
% 3.74/2.00  % (1589235)Instruction limit reached! 
% 3.74/2.00  % (1589235)------------------------------
% 3.74/2.00  % (1589235)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.74/2.00  % (1589235)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.74/2.00  % (1589235)CaDiCaL version: 2.1.3
% 3.74/2.00  % (1589235)Termination reason: Instruction limit
% 3.74/2.00  % (1589235)Termination phase: Saturation
% 3.74/2.00  % (1589235)Time elapsed: 0.074 s
% 3.74/2.00  % (1589235)Peak memory usage: 89 MB
% 3.74/2.00  % (1589235)Instructions burned: 126 (million)
% 3.74/2.00  % (1589230)------------------------------
% 3.74/2.00  % (1589230)------------------------------
% 3.74/2.00  % (1589241)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=3313361651:avsq=on:i=194:fgj=on:bd=preordered_2993 on theBenchmark for (2993ds/194Mi)
% 3.74/2.00  % (1589216)First to succeed.
% 3.74/2.00  % (1589216)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1589197"
% 3.74/2.00  % (1589234)------------------------------
% 3.74/2.00  % (1589234)------------------------------
% 3.74/2.00  % (1589233)------------------------------
% 3.74/2.00  % (1589233)------------------------------
% 3.74/2.00  % (1589242)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=3452034145:i=157:gtg=all_2992 on theBenchmark for (2992ds/157Mi)
% 3.74/2.00  % (1589241)Instruction limit reached! 
% 3.74/2.00  % (1589241)------------------------------
% 3.74/2.00  % (1589241)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.74/2.00  % (1589241)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.74/2.00  % (1589241)CaDiCaL version: 2.1.3
% 3.74/2.00  % (1589241)Termination reason: Instruction limit
% 3.74/2.00  % (1589241)Termination phase: Saturation
% 3.74/2.00  % (1589241)Time elapsed: 0.127 s
% 3.74/2.00  % (1589241)Peak memory usage: 90 MB
% 3.74/2.00  % (1589241)Instructions burned: 194 (million)
% 3.74/2.00  % (1589258)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=1946180422:i=3394:sd=4:ss=included:sgt=64_2992 on theBenchmark for (2992ds/3394Mi)
% 3.74/2.00  % (1589216)Refutation found. Thanks to Tanya!
% 3.74/2.00  % SZS status Unsatisfiable for theBenchmark
% 3.74/2.00  % SZS output start Proof for theBenchmark
% See solution above
% 7.41/2.19  % (1589216)------------------------------
% 7.41/2.19  % (1589216)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.41/2.19  % (1589216)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.41/2.19  % (1589216)CaDiCaL version: 2.1.3
% 7.41/2.19  % (1589216)Termination reason: Refutation
% 7.41/2.19  % (1589216)Time elapsed: 0.620 s
% 7.41/2.19  % (1589216)Peak memory usage: 132 MB
% 7.41/2.19  % (1589216)Instructions burned: 1306 (million)
% 7.41/2.19  % (1589216)------------------------------
% 7.41/2.19  % (1589216)------------------------------
% 7.41/2.19  % (1589197)Success in time 0.926 s
% 7.41/2.19  % Vampire exiting
%------------------------------------------------------------------------------